Mersenne search
https://plus.maths.org/content/taxonomy/term/1131
enLooking for lost primes
https://plus.maths.org/content/looking-lost-primes
<div class="field field-type-filefield field-field-abs-img">
<div class="field-items">
<div class="field-item odd">
<img class="imagefield imagefield-field_abs_img" width="100" height="100" alt="" src="https://plus.maths.org/content/sites/plus.maths.org/files/abstractpics/5/20_jan_2014_-_1653/icon.png?1390236820" /> </div>
</div>
</div>
<div class="field field-type-text field-field-abs-txt">
<div class="field-items">
<div class="field-item odd">
<p>Look for hidden gems in the gaps between known prime numbers.</p>
</div>
</div>
</div>
<p>Prime numbers — we've often reported on them here on <em>Plus</em>, and in particular we've followed the progress of the <a href="http://www.mersenne.org/">Great Internet Mersenne Prime Search</a>. It's one of the longest-running grassroots distributed computing projects. Users donate their computing power to search for these special type of primes, and of course the goal is to find bigger and bigger ones. The latest prime to be discovered by the project is <em>2<sup>57,885,161</sup>-1</em>.<p><a href="https://plus.maths.org/content/looking-lost-primes" target="_blank">read more</a></p>https://plus.maths.org/content/looking-lost-primes#commentsGIMPSMersenne primeMersenne searchprime numberTue, 21 Jan 2014 09:05:22 +0000mf3446024 at https://plus.maths.org/contentMaths in a minute: Number mysteries
https://plus.maths.org/content/maths-minute-number-mysteries
<p>Number theory is famous for problems that everyone can understand and that are easy to express, but that are fiendishly difficult to prove. Here are some of our favourites.</p>
<h3>The Goldbach conjecture</h3>
<p>The Goldbach conjecture is named after the mathematician <a href="http://www-history.mcs.st-and.ac.uk/Biographies/Goldbach.html">Christian Goldbach</a> who formulated it in the middle of the eighteenth century. It states that any even natural number greater than 2 can be written as the sum of two prime numbers. </p><p><a href="https://plus.maths.org/content/maths-minute-number-mysteries" target="_blank">read more</a></p>https://plus.maths.org/content/maths-minute-number-mysteries#commentsGoldbach ConjectureMersenne primeMersenne searchnumber theoryperfect numberprime numberTue, 16 Jul 2013 08:49:15 +0000mf3445925 at https://plus.maths.org/contentPerilous primes
https://plus.maths.org/content/perilous-primes
<div class="pub_date">January 1999</div>
<!-- plusimport --><br clear="all"></br>
<!-- END OF FILE: newinclude/news_header.html -->
<p>In "<a href="/issue1/news/primes/index.html">Discovering new primes</a>" and "<a href="/issue3/news/prime/index.html">Primes update: success again!</a>", PASS Maths has been following progress in the hunt for Mersenne primes. It seems that some people are taking the search too seriously for their own good!</p><p><a href="https://plus.maths.org/content/perilous-primes" target="_blank">read more</a></p>https://plus.maths.org/content/perilous-primes#commentsGIMPSMersenne primeMersenne searchprime numberFri, 01 Jan 1999 00:00:00 +0000plusadmin2688 at https://plus.maths.org/content