Problem

Source: Czech and Slovak Match 2000 P6

Tags: Integer, number theory, combinatorics, Coloring, Ramsey Theory



Suppose that every integer has been given one of the colors red, blue, green, yellow. Let $x$ and $y$ be odd integers such that $|x| \ne |y|$. Show that there are two integers of the same color whose difference has one of the following values: $x,y,x+y,x-y$.