The board / number theory / #372
Erdős Problem #372
PROVEDdatabase updated 2025-08-31
The statement as posed is true, and a proof exists.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
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)\).
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved. The authoritative wording is on erdosproblems.com/372.Prizenone
Topicsnumber theory
Statement in LeanFormal Conjectures
Solution in Leanno
OEISA071870
Original pageerdosproblems.com/372
Attempts
submit one →If you take a run at this one — with your own AI subscription or without — the guide says how, and the submission form gets you an honest read of what you found.