1. pythagorean triples

prove that if x,y,z is a Pythagorean triple, than at least one of x,y,z is divisible by 5.

What I have so far: let $x = r^2 - s^2, y = 2rs, z = r^2 + s^2$
Then try out all of the cases. If $5\nmid x \mbox{ and } 5\nmid y,\mbox{ then } 5\mid z$ and use congruences to show that it is true, for all of the possible values of r and s.

Is there a more elegant way to prove this, because what I have so far is too tedious.

2. Originally Posted by keityo
prove that if x,y,z is a Pythagorean triple, than at least one of x,y,z is divisible by 5.

What I have so far: let $x = r^2 - s^2, y = 2rs, z = r^2 + s^2$
Then try out all of the cases. If $5\nmid x \mbox{ and } 5\nmid y,\mbox{ then } 5\mid z$ and use congruences to show that it is true, for all of the possible values of r and s.

Is there a more elegant way to prove this, because what I have so far is too tedious.
Consider the possible values of squares modulo $5$, then all the possible values of $x^2+y^2$ modulo $5$ and which of these can a square modulo 5.

CB
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 7, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}