The board / number theory / #396
Erdős Problem #396
OPENdatabase updated 2025-08-31
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).
Is it true that for every \(k\) there exists \(n\) such that \[\prod_{0\leq i\leq k}(n-i) \mid \binom{2n}{n}?\]
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open. The authoritative wording is on erdosproblems.com/396.Prizenone
Statement in LeanFormal Conjectures
Solution in Leanno
OEISA375077
Original pageerdosproblems.com/396
Attempts
submit one →Read our working report →
Live page status is OPEN, but “Currently working on this problem” lists jdehorty and SharkyKesa (checked 2026-07-28 via the required Bright Data browser path).
SKIPPED