6 articles
AKS primality test
The AKS primality test, or Agrawal-Kayal-Saxena primality test, is a deterministic polynomial-time algorithm deciding whether an integer is prime, announced in 2002 by three researchers at IIT Kanpur.
Carmichael number
A Carmichael number, also called an absolute pseudoprime, is a composite number that satisfies Fermat's little theorem for every base coprime to it, defeating the Fermat primality test.
Fermat pseudoprime
A Fermat pseudoprime to a base is a composite number that satisfies Fermat's little theorem, so it passes the Fermat primality test; the smallest base-2 example is 341.
Miller–Rabin primality test
The Miller–Rabin primality test is a randomized algorithm deciding whether an odd integer is prime; introduced by Gary Miller in 1976 and made unconditional by Michael Rabin in 1980.
Primality test
A primality test (prime testing) is an algorithm deciding whether an integer is prime or composite; Miller–Rabin is the practical workhorse, and AKS proved in 2002 a deterministic polynomial-time test exists.
Prime95
Prime95 is a free program written by George Woltman for the Great Internet Mersenne Prime Search, a distributed project founded in 1996, and doubles as a standard CPU stress-testing tool.