The board / number theory / #1095
Erdős Problem #1095
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).
Let \(g(k)>k+1\) be the smallest \(n\) such that all prime factors of \(\binom{n}{k}\) are \(>k\).
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · 4 further variants / known partial results in the Lean file. The authoritative wording is on erdosproblems.com/1095.Prizenone
Statement in LeanFormal Conjectures
Solution in Leanno
OEISA003458
Original pageerdosproblems.com/1095
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.