All open problems
Source labels openChecked July 26, 2026

Erdős ProblemsNumber theory

Erdős Problem 853: Ii

Let dn=pn+1pnd_n = p_{n+1} - p_n, where pnp_n is the nnth prime. Let r(x)r(x) be the smallest even integer tt such that dn=td_n = t has no solutions for nxn \le x.

Mathematical statement

Let dn=pn+1pnd_n = p_{n+1} - p_n, where pnp_n is the nnth prime. Let r(x)r(x) be the smallest even integer tt such that dn=td_n = t has no solutions for nxn \le x.

Is it true that r(x)/logxr(x) / \log x \to \infty?

Statement source: Erdős Problems statement material

Statement terms: Source-specific

Source-specific terms. Therefore does not assert reuse rights beyond attributed display.

Statement artifacts, not proofs

These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.

Pinned Lean formulation 1

erdos_853.parts.ii

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem erdos_853.parts.ii :    atTop.Tendsto (fun n  r n / Real.log n) atTop := by  sorry
Statement source
Formal Conjectures
Lean version
v4.27.0
Placeholder
Present; no proof artifact
Source evidence
Pinned source index
Fidelity review
Community formulation

References