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 1

### Related categories 3

### Sites 2

Primality Proving

Covers different types of primality tests, such as quick, classical and general purpose prime filters. Page includes bibliography.

Manindra Agrawal

Papers including "PRIMES is in P" by Agrawal, Kayal and Saxena (AKS). It presents a polynomial-time primality proving algorithm for any number.

Last update:

April 30, 2016 at 17:57:34 UTC
Copyright © 1998-2016 AOL Inc.

Built by CMBuild