Primality Tests Prime Numbers Number Theory

Primality Tests Prime Numbers Number Theory

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.

Top: Science: Math: Number Theory: Prime Numbers: Primality Tests

See Also:

Top/Science/Math/Number Theory/Computational

Lucas Sequences in Cryptography - Focus on their use in primality testing, with pseudo-code. Includes an explanation of the strong Lucas PRP test.
Detecting False Reports in Primality Tests by the Oddcomp(z) Method - Suggests to measure reliability of probabilistic primality tests by applying them to odd composites. No false prime reports found in Maple's isprime.
Pseudoprimes/Probable Primes - Papers on primality tests and Frobenius pseudoprimes by Jon Grantham.
Least Primitive Root of Prime Numbers - Empirical and statistical results showing the smallest base required to prove a number is prime. Includes theory and conjectures.
MathWorld: Primality Testing - Articles on many different tests and related subjects.

Help build the largest human-edited directory on the web.
Submit a Site - Open Directory Project - Become an Editor
Click here to add, change or remove your listing

MySQL - Cache Direct sec.