The board / additive combinatorics / #790
Erdős Problem #790
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/790
Attempts
submit one →Read our working report →
exact computer-assisted table \(l(1..10)=1,2,2,3,3,3,4,4,4,4\) and \(4\leq l(n)\leq5\) for \(11\leq n\leq14\); both asymptotic questions remain open.
PARTIAL