What is the least $n$ such that the set of all integers can be partitioned into $n$ disjoint subsets, none of which contain any infinite arithmetic progressions (arbitrarily long but finite arithmetic progressions are allowed)? In particular, can it be done for $n=2$? I tried e.g. splitting the integers into perfect powers and non-powers but then $4n+2$ is never a perfect power.
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
Here's how it works:
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top