The board / additive combinatorics / #1194
Erdős Problem #1194
OPENdatabase updated 2026-04-04
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).
Attempts
submit one →Read our working report →
Exact finite compactness reduction proved; exhaustive checker certifies \(L_N\) through \(N=21\) and normalized minimax \(R_N\) through \(N=12\); the open asymptotic gap remains \(n^2/\log n\) infinit
PARTIAL