Top : Science : Math : Number Theory : Prime Numbers : Primality Tests :
Primality Proving
Websites
Papers including "PRIMES is in P" by Agrawal, Kayal and Saxena (AKS). It presents a polynomial-time primality proving algorithm.
site exerpt
Manindra's home page I am interested in complexity theory, computational number theory, and cryptography. I am offering the course Computational Number Theory and Algebra this semester. Some recent publications Manindra Agrawal, Neeraj Kayal, Nitin Saxena PRIMES is in...Answers to some common questions about the proof that testing for primality is a polynomial-time problem.
site exerpt
PRIMES is in P little FAQ What is the purpose of this FAQ? Q2. What is a prime number? Q3. What is complexity theory? Q4. What is P? Q5. Are there complexity classes other than P? Q6. Is there a relation...Kevin Brown explains the mathematics behind the classical "N-1" method to prove primes.
site exerpt
Lucas's Primality Test With Factored N-1 Theorem assures us that if N is a prime then b^(N-1 1 (mod N 1) for every integer b coprime to N. In contrast, if N is composite it is quite rare for the above...A list of prime number searches using Yves Gallot's proth.exe program, available to download. Maintained by Ray Ballinger.
site exerpt
Yves Gallot's Proth Search Page Gallot wrote an excellent Win98/NT4.0/ME/XP program which makes it easy for anyone to find record size or otherwise interesting primes, but this creates a problem: without a coordinated effort, many of us were be searching...Discussion group for the primality-testing program, PrimeForm. Includes links to the PrimeForm program's home page, contact and download information.
http://groups.yahoo.com/group/primeform
Covers different types of primality tests, such as quick, classical and general purpose prime filters. Page includes bibliography.
http://primes.utm.edu/prove/proving.html