Skip to content

Erdős problem 1138

Erdős Problem 1138. Let x/2<y<xx/2 < y < x and C>1C > 1. If d=maxpn<x(pn+1pn)d = \max_{p_n < x}(p_{n+1} - p_n), where pnp_n denotes the nn-th prime, then is it true that π(y+Cd)π(y)Cdlogy\pi(y + Cd) - \pi(y) \sim \frac{Cd}{\log y}?

Sources

Browse retained paths and inspect the exact material available for this Problem.

1 retained statement2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

1138.lean

Retained formal statement1 of 1

Erdős Problem 1138. Let x/2<y<xx/2 < y < x and C>1C > 1. If d=maxpn<x(pn+1pn)d = \max_{p_n < x}(p_{n+1} - p_n), where pnp_n denotes the nn-th prime, then is it true that π(y+Cd)π(y)Cdlogy\pi(y + Cd) - \pi(y) \sim \frac{Cd}{\log y}?

FormalConjectures/ErdosProblems/1138.leanErdos1138.erdos_11385 linesExact file
FalseC > 1,    Asymptotics.IsEquivalent Erdos1138.snd_gt_half_fst (Erdos1138.primeCount_Ioc_mul_const C) fun x =>      match x with      | (x, y) => C * ↑(Erdos1138.sup_primeGap x) / Real.log y
SolvedProof has a holeformal conjecturesexternal proof

The proof uses `sorry`: part of the argument is written but not proved. Lean accepts the file; it does not accept the theorem.

Search problems.science

Find a Problem, Result, source, or page