Erdős–Turán conjecture on largest prime factors of consecutive integers

Less than 1 year old · traced to

Let P+(n)P^+(n) denote the largest prime factor of nn, with P+(1)=1P^+(1)=1. Erdős–Turán conjecture. As xx tends to infinity,

#{n≤x:P+(n)<P+(n+1)}∼12x.\#\{n\leq x:P^+(n)<P^+(n+1)\}\sim \frac{1}{2}x.

This conjecture concerns the expected symmetry between the largest prime factors of consecutive integers. The paper proves only a lower bound of 0.2800.280 for the corresponding asymptotic density, so the asserted density 1/21/2 remains open.

References

Primary source

Zhiyuan Yang, “An improvement on the largest prime factors of consecutive integers”, arXiv:2607.16032 (2026).

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.