The Largest Known Primes -- A Summary
A quick summary of the 5000 largest known primes database
A historic Prime Page resource since 1994!
Last modified: 05:20:29 PM August 12 2020 UTC
- Introduction (What are primes? Who cares?)
- The Top Ten Record Primes:
largest, twin, Mersenne, primorial & factorial, and Sophie Germain
- The Complete List of the Largest Known Primes
- Other Sources of Prime Information
- External: Euclid's Proof of the Infinitude of Primes
Note: The site The Top Twenty is a greatly expanded version of this information. This page summarizes the information on the list of 5000 Largest Known Primes (updated hourly). The complete list of is available in several forms.
An integer greater than one is called a prime number if its only positive divisors (factors) are one and itself. For example, the prime divisors of 10 are 2 and 5; and the first six primes are 2, 3, 5, 7, 11 and 13. (The first 10,000, and other lists are available). The Fundamental Theorem of Arithmetic shows that the primes are the building blocks of the positive integers: every positive integer is a product of prime numbers in one and only one way, except for the order of the factors. (This is the key to their importance: the prime factors of an integer determines its properties.)
The ancient Greeks proved (ca 300 BC) that there were infinitely many primes and that they were irregularly spaced (there can be arbitrarily large gaps between successive primes). On the other hand, in the nineteenth century it was shown that the number of primes less than or equal to n approaches n/(ln n) (as n gets very large); so a rough estimate for the nth prime is n ln n (see the document "How many primes are there?")
The Sieve of Eratosthenes is still the most efficient way of finding all very small primes (e.g., those less than 1,000,000). However, most of the largest primes are found using special cases of Lagrange's Theorem from group theory. See the separate documents on proving primality for more information.
In 1984 Samuel Yates defined a titanic prime to be any prime with at least 1,000 digits [Yates84, Yates85]. When he introduced this term there were only 110 such primes known; now there are over 1000 times that many! And as computers and cryptology continually give new emphasis to search for ever larger primes, this number will continue to grow.
If you want to understand a building, how it will react to weather or fire, you first need to know what it is made of. The same is true for the integers--most of their properties can be traced back to what they are made of: their prime factors. For example, in Euclid's Geometry (over 2,000 years ago), Euclid studied even perfect numbers and traced them back to what we now call Mersenne primes.
"The problem of distinguishing prime numbers from composite numbers and of resolving the latter into their prime factors is known to be one of the most important and useful in arithmetic. It has engaged the industry and wisdom of ancient and modern geometers to such an extent that it would be superfluous to discuss the problem at length... Further, the dignity of the science itself seems to require that every possible means be explored for the solution of a problem so elegant and so celebrated." (Carl Friedrich Gauss, Disquisitiones Arithmeticae, 1801)
See the FAQ for more information on why we collect these large primes!
The largest known prime has almost always been a Mersenne prime. Why Mersennes? Because the way the largest numbers N are proven prime is based on the factorizations of either N+1 or N-1. For Mersennes the factorization of N+1 is as trivial as possible--a power of two!
The Great Internet Mersenne Prime Search (GIMPS) was launched by George Woltman in early 1996, and has had a virtual lock on the largest known prime since then. This is because its excellent free software is easy to install and maintain, requiring little of the user other than watch and see if they find the next big one and maybe win some EFF prize money!
Any record in this list of the top ten is a testament to the incredible amount of work put in by the programmers, project directors (GIMPS, Seventeen or Bust, Generalized Fermat Search...), and the tens of thousands of enthusiasts!
Twin primes are primes of the form p and p+2, i.e., they differ by two. It is conjectured, but not yet proven, that there are infinitely many twin primes (the same is true for all of the following forms of primes). Because discovering a twin prime actually involves finding two primes, the largest known twin primes are substantially smaller than the largest known primes of most other forms.
Click here to see all of the twin primes on the list of the Largest Known Primes.
Note: The idea of prime twins can be generalized to prime triplets,
quadruplets; and more generally, prime k-tuplets. Tony Forbes
keeps a page listing
Mersenne primes are primes of the form 2p-1. These are the easiest type of number to check for primality on a binary computer so they usually are also the largest primes known. GIMPS is steadily finding these behemoths!
Euclid's proof that there are infinitely many primes uses numbers of the form n#+1. Kummer's proof uses those of the form n#-1. Sometimes students look at these proofs and assume the numbers n#+/-1 are always prime, but that is not so. When numbers of the form n#+/-1 are prime they are called primorial primes. Similarly numbers of the form n!+/-1 are called factorial primes. The current record holders and their discoverers are:
Click here to see all of the known primorial, factorial and multifactorial primes on the list of the largest known primes.
A Sophie Germain prime is an odd prime p for which 2p+1 is also prime. These were named after Sophie Germain when she proved that the first case of Fermat's Last Theorem (xn+yn=zn has no solutions in non-zero integers for n>2) for exponents divisible by such primes. Fermat's Last theorem has now been proved completely by Andrew Wiles.
|1||2618163402417·21290000-1||388342||L927||2016||Sophie Germain (p)|
|2||18543637900515·2666667-1||200701||L2429||2012||Sophie Germain (p)|
|3||183027·2265440-1||79911||L983||2010||Sophie Germain (p)|
|4||648621027630345·2253824-1||76424||x24||2009||Sophie Germain (p)|
|5||620366307356565·2253824-1||76424||x24||2009||Sophie Germain (p)|
|6||1068669447·2211088-1||63553||L4166||2020||Sophie Germain (p)|
|7||99064503957·2200008-1||60220||L95||2016||Sophie Germain (p)|
|8||607095·2176311-1||53081||L983||2009||Sophie Germain (p)|
|9||48047305725·2172403-1||51910||L99||2007||Sophie Germain (p)|
|10||137211941292195·2171960-1||51780||x24||2006||Sophie Germain (p)|
Click here to see all of the Sophie Germain primes on the list of Largest Known Primes.
Because of the lag time between writing and printing, books can never keep up with the current prime records (that is why this page exists!) However books can provide the mathematical theory behind these records much better than a limited series of web pages can. Recently there have been quite a number of excellent books published on primes and primality proving. Here are some of my favorite:
- P. Ribenboim, The new book of prime number records, 3rd edition, Springer-Verlag, New York, 1995. (QA246 .R472).
- P. Ribenboim, The little book of bigger primes, Springer-Verlag, New York, 2004. (A less mathematical version of the above text.)
- H. Riesel, Prime numbers and computer methods for factorization, Progress in Mathematics volume 126, Birkäuser Boston, 1994.
- R. Crandall and C. Pomerance, Prime numbers: a computational perspective, Springer-Verlag, New York, 2001. ISBN 0-387-94777-9.
See also [Bressoud89] and [Cohen93] on the page of partially annotated prime references. Also of interest is the Cunningham Project, an effort to factor the numbers in the title of the following book.
- J. Brillhart, et al., Factorizations of bn±1 b = 2,3,5,6,7,10,11,12 up to high powers , American Mathematical Society, 1988 [BLSTW88].