Following on from the series of ‘Pascal’s Triangle and its Secrets‘ posts, guest author David Benjamin shares another delightful piece of mathematics – this time relating to prime numbers.

The Greek mathematician Euclid of Alexandria ($\sim$325 BC-265 BC) was arguably the first to prove that there are an infinite number of primes – and since then, people have been searching for new ones. Some do it for kudos, for the prize money, to test the power of computers and the need to find more of the large primes used to help protect the massive amount of data which is being moved around the internet.

Mersenne primes, named after the French monk Marin Mersenne, are of the form $2^p-1$, where the exponent $p$ is also prime. Mersenne primes are easier to test for primality, which is one reason we find so many large ones (all but one of the top ten known primes are Mersenne). When Mersenne primes are converted to binary they become a string of $1$s, which makes them suitable for computer algorithms and an excellent starting point for any search.

Since generally testing numbers for primality is slow, some have tried to find methods to produce primes using a formula. Euler’s quadratic polynomial $n^2+n+41$ produces this set of $40$ primes for $n=0$ to $39$. When $n=40$, the polynomial produces the square number $1681$. Other prime-generating polynomials are listed in this Wolfram Mathworld entry.

The French mathematician Lejeune Dirichlet proved that the linear polynomial $a+nb$ will produce an infinite set of primes if $a$ and $b$ are coprime for $n=0,1,2,3,4,\dots$. Then again, it also produces an infinite number of composite numbers! However, this gem: $224584605939537911+1813569659748930n$ produces 27 consecutive primes for $n=0$ to $n=26$ – and of course, all the primes are in arithmetic progression.

14 fruitful fractions

The primes are unpredictable, and become less common as they get larger. Consequently there is no formula that will generate all the prime numbers. However, there is a finite sequence of fractions, that – given an infinite amount of time – would generate all the primes, and in sequential order.

They are the fruitful fractions, created by the brilliant Liverpool-born mathematician, John Horton Conway (1937–2020) who, until his untimely death from complications related to COVID-19, was the John von Neumann Emeritus Professor in Applied and Computational Mathematics at Princeton University, New Jersey, USA.

The fruitful fractions are

The first time I encountered this set of fractions was in the wonderful book, The Book of Numbers, by Conway and Guy. I was so intrigued as to how Conway came up with his idea, I emailed him to ask. I was delighted to receive an outline of an explanation and even a second set of fractions, neither of which I can now find – it was 1996 and pre-cloud storage! But no worries… Conway explains everything in this lecture, which also demonstrates his passion for mathematics and his ability to express his ideas in a relaxed and humorous way, even when he searches for an error in his proof on 26 minutes. The lecture also includes an introduction to Conway’s computer language, FRACTRAN, which includes the statement:

‘It should now be obvious to you that you can write a one line fraction program that does almost anything, or one and a half lines if you want to be precise‘.

Using the fractions to find prime numbers

Here’s how the fractions are used to generate primes.

• Start with the number $2$
• Multiply by each of the fourteen fractions until you find one for which the product is an integer
• Starting with this new integer, continue multiplying through the fractions until another integer is produced. (If this process reaches fraction $N=\frac{55}{1}$, the integer’s product with N is guaranteed to be another integer as N has a denominator of $1$; the process continues with this new integer being multiplied by fraction A)
• Continue multiplying through the set to create more integers
• When the integer is a power of $2$, its exponent will be a prime number.

The 19 steps needed to produce the first prime number are:

$2\stackrel{\times M}{\to }15\stackrel{\times N}{\to }825\stackrel{\times E}{\to }725\stackrel{\times F}{\to }1925\stackrel{\times K}{\to }2275\stackrel{\times A}{\to }425\stackrel{\times B}{\to }390\stackrel{\times J}{\to }330\stackrel{\times E}{\to }290\stackrel{\times F}{\to }770\stackrel{\times K}{\to }910\stackrel{\times A}{\to }170\stackrel{\times B}{\to }156\stackrel{\times J}{\to }132\stackrel{\times E}{\to }116\stackrel{\times F}{\to }308\stackrel{\times K}{\to }364\stackrel{\times A}{\to }68\stackrel{\times I}{\to }4\equiv 2^2$

The number of steps needed to produce the first 7 primes are shown in the table below:

And here is the start and end of the sequence of fractions used to produce the next prime number from $2^2$:

$4\stackrel{\times M}{\to }30\stackrel{\times M}{\to }225\stackrel{\times N}{\to }12375\stackrel{\times E}{\to }10875\to \cdots \to 232\stackrel{\times F}{\to }616\stackrel{\times K}{\to }728\stackrel{\times A}{\to }136\stackrel{\times I}{\to }8\equiv 2^3$

The steps needed for the first 34 primes are given as OEIS A007547 and the first 8102 products in the B-list for A007542.

The successive primes are produced almost like magic – but the number of multiplications needed to produce each new prime becomes larger and larger, and so the method, though wonderfully inventive, is not at all efficient.

Edit: Since this article was first published, the exponent $82589933$ of the Laroche prime has been accepted as the next term in the sequence http://oeis.org/A112634

Further Reading on John Conway

• Listen to this Numberphile interview with Conway on how he invented the Game of Life
• Play the Game of Life
• Aperiodical posts about John Conway
• Conway’s publications on Scholia
• Conway and knots: ‘I proved this when I was at high school in England’
• Graduate Student Solves Decades-Old Conway Knot Problem, in Quanta