Adleman–Pomerance–Rumely primality test
- Adleman–Pomerance–Rumely primality test
The Adleman–Pomerance–Rumely primality test (APR) is a deterministic algorithm that tests if a positive integer is prime. It is named after its discoverers, Leonard Adleman, Carl Pomerance, and Robert Rumely.
It was later improved by Henri Cohen and Arjen Lenstra and called APRT-CL. It is often used with UBASIC under the name APRT-CLE (APRT-CL extended) and has complexity :
External links
* [http://primes.utm.edu/prove/prove4_1.html APR and APR-CL]
*A [http://alpertron.com.ar/ECM.HTM factoring applet] that uses APR-CL on certain conditions (source code included)
References
*
*
Wikimedia Foundation.
2010.
Look at other dictionaries:
Primality test — A primality test is an algorithm for determining whether an input number is prime. Amongst other fields of mathematics, it is used for cryptography. Unlike integer factorization, primality tests do not generally give prime factors, only stating… … Wikipedia
Leonard Adleman — (* 31. Dezember 1945 in San Francisco) ist Professor für Informatik und Molekularbiologie an der University of Southern California in Los Angeles. Für die Entwicklung des RSA Algorithmus erhielt er im Jahr 20 … Deutsch Wikipedia
Carl Pomerance — Pour les articles homonymes, voir Pomerance. Carl Pomerance (né en 1944 à Joplin, Missouri) est un théoricien des nombres américain, particulièrement productif et connu dans son domaine de recherche[1]. Il fut élève à l université Brown et reçut… … Wikipédia en Français
Leonard Adleman — Infobox Scientist name = Leonard Max Adleman image width = 200px caption = birth date = birth date and age|1945|12|31 birth place = flagicon|United States California death date = death place = residence = citizenship = nationality = ethnicity =… … Wikipedia
Carl Pomerance — (born in 1944 in Joplin, Missouri) is a well known number theorist. He attended college at Brown University and later received his Ph.D. from Harvard University in 1972 with a dissertation proving that any odd perfect number N has at least 7… … Wikipedia
Test de primalidad — El 39º número primo de Mersenne era el mayor conocido hasta la fecha de creación de este artículo. La cuestión de la determinación de si un número n … Wikipedia Español
Robert Rumely — Robert Scott Rumely (* 23. Juni 1952 in Pullman (Washington)) ist ein US amerikanischer Mathematiker, der sich mit Zahlentheorie beschäftigt. Inhaltsverzeichnis 1 Leben 2 Schriften 3 Weblinks … Deutsch Wikipedia
Test de primalidad AKS — El test de primalidad AKS o algoritmo AKS es un algoritmo determinista que decide en tiempo polinómico si un número natural es primo o compuesto. Fue diseñado por los científicos de computación Manindra Agrawal, Neeraj Kayal y Nitin Saxena del… … Wikipedia Español
Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… … Wikipedia
Тест Агравала — В информатике тест Агравала Каяла Саксены (или тест AKS) это полиномиальный детерминированный тест простоты чисел, предложенный индийскими учёным Маниндрой Агравалом (англ.) и его двумя студентами Нираджем Каялом (англ … Википедия
