Theorem 1.7. Assuming that:

  • ℕ is k-coloured

Then we can find a monochromatic arithmetic progression of length 3 (equivalently, for any k we find an n that works).