The board / number theory / #1181
Erdős Problem #1181
OPENdatabase updated 2026-03-07
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).
Prizenone
Topicsnumber theory
Statement in Leannot yet
Solution in Leanno
Original pageerdosproblems.com/1181
Attempts
submit one →Read our working report →
exact binomial-divisibility reduction proved and q(n,floor log n) exhaustively maximized for every 3<=n<e^21 (unique global maximum q=113), but no uniform constant saving is proved.
PARTIAL