# Prime Gaps

## Consecutive Prime Differences

Let

$$
p_n
$$

denote the $n$-th prime number. The difference

$$
g_n=p_{n+1}-p_n
$$

is called the $n$-th prime gap.

For example,

$$
2,3,5,7,11,13
$$

produce the gaps

$$
1,2,2,4,2.
$$

Prime gaps measure how irregularly primes are distributed among the integers.

## Average Size of Prime Gaps

The Prime Number Theorem implies that primes near $x$ have average density approximately

$$
\frac1{\log x}.
$$

Thus the average spacing between nearby primes should be roughly

$$
\log x.
$$

Equivalently,

$$
g_n \approx \log p_n
$$

on average.

This does not mean every gap has size close to $\log p_n$. Prime gaps fluctuate substantially. Some are much smaller, while others are much larger.

## Arbitrarily Large Gaps

Prime gaps can become arbitrarily large.

Consider the integers

$$
m!+2,m!+3,\ldots,m!+m.
$$

For each $k$ with

$$
2\leq k\leq m,
$$

the number

$$
m!+k
$$

is divisible by $k$. Hence all numbers in the interval are composite.

Therefore there exist arbitrarily long blocks of consecutive composite numbers, implying arbitrarily large prime gaps.

In particular,

$$
\limsup_{n\to\infty} g_n=\infty.
$$

## Small Gaps

Although large gaps exist, primes also sometimes appear unusually close together.

Twin primes are pairs of primes differing by $2$:

$$
(p,p+2).
$$

Examples include

$$
(3,5),\quad (5,7),\quad (11,13).
$$

The Twin Prime Conjecture asserts that infinitely many such pairs exist.

More generally, one studies

$$
\liminf_{n\to\infty} g_n.
$$

The Twin Prime Conjecture states that

$$
\liminf_{n\to\infty} g_n=2.
$$

This remains unproved.

## Bounded Gaps Between Primes

A major breakthrough occurred in 2013, when entity["people","Yitang Zhang","Chinese mathematician"] proved that

$$
\liminf_{n\to\infty} g_n < \infty.
$$

In other words, infinitely many prime gaps are bounded by a fixed constant.

Zhang’s original bound was

$$
g_n<70{,}000{,}000
$$

infinitely often.

Subsequent collaborative improvements dramatically reduced the bound. Modern results show that infinitely many prime pairs differ by at most a few hundred.

These advances rely on deep sieve methods and estimates for prime distribution in arithmetic progressions.

## Cramér’s Conjecture

A probabilistic model proposed by entity["people","Harald Cramér","Swedish mathematician"] predicts that the maximal prime gap near $x$ should satisfy

$$
g_n=O((\log p_n)^2).
$$

More precisely, Cramér conjectured

$$
g_n\ll (\log p_n)^2.
$$

This conjecture remains open.

Known results are much weaker. The best unconditional bounds still allow significantly larger gaps.

## Large Gap Results

Although Cramér’s conjecture is unresolved, substantial progress has been made toward constructing unusually large gaps.

Classical work showed that infinitely many gaps satisfy

$$
g_n \gg \log p_n \log\log p_n.
$$

Later refinements improved these lower bounds further.

Modern techniques combine sieve methods with probabilistic constructions to produce increasingly large explicit gaps.

## Normalized Gaps

Because average gaps grow roughly like $\log p_n$, one often studies normalized quantities

$$
\frac{g_n}{\log p_n}.
$$

The Prime Number Theorem suggests that the average normalized gap is approximately $1$.

However, the sequence fluctuates dramatically. In fact,

$$
\liminf_{n\to\infty}\frac{g_n}{\log p_n}=0
$$

and

$$
\limsup_{n\to\infty}\frac{g_n}{\log p_n}=\infty.
$$

Thus prime gaps can be both much smaller and much larger than average.

## Connections with the Zeta Function

The distribution of prime gaps is closely related to the zeros of the Riemann zeta function.

Fine estimates for primes in short intervals depend on:

- zero-free regions,
- zero-density estimates,
- pair correlation of zeros,
- explicit formulas.

The statistical behavior of zeros appears to mirror statistical properties of primes.

This connection is one of the central themes of modern analytic number theory.

## Hardy-Littlewood Prime Tuple Conjecture

A far-reaching conjecture of entity["people","Godfrey Harold Hardy","British mathematician"] and entity["people","John Edensor Littlewood","British mathematician"] predicts asymptotic formulas for many prime patterns.

For twin primes, the conjecture predicts

$$
\#\{p\leq x : p+2\text{ prime}\}
\sim
2C_2\frac{x}{(\log x)^2},
$$

where $C_2$ is the twin prime constant.

This conjecture suggests not only infinitely many twin primes, but also a precise density law.

## Importance

Prime gaps reveal the local irregularity of prime numbers. The Prime Number Theorem describes average behavior, but gap theory studies fluctuations around that average.

The subject connects:

- sieve theory,
- probabilistic models,
- additive combinatorics,
- spectral analysis,
- zeta zeros,
- random matrix heuristics.

Many central open problems in number theory, including the Twin Prime Conjecture and Cramér’s conjecture, belong naturally to the theory of prime gaps.