Problem 1
Let be any positive integer not equal to , , or . Show that one can find distinct elements and in the set such that is not a perfect square.
Step 1 of 6: Reformulate the claim
In plain words
Perfect squares occupy only a few residue classes modulo any fixed number, so checking modulo and then modulo should already force a contradiction in every case.
Detailed analysis
It suffices to show that for every , at least one of the three numbers , , (obtained by pairing with each of ) fails to be a perfect square; that pair is then the required .