Possible Duplicate:
Any partition of {1,2,..,9} must contain a 3-Term Arithmetic Progression
The problem is as such:
Prove that there is not a partition of $N_9 = \{1, 2, 3, 4, 5, 6, 7, 8, 9\}$ consisting of two sets (the set $N_9$ could not be partitioned into two sets), such that both sets do not contain three elements of an arithmetic progression ($a_n = a_0 + (n-1)d$). Such a partition exists for $N_8 = \{1,2,3,4,5,6,7,8\}$.
A basic example of a partition of $N_9$ is $P = \{\{1,3,4\}, \{2,5,6,7,8,9\}\}$. It is evident that in this case, there are three elements in the second set that belong to the same arithmetic progression. Leaving examples aside, I have no idea on how a proof for this property would look like. Could anyone assist in generating a proof for this property?