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: Set up the three squares
In plain words
If no pairing worked, all three numbers would be squares simultaneously; parity and divisibility constraints on will then clash.
Detailed analysis
Suppose, for contradiction, that , , for integers . We derive a contradiction, which shows at least one of the three cannot be a perfect square.