← All problems

Erdős Problem #6 — Monotone runs among three consecutive prime gaps

78 years old · traced to

Let 2=p1<p2<⋯2 = p_1 < p_2 < \cdots be the sequence of consecutive primes. [pn+1−pn=dnp_{n+1} - p_n = d_n.] Turán and I [15] proved that the inequalities dn+1>dnd_{n+1} > d_n and dn+1<dnd_{n+1} < d_n both have infinitely many solutions. We have not been able to prove that dn>dn+1>dn+2d_n > d_{n+1} > d_{n+2} or dn<dn+1<dn+2d_n < d_{n+1} < d_{n+2} have infinitely many solutions. In fact we cannot disprove the existence of an integer n0n_0 so that for every k≥0k \geq 0, dn0+2k>dn0+2k+1d_{n_0}+2k > d_{n_0}+2k+1 and dn0+2k+1<dn0+2k+2d_{n_0}+2k+1 < d_{n_0}+2k+2.

References

P. Erdős, Some recent advances and current problems in number theory, Lectures on Modern Mathematics III, Wiley (1965), 196-244.

Source: P. Erdős, Some recent advances and current problems in number theory, Lectures on Modern Mathematics III, Wiley (1965), 196-244.

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.