Kevin Brown explains the mathematics behind the classical "N-1" method to prove primes.
Covers different types of primality tests, such as quick, classical and general purpose prime filters. Page includes bibliography.
Papers including "PRIMES is in P" by Agrawal, Kayal and Saxena (AKS). It presents a polynomial-time primality proving algorithm for any number.
Answers to some common questions about the proof that testing for primality is a polynomial-time problem. By Anton Stiglic.
Science /
Math /
Number_Theory /
Elliptic_Curves_and_Modular_Forms
|