Erdős Problem a Daythe open tracker

Erdős Problem #401

PROVED LEANdatabase updated 2026-01-11

The statement as posed is true, and a proof exists. A solution has also been checked by machine, in Lean.

What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).

Is there some function \(f(r)\) such that \(f(r)\to \infty\) as \(r\to\infty\), such that, for infinitely many \(n\), there exist \(a_1,a_2\) with \[a_1+a_2> n+f(r)\log n\] such that \(a_1!a_2! \mid n!2^n3^n\cdots p_r^n\)? It is ambiguous in [ErGr80] what the intended quantifiers are on the variables (they write 'is it true that we can find \(a_1+a_2>n+f(r)\log n\)...'). Comparing to previous problems such as [728] and [729] it seems most likely that they intended to ask the formulation in the problem statement. The answer is yes: Barreto and Leeham have used ChatGPT to provide a proof of the stated problem (in fact essentially the same construction as their solution to [729]).
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved. The authoritative wording is on erdosproblems.com/401.
Prizenone
Topicsnumber theory, factorials
Statement in LeanFormal Conjectures
Solution in Leanyes
Original pageerdosproblems.com/401
NOBODY HAS SENT US AN ATTEMPT YET

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.