Directory of Primality Proving Resources

Home > Science > Math > Number Theory > Prime Numbers > Primality Tests > Primality Proving

Prime numbers may be considered as the building blocks of the integers, and the problems of factoring numbers into primes and discovering large primes of various forms have a definite nobility. Perhaps somewhat surprisingly, prime numbers may be proven prime without exhaustively testing all potential factors. This category includes links to theoretical information, and organized searches that apply these theorems.

Subcategories

• Software

Resources in This Category

• Manindra Agrawal

  http://www.cse.iitk.ac.in/users/manindra/
  Papers including "PRIMES is in P" by Agrawal, Kayal and Saxena (AKS). It presents a polynomial-time primality proving algorithm for any number.

• Primality Proving

  http://primes.utm.edu/prove/proving.html
  Covers different types of primality tests, such as quick, classical and general purpose prime filters. Page includes bibliography.

Related Categories

• Home > Science > Math > Number Theory > Factoring
• Home > Science > Math > Number Theory > Elliptic Curves and Modular Forms
• Home > Science > Math > Number Theory > Prime Numbers > Mersenne

 

Home > Science > Math > Number Theory > Prime Numbers > Primality Tests > Primality Proving

 

---

 

Thanks to DMOZ, which built a great web directory for nearly two decades and freely shared it with the web. About us