| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "Adleman–Pomerance–Rumely primality test"
(new) |
(Adding to new subcategory) |
||
| Line 10: | Line 10: | ||
==External links== | ==External links== | ||
*[[Wikipedia:Adleman–Pomerance–Rumely_primality_test|Adleman–Pomerance–Rumely primality test]] | *[[Wikipedia:Adleman–Pomerance–Rumely_primality_test|Adleman–Pomerance–Rumely primality test]] | ||
| − | [[Category: | + | |
| + | [[Category:Deterministic primality tests]] | ||
Latest revision as of 01:10, 11 August 2024
The Adleman–Pomerance–Rumely primality test (APR or APRT) is a prime testing algorithm from 1983 divcoverd by Leonard Adleman, Carl Pomerance and Robert Rumely.
1984 this test was improved by Henri Cohen and Hendrik Lenstra and called APR-CL.
