Skip to content

Short Intervals

The Prime Number Theorem describes the average distribution of primes up to a large number $x$:

number-theory book chatgpt

Prime Distribution on Small Scales

The Prime Number Theorem describes the average distribution of primes up to a large number xx:

π(x)∼xlog⁡x. \pi(x)\sim \frac{x}{\log x}.

From this, one expects that an interval of length hh near xx should contain roughly

hlog⁡x \frac{h}{\log x}

primes.

Thus the quantity

π(x+h)−π(x) \pi(x+h)-\pi(x)

should approximately equal

hlog⁡x. \frac{h}{\log x}.

The study of such questions is called the theory of primes in short intervals.

The main problem is determining how small the interval length hh may be while this approximation remains valid.

Average Prime Density

The heuristic density of primes near xx is

1log⁡x. \frac1{\log x}.

Therefore, integrating over a short interval gives the prediction

∫xx+hdtlog⁡t≈hlog⁡x, \int_x^{x+h}\frac{dt}{\log t} \approx \frac{h}{\log x},

provided hh is small compared with xx.

This suggests

π(x+h)−π(x)∼hlog⁡x. \pi(x+h)-\pi(x) \sim \frac{h}{\log x}.

However, proving such estimates is difficult because prime numbers exhibit substantial local irregularity.

Trivial Limitations

If hh is extremely small, the approximation cannot hold uniformly.

For example, if

h<2, h<2,

the interval may contain either zero or one prime. The predicted value

hlog⁡x \frac{h}{\log x}

is then too small to control the actual fluctuations.

Moreover, arbitrarily long gaps between consecutive primes exist. Thus one cannot expect every sufficiently short interval to contain a prime.

The challenge is finding the correct threshold for asymptotic behavior.

Intervals of Polynomial Length

A classical theorem states that if

h=xθ h=x^\theta

with

θ>1, \theta>1,

then the Prime Number Theorem immediately implies

π(x+h)−π(x)∼hlog⁡x. \pi(x+h)-\pi(x) \sim \frac{h}{\log x}.

The real difficulty begins when

θ<1. \theta<1.

Intervals shorter than xx probe the fine-scale structure of prime distribution.

Hoheisel’s Theorem

One of the first major advances was obtained by entity[“people”,“Guido Hoheisel”,“German mathematician”] in 1930.

He proved that there exists a constant

θ<1 \theta<1

such that

π(x+xθ)−π(x)∼xθlog⁡x. \pi(x+x^\theta)-\pi(x) \sim \frac{x^\theta}{\log x}.

This result showed that primes occur regularly even inside intervals substantially shorter than xx.

Later work gradually reduced the value of θ\theta.

Primes Between Consecutive Powers

A related question asks whether every interval

[n2,(n+1)2] [n^2,(n+1)^2]

contains a prime.

This is known as Legendre’s conjecture and remains open.

However, short-interval results imply weaker statements. For sufficiently large xx, intervals of the form

[x,x+xθ] [x,x+x^\theta]

contain primes whenever θ\theta exceeds certain explicit constants.

The best known unconditional exponents arise from deep estimates for zeros of the zeta function and exponential sums.

Chebyshev Functions in Short Intervals

The weighted function

ψ(x)=∑pk≤xlog⁡p \psi(x) = \sum_{p^k\leq x}\log p

is often easier to analyze than π(x)\pi(x).

The expected asymptotic relation becomes

ψ(x+h)−ψ(x)∼h. \psi(x+h)-\psi(x)\sim h.

This formulation connects directly with explicit formulas involving zeros of the zeta function.

Connection with the Riemann Hypothesis

The Riemann Hypothesis predicts strong control of primes in short intervals.

Assuming the hypothesis, one obtains

ψ(x+h)−ψ(x)=h+O(x(log⁡x)2). \psi(x+h)-\psi(x) = h + O\left( \sqrt{x}(\log x)^2 \right).

Consequently, if

h≫x(log⁡x)2, h\gg \sqrt{x}(\log x)^2,

then the main term dominates the error, giving

π(x+h)−π(x)∼hlog⁡x. \pi(x+h)-\pi(x) \sim \frac{h}{\log x}.

Thus the Riemann Hypothesis predicts nearly optimal short-interval behavior.

Cramér’s Model

A probabilistic model introduced by entity[“people”,“Harald Cramér”,“Swedish mathematician”] treats prime occurrence near nn as a random event with probability

1log⁡n. \frac1{\log n}.

This heuristic predicts that intervals of length roughly

(log⁡x)2 (\log x)^2

should usually contain primes.

Although the model captures many statistical features correctly, rigorous proofs remain far beyond current methods.

Almost All Intervals

Even when uniform results are difficult, one can often prove statements for almost all intervals.

For example, many theorems show that for most xx,

π(x+h)−π(x)∼hlog⁡x \pi(x+h)-\pi(x) \sim \frac{h}{\log x}

holds for values of hh much smaller than those known in uniform estimates.

Such results use mean-square methods, zero-density estimates, and harmonic analysis.

Importance

Short intervals reveal the local structure of prime distribution. While the Prime Number Theorem describes global averages, short-interval theory investigates how evenly primes are spread on finer scales.

The subject connects deeply with:

  • zeros of the zeta function,
  • exponential sums,
  • sieve methods,
  • probabilistic models,
  • additive combinatorics.

Many famous open problems, including prime gaps and conjectures about consecutive primes, belong naturally to the theory of short intervals.