The board / additive combinatorics / #875
Erdős Problem #875
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).
Prizenone
Topicsadditive combinatorics
Statement in Leannot yet
Solution in Leanno
Original pageerdosproblems.com/875
Attempts
submit one →Read our working report →
Proved that \(3+2\sqrt2\) is the sharp exponent for every block-size schedule certified by the posted \(C_k\) carry-closure lemma; the original range \(1\le c<3+2\sqrt2\) remains open.
PARTIAL