Again Pythagoras

Consider the triplets of positive integers ( a , b , c ) (a,b,c) with a a is odd, gcd ( a , b , c ) = 1 \gcd(a,b,c)=1 and a 2 + b 2 = c 2 a^2+b^2=c^2 .

Which one can't be a value of b b ?

Notation: gcd ( ) \gcd(\cdot) denotes the greatest common divisor function.

1600 1006 6100 1060

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.

1 solution

All primitive Pythagorean triples can be represented as ( m 2 n 2 , 2 m n , m 2 + n 2 ) (m^{2} - n^{2}, 2mn, m^{2} + n^{2}) for positive integers m , n m,n . Since a a is odd we must have a = m 2 n 2 a = m^{2} - n^{2} and b = 2 m n b = 2mn . Now to ensure that a a is odd we must have one of m , n m,n be odd and the other even, which means that b = 2 m n b = 2mn must be divisible by 4 4 . The only given option that is not divisible by 4 4 is 1006 1006 , and hence b b cannot be 1006 \boxed{1006} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...