Block, SkipCaptcha, Upload, Automoderated users, edit, rollback
14,697
edits
Changes
Jump to navigation
Jump to search
mLine 36:
Line 36: − +
→How many prime numbers: ditto
The largest known prime is ''2<sup>57,885,161</sup>-1'', a 17,425,169 digit number beginning with 581,887,266,232... and ending with ...951; it was discovered in 2013 by Curtis Cooper with the '''Great Internet Mersenne Prime Search''' ('''GIMPS''')<ref>http://www.mersenne.org/</ref>, a distributed computing project launched by George Woltman in early 1996.<ref>Multiple references:
The largest known prime is ''2<sup>57,885,161</sup>-1'', a 17,425,169 digit number beginning with 581,887,266,232... and ending with ...951; it was discovered in 2013 by Curtis Cooper with the '''Great Internet Mersenne Prime Search''' ('''GIMPS''')<ref>http://www.mersenne.org/</ref>, a distributed computing project launched by George Woltman in early 1996.<ref>Multiple references:
* http://primes.utm.edu/largest.html
* http://primes.utm.edu/largest.html
* The number two raised to successively larger powers cause the last three digits to fairly quickly begin repeating themselves in cycles of one hundred, so it is known that the last digits of this Mersenne prime end with ...951.</ref>
* 2<sup>57,885,161</sup> = 10 ^ (57,885,161 log 2). The number two raised to successively larger powers cause the last three digits to fairly quickly begin repeating themselves in cycles of one hundred, so it is known that the last digits of this Mersenne prime end with ...951.</ref>
A '''Mersenne prime''' is a prime number ''M'' that is of the form ''M = 2<sup>n</sup> − 1'', where ''n'' is some [[prime number]]<ref>[http://mathworld.wolfram.com/MersennePrime.html Mersenne Prime] from Wolfram</ref>. As of 2015, only 48 Mersenne Primes have been found.<ref>http://primes.utm.edu/largest.html#largest</ref> The largest known prime, ''2<sup>57885161</sup>-1'', is a Mersenne Prime. The concept of a Mersenne Prime was discovered by the French theologian, philosopher and mathematician [[Marin Mersenne]].
A '''Mersenne prime''' is a prime number ''M'' that is of the form ''M = 2<sup>n</sup> − 1'', where ''n'' is some [[prime number]]<ref>[http://mathworld.wolfram.com/MersennePrime.html Mersenne Prime] from Wolfram</ref>. As of 2015, only 48 Mersenne Primes have been found.<ref>http://primes.utm.edu/largest.html#largest</ref> The largest known prime, ''2<sup>57885161</sup>-1'', is a Mersenne Prime. The concept of a Mersenne Prime was discovered by the French theologian, philosopher and mathematician [[Marin Mersenne]].