Example 1 Let be an integer solution of the Pythagorean equation (1). Prove: , , must include one number that is a multiple of 3, one number that is a multiple of 4, and one number that is a multiple of 5.
Solution
Prove that using the fact that perfect squares , if and are not multiples of 3, then
this leads to
which is a contradiction. Hence, one of or must be a multiple of 3.
If , , and are not multiples of 5, then
while
which is a contradiction. Hence, one of , , or must be a multiple of 5.
If , , and are all even, then divide both sides of (1) by 4 until one of or is odd. Suppose is odd, then must be even (otherwise , which is a contradiction), in this case is odd. Taking both sides of (1) modulo 8, we find that , hence .
In summary, the proposition holds.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.