Show that the smallest number of colors that is needed for coloring numbers $1, 2,..., 2013$ so that for every two number $a, b$ which is the same color, $ab$ is not a multiple of $2014$, is $3$ colors.
Source: INAMO Shortlist 2014 C2
Tags: combinatorics, Coloring
Show that the smallest number of colors that is needed for coloring numbers $1, 2,..., 2013$ so that for every two number $a, b$ which is the same color, $ab$ is not a multiple of $2014$, is $3$ colors.