← All problems

Erdős Problem #1137 — Products of Consecutive Prime Gaps

1 year old · traced to

Let pnp_n be the nnth prime and let dn=pn+1−pnd_n=p_{n+1}-p_n for integers n≥1n\geq 1. For real x>2x>2, is it true that

max⁡2≤n<xdndn−1(max⁡1≤n<xdn)2⟶0(x→∞)?\frac{\displaystyle\max_{2\leq n<x} d_n d_{n-1}}{\displaystyle\left(\max_{1\leq n<x} d_n\right)^2}\longrightarrow 0 \qquad (x\to\infty)?

The maxima are over integer indices. The numerator begins at n=2n=2 so that both gaps in each product are defined; the denominator ranges over all defined gaps with index below xx. Erdős Problems #1137

Background

This question compares the largest product of two neighboring prime gaps with the square of the largest individual gap. Its concern is therefore not just how large exceptional gaps can be, but whether two comparably large gaps can occur consecutively. The problem listing identifies it as [Va99, 1.2]. In the broader study of large prime gaps, Westzynthius proved in 1931 that the largest gap up to XX is unbounded relative to the average scale log⁡X\log X, and obtained a quantitative lower bound; later work successively improved such lower bounds. Erdős Problems #1137 Long gaps between primes

References

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.