Is it possible to partition the set of the positive integers into two subsets such that none of them contains an infinitely long (non-constant) arithmetic progression?
Solution
The answer is in the affirmative. For example, one can consider
i.e., for the infinite word , put the set of the indices for which , and the set of the indices for which . The terms of an arithmetic progression are equally spaced, while and both contain arbitrarily long gaps, hence the conclusion follows readily.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.