This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Great analysis.
Primitive Pythagorean triples satisfy the following conditions: ( a , b , c ) = ( 2 x y , x 2 − y 2 , x 2 + y 2 ) ∀ y > x > 0 f r o m ( 2 x y ) 2 + ( x 2 − y 2 ) 2 = ( x 2 + y 2 ) 2 Now clearly 2 x y is even so at least one of a and b are even and hence not prime. Also, note that 2 x y = 2 ⟹ x = y = 1 but this contradicts x < y and the fact that they are coprime natural numbers.
Problem Loading...
Note Loading...
Set Loading...
Mod 4, any square is either 0 (if the number is even) or 1 (if the number is odd). Then if a 2 + b 2 = c 2 ( a , b , c all prime), exactly one or three of them must be even for the equation to hold modulo 4. That is, one or three of the primes is 2. Moreover, c > a , b , so c = 2 .
Assume a = 2 , b , c are odd. Then c 2 = b 2 + 4 . But c > b , and since b , c are odd, c < b + 1 . Then c 2 ≥ ( b + 2 ) 2 = b 2 + 4 b + 4 . Thus, b 2 + 4 ≥ b 2 + 4 b + 4 , implying b ≤ 0 and contradicting b being prime.
Thus, there are no Pythagorean triplets consisting of three prime numbers, so the answer is 0 (regardless of the given range for c ).