A newly discovered prime number makes its debut

January 31, 2018 by Avner Bar-Hen, The Conversation
The distribution of prime numbers from 1 to 76,800, from left to right and top to bottom. A black pixel means that the number is first, while a white pixel means that it is not. Credit: Wikipedia, CC BY

On December 26, 2017, J. Pace, G. Woltman, S. Kurowski, A. Blosser, and their co-authors announced the discovery of a new prime number: 2⁷⁷²³²⁹¹⁷-1. It's an excellent opportunity to take a small tour through the wonderful world of prime numbers to see how this result was achieved and why it is so interesting.

A prime number is one that is divisible only by itself and the number 1, that is, essentially a number that has no divisor. Some speak of as the atoms of the mathematical universe, others as precious stones.

It is to Euclid that we owe the first two definitions of a prime number:

  • They are infinitely many: the number (1 * 2 * 3 * … * n) +1 is not divisible by any number other than 1 and itself. It is not divisible by any of the numbers less than n, so there exists a (new) prime number greater than n. This is considered the first reduction to absurdity.
  • Any number is the unique product of prime factors.

Eratosthenes, who lived from -276 to -194, proposed a process that allows us to find all prime numbers less than a given natural number N. The process consists of eliminating from a table integers from 2 to N that are multiples of those numbers. By deleting all the multiples, there remain only integers that are not multiples of any integer, and so are prime numbers. The search for efficient algorithms is an active research topic – for example for the Lucas-Lehmer test).

A newly discovered prime number makes its debut
Stamp, CC BY

After the Greek era, there was a long dark period that lasted until the end of the 16th century and the arrival of French theologian and mathematician Marin Mersenne (1588-1648). He was an advocate of Catholic orthodoxy, yet also believed that religion must welcome any updated truth. He was a Cartesian and translator of Galileo.

Mersenne was looking for a formula that would generate all the prime numbers. In particular, he studied the numbers Mp = 2p-1, where p is prime. These numbers are now called Mersenne numbers or Mersenne primes. In 1644 he wrote that Mp is prime for p = 2, 3, 5, 7, 13, 17, 19, 31, 67, 127, 257, and compound – in other words, non-prime – for the other 44 lower p values at 257. These definition actually commits five errors: M61, M89 and M107 are prime, while M67 and M257 are not.

The new prime number discovered at the very end of 2017 corresponds to M77232917. It has 23,249,425 digits – almost a million digits more than the previous record-holding prime. If the number were contained by a document written in the font Times New Roman with a point size of 10 and standard page margins, it would fill 3,845 pages.

The official date of discovery of a prime number is the day that someone declares the result. This is in keeping with tradition: M4253 is reputed not to have one because in 1961 the American mathematician Alexander Hurwitz read a printer output from the end forward, and found M4423 a few seconds before seeing M4253. The previous Mersenne number also had a complicated history: the computer reported the result to the server on September 17, 2015, but a bug blocked the email. The prime number remained unnoticed until January 7, 2016.

Quantum cryptography

We often refer to the use of prime numbers in cryptography, but they're too big to be really useful. (There is hope that quantum cryptography will change things.) Historically, Mersenne's search for prime numbers has been used as a test for computer hardware. In 2016, the premium95 community discovered a flaw in Intel's Skylake CPU as well as many PCs. This prime was found as part of the Great Internet Mersenne Prime Search Project (GIMPS).

2⁷⁷²³²⁹¹⁷-1 is the 50th Mersenne prime and if the challenge to discover the 51st tempts you, the verification program is available to all – and there's even a $3,000 prize.

Explore further: GIMPS project discovers largest known prime number

Related Stories

GIMPS project discovers largest known prime number

January 4, 2018

The Great Internet Mersenne Prime Search (GIMPS) has discovered the largest known prime number, 277,232,917-1, having 23,249,425 digits. A computer volunteered by Jonathan Pace made the find on December 26, 2017.

University professor discovers largest prime number to date

February 6, 2013

(Phys.org)—Curtis Cooper, professor of math and computer science at the University of Central Missouri, has discovered the largest prime number to date, it's 257,885,161 – 1. It has 17 million digits and is also a Mersenne ...

New largest prime number found

January 20, 2016

(Phys.org)—A team at the University of Central Missouri, headed by Curtis Cooper has announced, via press release from the Mersenne organization, that they have found the largest prime number ever—it is 274,207,281 – ...

The sum of digits of prime numbers is evenly distributed

May 12, 2010

(PhysOrg.com) -- On average, there are as many prime numbers for which the sum of decimal digits is even as prime numbers for which it is odd. This hypothesis, first made in 1968, has recently been proven by French researchers ...

Recommended for you


Adjust slider to filter visible comments by rank

Display comments: newest first

5 / 5 (1) Jan 31, 2018
I can mention, again, a fact I have discovered about primes.
As far out among the prime numbers as I have looked, the scatter shot graph of the function sin(p(i)), where p(i) is the i'th prime number, resembles a collection of sinusoidal waves overlapping each other, with every 10th wave missing. This suggests a close connection between primes and the sine function, which also implies a connection with pi, the ratio of the circumference of a circle to its diameter. In fact, the scatter shot graph of (p(i)/pi) – [p(i)/pi] resembles a collection of inclined straight lines, with every 10th line missing.
Among other things, too, I have found that, over a wide range of functions, f(i) = g(sin(h(i))), where i is the i'th integer, the sum of f(j)*(j^(1/pi)), from j=1 to j=i, multiplied by (i^(a1)/pi))/(ln(i)^b1) seems to approach some constant times p(i).
Feb 02, 2018
This comment has been removed by a moderator.

Please sign in to add a comment. Registration is free, and takes less than a minute. Read more

Click here to reset your password.
Sign in to get notified via email when new comments are made.