Adleman–Pomerance–Rumely primality test
From Infogalactic: the planetary knowledge core
In computational number theory, the Adleman–Pomerance–Rumely primality test is an algorithm for determining whether a number is prime. Unlike other, more efficient algorithms for this purpose, it avoids the use of random numbers, so it is a deterministic primality test. It is named after its discoverers, Leonard Adleman, Carl Pomerance, and Robert Rumely. The test involves arithmetic in cyclotomic fields.
It was later improved by Henri Cohen and Hendrik Willem Lenstra, commonly referred to as APR-CL. It can test primality of an integer n in time:
Software implementations
- UBASIC provides an implementation under the name APRT-CLE (APR Test CL extended)
- A factoring applet that uses APR-CL on certain conditions (source code included)
- Pari/GP uses APR-CL conditionally in its implementation of isprime().
- mpz_aprcl is an open source implementation using C + GMP.
References
- Lua error in Module:Citation/CS1/Identifiers at line 47: attempt to index field 'wikibase' (a nil value).
- Lua error in Module:Citation/CS1/Identifiers at line 47: attempt to index field 'wikibase' (a nil value).
- Riesel, Hans (1994). Prime Numbers and Computer Methods for Factorization. Birkhäuser. pp. 131–136. ISBN 0-8176-3743-5.<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>
- APR and APR-CL
This algorithms or data structures-related article is a stub. You can help Infogalactic by expanding it. |
This number theory-related article is a stub. You can help Infogalactic by expanding it. |