Testing an integer for prime or composite character. Probabilisitc tests yield an answer with high probability of correctness, primality proofs yield an answer which is certain to be correct, often with a certificate of primality which can be verified more easily than the original proof.
Please submit sites with theoretical content, or sites that apply this theoretical content in the organized search for prime numbers. Software packages that apply these theorems should be listed under the appropriate subcategory.