The **largest known prime** as of January 2018 is \(2^{77,232,917} − 1\), which has 23,249,425 digits.^{[1]} A prime number is an integer greater than 1 that has no divisors other than 1 and itself. It is well known that there are infinitely many prime numbers (as proven by Euclid), so the search for very large prime numbers is limitless. The Electronic Frontier Foundation gives monetary prizes to people who discover new large primes.^{[2]}

## Records Edit

The most efficient known algorithm for finding large prime numbers is the Lucas-Lehmer test, which tests Mersenne primes. Thus the largest known primes have been Mersenne primes for a long time. George Woltman's distributed computing program GIMPS, an implementation of the Lucas-Lehmer test, has found all the new records since 1996.

A list of record primes (as of February 23, 2018) is given below:

Rank | Form | Prime number | Year found | Number of digits |
---|---|---|---|---|

1 | Mersenne 50** | \(2^{77,232,917}−1\) | 2018 | 23,249,425 |

2 | Mersenne 49** | \(2^{74,207,281}−1\) | 2016 | 22,338,618 |

3 | Mersenne 48* | \(2^{57,885,161}−1\) | 2013 | 17,425,170 |

4 | Mersenne 47* | \(2^{43,112,609}−1\) | 2008 | 12,978,189 |

5 | Mersenne 46 | \(2^{42,643,801}−1\) | 2009 | 12,837,064 |

6 | Mersenne 45 | \(2^{37,156,667}−1\) | 2008 | 11,185,272 |

7 | Mersenne 44 | \(2^{32,582,657}−1\) | 2006 | 9,808,358 |

8 | Non-Mersenne^{[3]}
| \(1.0223 \cdot 2^{31,172,165}+1\) | 2016 | 9,383,761 |

9 | Mersenne 43 | \(2^{30,402,457}−1\) | 2005 | 9,152,052 |

10 | Mersenne 42 | \(2^{25,964,951}−1\) | 2005 | 7,816,230 |

11 | Mersenne 41 | \(2^{24,036,583}−1\) | 2004 | 7,235,733 |

12 | Mersenne 40 | \(2^{20,996,011}−1\) | 2003 | 6,320,430 |

13 | Generalized Fermat prime | \(9.19444^{1,048,576}+1\)^{[4]}
| 2017 | 6,253,210 |

17 | Mersenne 39 | \(2^{13,466,917}−1\) | 2001 | 4,053,946 |

18 | Non-Mersenne^{[5]}
| \(1.9249\cdot2^{13,018,586}−1\) | 2007 | 3,918,990 |

19 | Non-Mersenne | \(3\cdot2^{11,895,718}-1\) | 2015 | 3,580,969 |

20 | Non-Mersenne | \(3\cdot2^{11,731,850}-1\) | 2015 | 3,531,640 |

21 | Non-Mersenne | \(3\cdot2^{11,484,018}-1\) | 2014 | 3,457,035 |

22 | Non-Mersenne | \(3\cdot2^{10,829,346}+1\) | 2014 | 3,259,959 |

23 | Non-Mersenne | \(4.75856^{524,288}+1\) | 2012 | 2,976,633 |

24 | Non-Mersenne | \(3.56926^{524,288}+1\) | 2012 | 2,911,151 |

42 | Mersenne 38 | \(2^{6,972,593}−1\) | 1999 | 2,098,960 |

356 | Mersenne 37 | \(2^{3,021,377}−1\) | 1998 | 909,526 |

374 | Mersenne 36 | \(2^{2,976,221}−1\) | 1997 | 895,932 |

3,495^{[6]}
| Mersenne 35 | \(2^{1,398,269}−1\) | 1996 | 420,921 |

## Proof of the infinitude of primes Edit

Euclid gives an elegant proof that there are infinite prime numbers.

Suppose there is a finite number of prime numbers*p*

_{1}

*p*

_{2}

*p*

_{3}...

*p*

_{n}, and let their product be

*P*. Then

*P*+ 1 is one more than a multiple of

*p*

_{1}, and one more than a multiple of

*p*

_{2}, etc.

*P*+ 1 is not divisible by any of our primes, and thus it has no prime factors. Since

*P*+ 1 > 1, this is impossible.

## Sources Edit

- ↑ The Largest Known Primes
- ↑ EFF Cooperative Computing Awards
- ↑ The largest known primes. Retrieved 2017-11-04.
- ↑ Press release about discovery of 919,444
^{1,048,576}+1. Retrieved 2017-11-04. - ↑ The largest known primes. Retrieved 2015-01-06.
- ↑ The Prime Database: 2^1398269-1. Retrieved 2017-11-04.