Primality Testing — A Deterministic Algorithm
The most ancient and simple method for testing if a number is prime or not consists in factoring n. Using the fact that a non prime has a divisor r such that . We obtain a method usable for numbers up to 1016 on a computer. It necessitates operations, which is large when n is big. Remarkable improvements have been made. On a pocket calculator one can factor numbers up to 1018 and on a large computer up to 1040 with 0(n1/4) algorithms.
KeywordsPrime Ideal Remarkable Improvement Deterministic Algorithm Primitive Root Riemann Hypothesis
Unable to display preview. Download preview PDF.
- Test de primalité d’après, Adleman, Rumely, Pomerance, Lenstra. H. Cohen. Université scientifique et medicale de Grenoble.Google Scholar
- Lenstra, Tests de primalité, Seminaire Bourbaki, Juin 1981.Google Scholar
- Rabin, Probabilistic algorithms for testing primality. J. Number theory 12 (1980) pp. 128–138.Google Scholar
- Williams, Primality testing on a computer, Ars combina toria, 5(1978).Google Scholar