“Adleman–Pomerance–Rumely primality test”的意思、由来-开放百科全书

词条

Adleman–Pomerance–Rumely primality test

释义

Software implementations
References

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 and GMP.
Jean Penné's LLR uses APR-CL on certain types of prime tests as a fallback option.

References

{{cite journal | last1=Adleman | first1=Leonard M. | author1-link=Leonard Adleman | last2=Pomerance | first2=Carl | author2-link=Carl Pomerance | last3=Rumely | first3=Robert S. | author3-link=Robert Rumely | title=On distinguishing prime numbers from composite numbers | journal=Annals of Mathematics |volume=117 | issue=1 | year=1983 | pages=173–206 | doi=10.2307/2006975 | jstor=2006975 }}
{{cite journal | last1=Cohen | first1=Henri | author1-link=Henri Cohen (number theorist)|

last2=Lenstra | first2=Hendrik W., Jr. | author2-link=Hendrik Lenstra | title=Primality testing and Jacobi sums | journal=Mathematics of Computation | volume=42 | year=1984 | pages=297–330 | issue=165 | doi=10.2307/2007581 | jstor=2007581 }}

{{cite book | last=Riesel | first = Hans | authorlink=Hans Riesel | title=Prime Numbers and Computer Methods for Factorization | publisher=Birkhäuser | year=1994 | isbn=978-0-8176-3743-9 | pages=131–136 }}
APR and APR-CL

{{number theoretic algorithms}}{{DEFAULTSORT:Adleman-Pomerance-Rumely primality test}}{{algorithm-stub}}{{numtheory-stub}}

1 : Primality tests

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。