Empirical and statistical results showing the smallest base required to prove a number is prime. Includes theory and conjectures.
Focus on their use in primality testing, with pseudo-code. Includes an explanation of the strong Lucas PRP test.
Suggests to measure reliability of probabilistic primality tests by applying them to odd composites. No false prime reports found in Maple's isprime.
Papers on primality tests and Frobenius pseudoprimes by Jon Grantham.
Articles on many different tests and related subjects.
Science /
Math /
Number_Theory /
Computational
|