The board / number theory / #1094
Erdős Problem #1094
OPENdatabase updated 2025-10-18
No proof or disproof is known, and it isn't known whether a finite computation could settle it.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
For all \(n\ge 2k\) the least prime factor of \(\binom{n}{k}\) is \(\le\max(n/k,k)\), with only finitely many exceptions.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open. The authoritative wording is on erdosproblems.com/1094.Prizenone
Statement in LeanFormal Conjectures
Solution in Leanno
Original pageerdosproblems.com/1094
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.