The Aperiodical 

You're reading: Posts Tagged: prime numbers

Open Season: Prime Numbers (Part 1)

By Katie Steckles. Posted August 23, 2013

In this short series of articles, I’m writing about mathematical questions we don’t know the answer to – which haven’t yet been proven or disproven. This is the third article in the series, and across two parts will discuss various open conjectures relating to prime numbers.

I don’t think it’s too much of an overstatement to say that prime numbers are the building blocks of numbers. They’re the atoms of maths. They are the beginning of all number theory. I’ll stop there, before I turn into Marcus Du Sautoy, but I do think they’re pretty cool numbers. They crop up in a lot of places in maths, they’re used for all kinds of cool spy-type things including RSA encryption, and even cicadas have got in on the act (depending on who you believe).

Cushing your luck: properties of randomly chosen numbers

By David Cushing. Posted June 17, 2013

Long-time Aperiodical muse David Cushing has made a bet with us that he can give us an interesting post every Friday for the next ten weeks. Every week that he sends a post, we buy him a bar of chocolate. Every week that he doesn’t send us a post, he buys us a bar of chocolate. For his first trick, David is going to do some unnatural things with the natural numbers.

The greatest common divisor (gcd) of two or more integers is the greatest integer that evenly divides those integers. For example, the gcd of $8$ and $12$ is $4$ (usually written as $\gcd(8,12)=4$). Two integers are called coprime (or “relatively prime”) if their gcd is equal to $1$.

A reasonable question to ask is,

Given two randomly chosen integers $a$ and $b$, what is the probability that $\gcd(a,b)=1$?

Bound on prime gaps bound decreasing by leaps and bounds

By Christian Lawson-Perfect. Posted June 8, 2013

Update 17/06/2013: The gap is down to 60,744. That’s a whole order of magnitude down from where it started!

When Yitang Zhang unexpectedly announced a proof that that there are infinitely many pairs of primes less than 70 million apart from each other – a step on the way to the twin primes conjecture – certain internet wags amused themselves and a minority of others with the question, “is it a bigger jump from infinity to 70 million, or from 70 million to 2?”.

Of course the answer is that it’s a really short distance from 70 million to 2, and here’s my evidence: the bound of 70 million has in just over three weeks been reduced to just a shade over 100,000.

“Bounded gaps between primes” by Yitang Zhang now available

By Peter Rowlett. Posted May 29, 2013

To complete the story started as a rumour report in ‘Primes gotta stick together‘ and confirmed in ‘Primes really do stick together‘, here we report that Annals of Mathematics has posted the PDF of ‘Bounded gaps between primes‘ by Yitang Zhang on its ‘to appear in forthcoming issues’ page. After the seminar on 13th May, Zhang apparently submitted a revised manuscript on 16 May, which was accepted 21 May 2013. So if you’ve been itching for details, here’s your chance (assuming you have access to a subscription to Annals).

Here’s the abstract:

It is proved that \[ \liminf_{n\to \infty}\, (p_{n+1} – p_n) < 7 \times 10^7 \text{,}\] where $p_n$ is the $n$-th prime.

Our method is a refinement of the recent work of Goldston, Pintz and Yildirim on the small gaps between consecutive primes. A major ingredient of the proof is a stronger version of the Bombieri-Vinogradov theorem that is applicable when the moduli are free from large prime divisors only (see Theorem 2), but it is adequate for our purpose.

The paper: Bounded gaps between primes by Yitang Zhang, in Annals of Mathematics.

Primes gotta stick together

By Christian Lawson-Perfect and Peter Rowlett. Posted May 13, 2013

Update 14/05/2013: The seminar was successful: Zhang announced that his proof has already been refereed for the Annals, and everyone seems happy with it.

Hard Maths news now: there’s a rumour going round that Yitang (Tom) Zhang of the University of New Hampshire reckons he can prove that there are infinitely many different pairs of primes at most 70,000,000 apart.

More experimental evidence for the infinitude of the primes

By Katie Steckles. Posted February 6, 2013

In a classic example of the intersection between maths and news, there’s been a new Mersenne prime discovered! Mersenne primes are numbers of the form $2^p – 1$, where $p$ is a prime number. They’re highly valued as a source of large prime numbers, since testing the primality of a (suspected) prime of this form is much easier than for general prime numbers.

Factor Conga

By Christian Lawson-Perfect. Posted October 31, 2012



Quite a few designery visualisations of the prime numbers have been put out on the web recently, to varying degrees of success. Most of the time they look pretty but don’t tell you very much; the most recent example I can think of is El Patrón de los Números Primos by Jason Davies.

A few weeks ago Brent Yorgey posted on his excellent blog The Math Less Traveled some really nice “factorization diagrams“, along with the code to produce them. Straight away, anyone with a text editor and a knack for fancy web coding set to work making the animated version that was so clearly required.

Stephen von Worley has made, I think, the nicest one. He calls it the Factor Conga. Sit back and enjoy the mysteries of the natural numbers as they dance their beguiling dance!