# Is there a simpler proof of Van Der Waerden's Theorem when there are only two colors?

http://en.wikipedia.org/wiki/Van_der_Waerden%27s_theorem

The usual approach is to induct on the length of the arithmetic progression, which is difficult to simplify directly to the case of two colors.

Does anyone know a different approach?

Thank you.

-

There is Shehlah's approach for the Hales Jewett theorem (of which Van der Waerden is a special case). See, http://www.math.unh.edu/~dvf/532/Shelah's_proof

Not sure whether it is simpler, though.

-