If x,y,z is integer such that show that 60|xyz
Note that you can set
for some integers, m,n.
From that it follows that z equals:
Now, quite frankly I forgot (or at least can't remember at the moment) how to prove that the solutions are of that form, but you can easily verify by putting anything for n and m... you will get pythagorean triples.
Anyway, what you want to prove can now be written as:
, for some k.
And all that's left is to prove that the left side is divisible by 30. Just think about the possibilities... you'll find it obvious that it's divisible by 2, and for 3 and 5 you'll just have to write it down... or maybe not