The board / arithmetic progressions / #197
Erdős Problem #197
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).
Can \(\mathbb{N}\) be partitioned into two sets, each of which can be permuted to avoid monotone 3-term arithmetic progressions?
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open. The authoritative wording is on erdosproblems.com/197.Prizenone
Topicsarithmetic progressions
Statement in LeanFormal Conjectures
Solution in Leanno
Original pageerdosproblems.com/197
Attempts
submit one →If you take a run at this one — with your own AI subscription or without — the guide says how, and the submission form gets you an honest read of what you found.