You're reading: Posts Tagged: distributed computing

919444¹⁰⁴⁸⁵⁷⁶ + 1 is prime

Distributed internet prime number search PrimeGrid has found a new largest generalised Fermat prime.

The discovery was made on 29th August, and was double-checked before being announced on 2nd September. PrimeGrid uses a distributed computing approach and uses spare computer time donated by volunteer computers connected to their network.

A generalised Fermat prime is a prime number of the form $a^{2^n} + 1$, with $a \gt 0$. It’s called ‘generalised’ because ‘Fermat prime’ is the name for the particular case $a=2$.

Much like Mersenne primes, there are special tests which make it much easier to check if a number of this form is prime than for a general number. For this reason, they’re a good place to look for new large primes.

Until now only 392 generalised Fermat primes had been found: this new discovery makes 393. At 6,253,210 digits long, it’s now the 12th largest of all known primes, and the second-largest known non-Mersenne prime.

PrimeGrid have put out an announcement in PDF format giving some more details about the search, and credits for the many people involved writing algorithms and providing computers to run them on.

The PrimeGrid homepage has more information about the many different prime number searches they run, and how to join in the search with your own PC.

New Mersenne prime discovered, and promptly printed out

Breaking news! On 19th January 2016, the Great Internet Mersenne Prime Search discovered a new largest prime number – we know 49 Mersenne primes, the largest of which is now $2^{74207281}-1$, a number containing over 22 million digits and full of primey goodness.

Internet Maths Person Matt Parker has responded to the news in spectacular style, by issuing a 14-minute long video explaining the discovery and its implications, as well as somehow scoring an interview with the actual discoverer of the new prime, Curtis Cooper.