Open-access mathematical research insights
About Contact
Home / Erdos Problems / Problem #852

Problem #852: Let $d_n=p_{n+1}-p_n$, where $p_n$ is the $n$th prime

Let $d_n=p_{n+1}-p_n$, where $p_n$ is the $n$th prime. Let $h(x)$ be maximal such that for some $n

Problem Statement

Let $d_n=p_{n+1}-p_n$, where $p_n$ is the $n$th prime. Let $h(x)$ be maximal such that for some $n<x$ the numbers $d_n,d_{n+1},\ldots,d_{n+h(x)-1}$ are all distinct. Estimate $h(x)$. In particular, is it true that\[h(x) >(\log x)^c\]for some constant $c>0$, and\[h(x)=o(\log x)?\]
Categories: Number Theory Primes

Progress

Brun's sieve implies $h(x) \to \infty$ as $x\to \infty$.

Source: erdosproblems.com/852 | Last verified: January 19, 2026

Stay Updated

Get weekly digests of new research insights delivered to your inbox.