/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/modulepublicimportFormalConjecturesUtil
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 [Er85c]. Estimate
$h(x)$. In particular, is it true that
$$h(x) > (\log x)^c$$
for some constant $c > 0$?
The statement avoids defining $h$. Since $h(x)$ is the longest such run, $h(x) > y$ holds exactly
when some $n < x$ starts a run of $H > y$ distinct gaps. We state the question this way, with $x$
real. We read it as asking for one $c > 0$ such that the inequality holds for all large $x$.
The primes are indexed from $p_0 = 2$, as in primeGap. Shifting the index by one does not change
the question.
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 [Er85c]. Estimate
$h(x)$. In particular, is it true that
$$h(x) = o(\log x)?$$
The statement avoids defining $h$. It says that for every $\varepsilon > 0$ and all large real $x$,
every run of $H$ distinct gaps $d_n, \ldots, d_{n+H-1}$ with $n < x$ satisfies
$H \leq \varepsilon \log x$. This is $h(x) \leq \varepsilon \log x$, because $h(x)$ is the longest
such run.
Brun's sieve implies $h(x) \to \infty$ as $x \to \infty$ (remark on
erdosproblems.com/852).
That is, for every $H$ and all large $x$ there is some $n < x$ such that $d_n, \ldots, d_{n+H-1}$
are all distinct. Since more values of $n$ are allowed as $x$ grows, this holds exactly when, for
every $H$, some $n$ has $d_n, \ldots, d_{n+H-1}$ all distinct.
This also follows from Erdos6.erdos_6.variants.increasing, because strictly increasing prime
gaps are distinct.