> Referring to the work, recently in the news, of Mssrs. Manindra > Agrawal, Neeraj Kayal and Nitin Saxena.
This is the same work to which Jens Pfeiffer referred in a Wed, 7 Aug 2002 17:37:27 +0200 posting with subject "Mersenne: find primes in polynomial time?" Parallelling Paul Leyland's response then: The Lucas-Lehmer primality testing algorithm in GIMPS software is restricted to only a very special form of prime, 2^p - 1. In contrast, the new AKS algorithm applies to _all_ primes. On primes of the form 2^p -1, the Lucas-Lehmer test in GIMPS software is *MUCH, MUCH* faster than the new AKS algorithm. However, the new AKS algorithm will work on other forms of primes to which the Lucas-Lehmer test is not applicable. Richard Woods _________________________________________________________________________ Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
