Topics  Register • News • History • How to • Sequences statistics • Template prototypes 
Difference between revisions of "Mersenne prime"
(14 intermediate revisions by 2 users not shown)  
Line 1:  Line 1:  
−  In mathematics, a '''Mersenne prime''' is a [[  +  In mathematics, a '''Mersenne prime''' is a [[prime]] that is one less than a [[power of two]]. For example, 3 = 4 − 1 = {{Kbn2}} is a Mersenne prime; so is 7 = 8 − 1 = {{Kbn3}}. On the other hand, 15 = 16 − 1 = {{Kbn4}}, for example, is not a prime, because 15 is divisible by 3 and 5. 
More generally, [[Mersenne number]]s (not necessarily primes, but candidates for primes) are numbers that are one less than a power of two; hence,  More generally, [[Mersenne number]]s (not necessarily primes, but candidates for primes) are numbers that are one less than a power of two; hence,  
Line 10:  Line 10:  
==Searching for Mersenne primes==  ==Searching for Mersenne primes==  
−  
The calculation  The calculation  
−  
:<math>(2^a1)\cdot \left(1+2^a+2^{2a}+2^{3a}+ ... +2^{(b1)a}\right)=2^{ab}1</math>  :<math>(2^a1)\cdot \left(1+2^a+2^{2a}+2^{3a}+ ... +2^{(b1)a}\right)=2^{ab}1</math>  
−  +  shows that {{VM<sub>n</sub>}} can be prime only if {{Vn}} itself is prime, which simplifies the search for Mersenne primes considerably. But the converse is not true; {{VM<sub>n</sub>}} may be [[Composite numbercomposite]] even though {{Vn}} is prime. For example, <math>2^{11}  1 = 23 \cdot 89</math>.  
−  shows that  
Fast algorithms for finding Mersenne primes are available, and this is why the largest known prime numbers today are Mersenne primes.  Fast algorithms for finding Mersenne primes are available, and this is why the largest known prime numbers today are Mersenne primes.  
−  The first four Mersenne primes  +  The first four Mersenne primes {{VM<sub>2</sub>}}, {{VM<sub>3</sub>}}, {{VM<sub>5</sub>}}, {{VM<sub>7</sub>}} were known in antiquity. 
−  The fifth,  +  The fifth, {{VM<sub>13</sub>}}, was discovered anonymously before 1461; the next two ({{VM<sub>17</sub>}} and {{VM<sub>19</sub>}}) were found by Pietro Cataldi in 1588. After more than a century {{VM<sub>31</sub>}} was verified to be prime by [[Leonhard Euler]] in 1750. The next (in historical, not numerical order) was {{VM<sub>127</sub>}}, found by [[Édouard Lucas]] in 1876, then {{VM<sub>61</sub>}} by Ivan Pervushin in 1883. Two more  {{VM<sub>89</sub>}} and {{VM<sub>107</sub>}}  were found early in the 20th century, by R. E. Powers in 1911 and 1914, respectively. 
−  The numbers are named after 17th century French mathematician [[Marin Mersenne]], who provided a list of Mersenne primes with exponents up to 257; unfortunately, his list was not correct, though, as he mistakenly included  +  The numbers are named after 17th century French mathematician [[Marin Mersenne]], who provided a list of Mersenne primes with exponents up to 257; unfortunately, his list was not correct, though, as he mistakenly included {{VM<sub>67</sub>}} and {{VM<sub>257</sub>}}, and omitted {{VM<sub>61</sub>}}, {{VM<sub>89</sub>}} and {{VM<sub>107</sub>}}. 
−  The best method presently known for testing the primality of Mersenne numbers is based on the computation of a recurring sequence, as developed originally by [[  +  The best method presently known for testing the primality of Mersenne numbers is based on the computation of a recurring sequence, as developed originally by [[Édouard Lucas]] in 1878 and improved by [[Derrick Henry Lehmer]] in the 1930s, now known as the [[LucasLehmer test]]. Specifically, it can be shown that if {{Vp}} is an odd prime, then <math>M_p=2^p1</math> is prime if and only if {{VM<sub>p</sub>}} evenly divides <math>S_{p2}</math>, where <math>S_0=4</math> and for <math>k>0</math>, <math>S_k=S_{k1}^22</math>. 
−  The search for Mersenne primes was revolutionized by the introduction of the electronic digital computer. The first successful identification of a Mersenne prime,  +  The search for Mersenne primes was revolutionized by the introduction of the electronic digital computer. The first successful identification of a Mersenne prime, {{VM<sub>521</sub>}}, by this means was achieved at 10:00 P.M. on 19520130 using the U.S. National Bureau of Standards Western Automatic Computer (SWAC) at the Institute for Numerical Analysis at the University of California, Los Angeles, under the direction of [[Derrick Henry Lehmer]], with a computer search program written and run by [[Raphael M. Robinson]]. It was the first Mersenne prime to be identified in thirtyeight years; the next one, {{VM<sub>607</sub>}}, was found by the computer a little less than two hours later. Three more — {{VM<sub>1279</sub>}}, {{VM<sub>2203</sub>}}, {{VM<sub>2281</sub>}} — were found by the same program in the next several months. {{VM<sub>4253</sub>}} is the first Mersenne prime that is [[Titanic primeTitanic]], {{VM<sub>44497</sub>}} is the first [[Gigantic primeGigantic]] and {{VM<sub>{{Num6972593}}</sub>}} is the first [[MegaprimeMegaprime]]. 
−  The greatest Mersenne  +  The greatest Mersenne prime so far is {{Greatest Mersenne Primepure}}. Like several previous Mersenne primes, it was discovered by a [[distributed computing]] project on the Internet, known as the ''[[Great Internet Mersenne Prime Search]]'' (GIMPS). 
==See also==  ==See also==  
+  * [[List of known Mersenne primes]]  
+  * [[Riesel prime 2 1Riesel primes for k=1]]  
* [[George Woltman]]  * [[George Woltman]]  
* [[Great Internet Mersenne Prime SearchGIMPS]]  * [[Great Internet Mersenne Prime SearchGIMPS]]  
−  * [[  +  * [[Mersenne number]] 
−  * [[  +  * [[Prime95]] 
−  
==External links==  ==External links==  
−  * [http://www.mersenne.org Great Internet Mersenne Prime Serarch (GIMPS)]  +  * [http://www.mersenne.org Great Internet Mersenne Prime Serarch (GIMPS)] 
−  * [http://www.utm.edu/research/primes/mersenne.shtml prime Mersenne Numbers  History, Theorems and Lists]  +  * [http://www.utm.edu/research/primes/mersenne.shtml prime Mersenne Numbers  History, Theorems and Lists] 
−  * [http://mathworld.wolfram.com/MersenneNumber.html Mersenne numbers]  +  * [http://mathworld.wolfram.com/MersenneNumber.html Mersenne numbers] 
−  * [http://mathworld.wolfram.com/MersennePrime.html prime Mersenne numbers]  +  * [http://mathworld.wolfram.com/MersennePrime.html prime Mersenne numbers] 
−  * [http://www.utm.edu/research/primes/mersenne/LukeMirror/biblio.htm Mersenne Prime Bibliography]  +  * [http://www.utm.edu/research/primes/mersenne/LukeMirror/biblio.htm Mersenne Prime Bibliography] 
−  * [[Wikipedia:Mersenne prime  +  * [[Wikipedia:Mersenne primeMersenne prime]] (source) 
−  [[Category:  +  {{Navbox NumberClasses}} 
+  [[Category:Mersenne prime ]] 
Latest revision as of 14:53, 19 September 2021
In mathematics, a Mersenne prime is a prime that is one less than a power of two. For example, 3 = 4 − 1 = 2^{2}1 is a Mersenne prime; so is 7 = 8 − 1 = 2^{3}1. On the other hand, 15 = 16 − 1 = 2^{4}1, for example, is not a prime, because 15 is divisible by 3 and 5.
More generally, Mersenne numbers (not necessarily primes, but candidates for primes) are numbers that are one less than a power of two; hence,
 [math]\displaystyle{ M_n=2^n{}1 }[/math] .
Mersenne primes have a close connection to perfect numbers, which are numbers that are equal to the sum of their proper divisors. Historically, the study of Mersenne primes was motivated by this connection; in the 4th century BC Euclid demonstrated that if M is a Mersenne prime then M(M+1)/2 is a perfect number. Two millennia later, in the 18th century, Euler proved that all even perfect numbers have this form. No odd perfect numbers are known, and it is suspected that none exists.
It is currently unknown whether there is an infinite number of Mersenne primes.
Searching for Mersenne primes
The calculation
 [math]\displaystyle{ (2^a1)\cdot \left(1+2^a+2^{2a}+2^{3a}+ ... +2^{(b1)a}\right)=2^{ab}1 }[/math]
shows that M_{n} can be prime only if n itself is prime, which simplifies the search for Mersenne primes considerably. But the converse is not true; M_{n} may be composite even though n is prime. For example, [math]\displaystyle{ 2^{11}  1 = 23 \cdot 89 }[/math].
Fast algorithms for finding Mersenne primes are available, and this is why the largest known prime numbers today are Mersenne primes.
The first four Mersenne primes M_{2}, M_{3}, M_{5}, M_{7} were known in antiquity. The fifth, M_{13}, was discovered anonymously before 1461; the next two (M_{17} and M_{19}) were found by Pietro Cataldi in 1588. After more than a century M_{31} was verified to be prime by Leonhard Euler in 1750. The next (in historical, not numerical order) was M_{127}, found by Édouard Lucas in 1876, then M_{61} by Ivan Pervushin in 1883. Two more  M_{89} and M_{107}  were found early in the 20th century, by R. E. Powers in 1911 and 1914, respectively.
The numbers are named after 17th century French mathematician Marin Mersenne, who provided a list of Mersenne primes with exponents up to 257; unfortunately, his list was not correct, though, as he mistakenly included M_{67} and M_{257}, and omitted M_{61}, M_{89} and M_{107}.
The best method presently known for testing the primality of Mersenne numbers is based on the computation of a recurring sequence, as developed originally by Édouard Lucas in 1878 and improved by Derrick Henry Lehmer in the 1930s, now known as the LucasLehmer test. Specifically, it can be shown that if p is an odd prime, then [math]\displaystyle{ M_p=2^p1 }[/math] is prime if and only if M_{p} evenly divides [math]\displaystyle{ S_{p2} }[/math], where [math]\displaystyle{ S_0=4 }[/math] and for [math]\displaystyle{ k\gt 0 }[/math], [math]\displaystyle{ S_k=S_{k1}^22 }[/math].
The search for Mersenne primes was revolutionized by the introduction of the electronic digital computer. The first successful identification of a Mersenne prime, M_{521}, by this means was achieved at 10:00 P.M. on 19520130 using the U.S. National Bureau of Standards Western Automatic Computer (SWAC) at the Institute for Numerical Analysis at the University of California, Los Angeles, under the direction of Derrick Henry Lehmer, with a computer search program written and run by Raphael M. Robinson. It was the first Mersenne prime to be identified in thirtyeight years; the next one, M_{607}, was found by the computer a little less than two hours later. Three more — M_{1279}, M_{2203}, M_{2281} — were found by the same program in the next several months. M_{4253} is the first Mersenne prime that is Titanic, M_{44497} is the first Gigantic and M_{6,972,593} is the first Megaprime.
The greatest Mersenne prime so far is 2^{82,589,933}1. Like several previous Mersenne primes, it was discovered by a distributed computing project on the Internet, known as the Great Internet Mersenne Prime Search (GIMPS).
See also
External links
 Great Internet Mersenne Prime Serarch (GIMPS)
 prime Mersenne Numbers  History, Theorems and Lists
 Mersenne numbers
 prime Mersenne numbers
 Mersenne Prime Bibliography
 Mersenne prime (source)
General numbers 
Special numbers 
Prime numbers 
