1,066
edits
Changes
Jump to navigation
Jump to search
Line 48:
Line 48: + + + +
→Since this article is currently protected...: poke?
You can't have an article on primes that discusses primality testing and doesn't mention Agrawal's algorithm. There needs to be a mention of the AKS test which allows primality testing in polynomial time. This was a big deal. [[User:JoshuaZ|JoshuaZ]] 20:49, 22 April 2009 (EDT)
You can't have an article on primes that discusses primality testing and doesn't mention Agrawal's algorithm. There needs to be a mention of the AKS test which allows primality testing in polynomial time. This was a big deal. [[User:JoshuaZ|JoshuaZ]] 20:49, 22 April 2009 (EDT)
Suggested addition: In 2002 Manindra Agrawal, Neeraj Kayal, and Nitin Saxena constructed an algorithm that determined primality in polynomial time. This algorithm was based off of a generalization of Fermat's Little Theoren.[http://www.cse.iitk.ac.in/users/manindra/algebra/primality_v6.pdf]
How's that for starters? [[User:JoshuaZ|JoshuaZ]] 12:50, 23 April 2009 (EDT)