Guest guest Posted November 24, 2002 Report Share Posted November 24, 2002 Professor Manindra Agrawal and his students, Neeraj Kayal and Nitin Saxena, have discovered a polynomial time deterministic algorithm (an algorithm that is efficient in terms of the time it takes to compute) to test if a given number is a prime number. One of the fundamental problems, however, is to efficiently determine if a given number is a prime number. Many approaches, including sophisticated techniques from mathematics, have been tried, but none had succeeded until now. "The usual method we learn in school," says Agarwal, "if used on large numbers (say with 100 digits) will take more time than the age of the universe, even if we use the fastest computers currently available." http://www.cse.iitk.ac.in/news/primality.html The algorithm is available on the IIT Kanpur Web site at www.cse.iitk.ac.in/news/primality.pdf Quote Link to comment Share on other sites More sharing options...
Recommended Posts
Join the conversation
You are posting as a guest. If you have an account, sign in now to post with your account.
Note: Your post will require moderator approval before it will be visible.