PROVED
This has been solved in the affirmative.
Let $P(n)$ denote the largest prime factor of $n$. There are infinitely many $n$ such that $P(n)>P(n+1)>P(n+2)$.
Conjectured by Erdős and Pomerance
[ErPo78], who proved the analogous result for $P(n)<P(n+1)<P(n+2)$. Solved by Balog
[Ba01], who proved that this is true for $\gg \sqrt{x}$ many $n\leq x$ (for all large $x$). Balog suggests the natural conjecture that the density of such $n$ is $1/6$. A generalised form of this conjecture was presented by De Koninck and Doyon
[DeDo11].
View the LaTeX source
Additional thanks to: Desmond Weisenberg
When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:
T. F. Bloom, Erdős Problem #372, https://www.erdosproblems.com/372, accessed 2026-01-16