General

[The Prime Pages]
[BigPrimes.net]
[Number Thory]
[Prime Testes]
[The 1,000 smallest prime numbers ]
[Prime Number ]
[Prime numbers]
[Twin Primes ]
[Landon Curt Noll's prime pages]


Important Theorems

[The Fundamental Thorem of Arithmetics]
[ proof of the fundamental theorem of arithmetic ]
[gcd and the Fundamental Theorem of Arithmetic ]
[Fundamental Theorem of Arithmetic]
[Fermat's Little Theorem]
[Quadratic Reciprocity]
[The Sum of The Prime Factors of N]


Primality Tests

[Adleman-Pomerance-Rumely primality test]
[AKS primality test]
[Baillie-PSW primality test]
[Elliptic curve primality proving]
[Fermat primality test]
[Lucas–Lehmer test]
[Lucas's Primality Test With Factored N-1]
[Miller-Rabin primality test]
[MPrime]
[NewPGen]
[Pépin's test]
[Primality certificate]
[Prime95]
[Proth's theorem]
[Sieve of Atkin]
[Sieve of Eratosthenes]
[Sieve of Sundaram]
[Solovay-Strassen primality test]
[Trial division]
[Wheel factorization]



Glossary

[Primality test]
[Probable prime]
[Congruence relation]
[Modular arithmetic]
[Perfect square]
[Square number]
[Primitive root modulo n]



General Purpose
Integer Factorization

[Continued fraction factorization]
[Dixon's factorization method]
[Quadratic sieve]
[General number field sieve]
[Shanks' square forms factorization]


Special Purpose
Integer Factorization

[Algebraic-group factorisation algorithm]
[Fermat's factorization method]
[Lenstra elliptic curve factorization]
[Pollard's p - 1 algorithm]
[Pollard's rho algorithm]
[Special number field sieve]
[Trial division]
[Williams' p + 1 algorithm]
[Shor's algorithm]