Distribution of Primes - Examples and Constructions

Special patterns in prime distribution reveal fascinating structures, from twin primes to prime constellations. These examples showcase both regularity and randomness in how primes appear among the integers.

DefinitionTwin Primes

Twin primes are pairs of primes differing by 2: $(p, p+2)$ .

Examples: $(3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43)$ .

The Twin Prime Conjecture states there are infinitely many twin primes—still unproven despite much evidence.

ExampleTwin Primes

First ten twin prime pairs: $(3, 5), (5, 7), (11, 13), (17, 19), (29, 31), (41, 43), (59, 61), (71, 73), (101, 103), (107, 109)$

Largest known (as of recent records): $(2996863034895 \cdot 2^{1290000} \pm 1)$ with over 388,000 digits.

The density of twin primes appears to decrease, but they never seem to disappear entirely.

DefinitionPrime k-Tuples

A prime constellation is a sequence of primes with a fixed pattern of gaps.

Sexy primes: $(p, p+6)$ like $(5, 11), (7, 13), (11, 17)$
Cousin primes: $(p, p+4)$ like $(3, 7), (7, 11), (13, 17)$
Prime triplets: $(p, p+2, p+6)$ or $(p, p+4, p+6)$ like $(5, 7, 11)$ or $(7, 11, 13)$

ExamplePrime Constellations

Prime quadruplet $(5, 7, 11, 13)$ : gaps $(2, 4, 2)$ .

Prime quintuplet $(5, 7, 11, 13, 17)$ : gaps $(2, 4, 2, 4)$ .

Admissible patterns (those not ruled out by divisibility) are conjectured to appear infinitely often (Generalized Hardy-Littlewood Conjecture).

DefinitionSieve Methods

Eratosthenes' Sieve finds all primes up to $n$ :

List integers from 2 to $n$
Mark 2 as prime, cross out all multiples of 2
Find next unmarked number, mark as prime, cross out its multiples
Repeat until $\sqrt{n}$ is reached

All remaining unmarked numbers are prime.

ExampleSieve of Eratosthenes for n=30

Start: $2, 3, 4, 5, 6, 7, 8, 9, 10, \ldots, 30$

After sieving by 2: $2, 3, \cancel{4}, 5, \cancel{6}, 7, \cancel{8}, 9, \cancel{10}, \ldots$

After sieving by 3: $2, 3, 5, 7, \cancel{9}, 11, 13, \ldots$

After sieving by 5: $2, 3, 5, 7, 11, 13, 17, 19, 23, 29$

These are all primes $\leq 30$ .

DefinitionUlam Spiral

Write positive integers in a spiral, then mark the primes. Diagonal patterns mysteriously emerge, suggesting hidden structure in prime distribution.

The Ulam spiral visualization reveals that primes concentrate along certain diagonal lines more than random chance would predict.

ExampleUlam Spiral Pattern

Starting from center spiral outward:

17--16--15--14--13
|               |
18   5---4---3  12
|    |       |  |
19   6   1---2  11
|    |          |
20   7---8---9--10
|
21--22--23--...

Primes: $2, 3, 5, 7, 11, 13, 17, 19, 23, \ldots$

Diagonal from 3 to 13 contains many primes, as does the line from 2 to 11. These patterns persist to large scales.

DefinitionArithmetic Progressions of Primes

The Green-Tao Theorem (2004) states that for any $k$ , there exist arbitrarily long arithmetic progressions consisting entirely of primes.

This resolved a longstanding question about structure within primes.

ExamplePrime Arithmetic Progressions

Length 3: $3, 7, 11$ (common difference 4)

Length 5: $5, 11, 17, 23, 29$ (common difference 6)

Length 6: $7, 37, 67, 97, 127, 157$ (common difference 30)

Length 10: $199, 409, 619, 829, 1039, 1249, 1459, 1669, 1879, 2089$ (common difference 210)

Longer progressions exist but become increasingly sparse.

Remark

Modern computational number theory has revealed:

Gaps between consecutive primes can be arbitrarily large
Yet Zhang (2013) proved infinitely many gaps $\leq 70{,}000{,}000$ (later improved to gaps $\leq 246$ )
Prime number races: different residue classes modulo $q$ compete for having more primes
Biases in last digits of consecutive primes (Lemke Oliver-Soundararajan, 2016)

These discoveries show primes are far from random, exhibiting subtle statistical patterns we're only beginning to understand.

These examples demonstrate the rich tapestry of patterns hidden within the prime numbers, inviting continued exploration and discovery.