Blog

NT Masterclass Blog

Explanations, background, and advice for curious students.

Latest articles

How the gap between primes came down to 246
14 Nov 2026

How the gap between primes came down to 246

In April 2013 an unknown lecturer proved that infinitely many pairs of primes differ by less than 70 million. By the following spring the bound was 246, through a new sieve and an online collaboration. Here is what was proved, how the number fell, and why it is stuck.

What the Riemann hypothesis actually says
8 Nov 2026

What the Riemann hypothesis actually says

A million-dollar problem about where a certain function is zero sounds far from the primes. It is not: the hypothesis is a precise statement about how evenly the primes are spread, and it can be stated without a single complex number. Here is both versions, and why they are the same.

The largest known prime and how it was found
3 Nov 2026

The largest known prime and how it was found

On 12 October 2024 a graphics processor in a data centre confirmed that 2^136279841 - 1 is prime. The number has 41,024,320 digits and it is the 52nd Mersenne prime found. Here is why the record primes all have this shape, how the test works, and what changed in 2024.

Ulam's spiral and the diagonals of primes
28 Oct 2026

Ulam's spiral and the diagonals of primes

Write the integers in a square spiral, mark the primes, and diagonal lines appear. Stanislaw Ulam noticed it while doodling through a dull talk in 1963. The lines are real, they are quadratic polynomials, and whether they go on for ever is an open question.

Goldbach's conjecture, checked to four quintillion
22 Oct 2026

Goldbach's conjecture, checked to four quintillion

Every even number greater than 2 is the sum of two primes: 4 = 2 + 2, 100 = 3 + 97, and so on up to 4,000,000,000,000,000,000, where the checking stopped in 2012. Nobody has proved it for the numbers beyond. Here is the letter of 1742, what has been proved, and why a verification is not a proof.

The prime number theorem in plain words
16 Oct 2026

The prime number theorem in plain words

How many primes are there below a million? Below a trillion? A fifteen-year-old Gauss guessed the answer from tables in 1792, and it took a century to prove. Here is what the theorem says, where the guess came from, and what it means for a 100-digit number.

What Diffie-Hellman has to do with primitive roots
10 Oct 2026

What Diffie-Hellman has to do with primitive roots

Two people who have never met agree on a secret number over a line that everyone can listen to. The trick, from 1976, is a primitive root modulo a prime and the fact that powers are easy to compute and hard to undo. Here it is with p = 23, and the 2015 attack that broke it for a large part of the internet.

Gauss's golden theorem
4 Oct 2026

Gauss's golden theorem

Whether 7 is a square modulo 101 has, it turns out, everything to do with whether 101 is a square modulo 7. Gauss proved this at eighteen, called it the golden theorem, and went on to prove it seven more times. Here is what it says and one computation with it.

Is this number prime? From Fermat's test to Miller-Rabin
28 Sep 2026

Is this number prime? From Fermat's test to Miller-Rabin

Trial division decides whether a number is prime in a time that grows with its square root, hopeless at 300 digits. A test built on Fermat's little theorem does it in milliseconds, with a catch, and a repaired version runs inside every cryptographic library in use today.