Description: Van der Waerden's theorem. For any finite coloring R and integer
K , there is an N such that every coloring function from
1 ... N to R contains a monochromatic arithmetic progression
(which written out in full means that there is a color c and base,
increment values a , d such that all the numbers
a , a + d , ... , a + ( k - 1 ) d lie in the preimage of { c } ,
i.e. they are all in 1 ... N and f evaluated at each one yields
c ). (Contributed by Mario Carneiro, 13-Sep-2014)