Agrawal–Kayal–Saxena primality test

Algorithm checking for prime numbers

The Agrawal–Kayal–Saxena primality test (also known as the AKS primality test and the cyclotomic AKS test) is a deterministic primality-proving algorithm created and published by Manindra Agrawal, Neeraj Kayal, and Nitin Saxena, computer scientists at the Indian Institute of Technology Kanpur, on August 6, 2002, in an article titled "PRIMES is in P". The algorithm was the first one which is able to determine in polynomial time, whether a given number is prime or composite without relying on mathematical conjectures such as the generalized Riemann hypothesis. The proof is also notable for not relying on the field of analysis.

From Wikipedia, under CC BY-SA. More on occurri.