A Pythagorean triple ( a , b , c ) is referred to three natural numbers a , b , and c , such that a 2 + b 2 = c 2 . How many Pythagorean triples with the largest of three numbers less than 1 0 0 exist such that there is also a Pythagorean triple ( o , n , m ) such that m : n : o = a 1 : b 1 : c 1 ?
Example: For the triple ( 3 , 4 , 5 ) , 5 1 : 4 1 : 3 1 cannot be the ratio of a Pythagorean triple, because 2 5 1 + 1 6 1 = 9 1 .
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.
So this solution looks really cool, however, the problem can be solved WAY earlier in your explanation. You say that ab = m^2 - n^2, and ac = m^2 + n^2. Note that m^2 + n^2 and m^2 - n^2 must be relatively prime ( you can assume that a,b,c are primitive as if not, just use different variables). But if those 2 are relatively prime, then why do they have a common? a obviously must be greater than 1, and that's the proof done!
Since m : n : o = a 1 : b 1 : c 1 , therefore we have to have ( a b ) 2 + ( a c ) 2 = ( b c ) 2 . So a b = m 2 − n 2 , b c = 2 m n , c a = m 2 + n 2 for some relative prime integers m and n . Then b ( c + a ) = 2 m 2 , b ( c − a ) = 2 n 2 ⟹ b 2 ( c 2 − a 2 ) = 4 m 2 n 2 ⟹ b 4 = 4 m 2 n 2 ⟹ b 2 = 2 m n . Since ( a , b , c ) is a Pythagorean triplet, therefore a = p 2 − q 2 , b = 2 p q , c = p 2 + q 2 for some integers p , q . This implies m n = 2 p 2 q 2 . So one of m , n must be an odd square multiple of 2 , and the other must be an odd square. Let m = 2 ( 2 r + 1 ) 2 , n = ( 2 s + 1 ) 2 . Then b = 2 ( 2 r + 1 ) ( 2 s + 1 ) , a = 2 ( 2 r + 1 ) ( 2 s + 1 ) 4 ( 2 r + 1 ) 4 − ( 2 s + 1 ) 4 , c = 2 ( 2 r + 1 ) ( 2 s + 1 ) 4 ( 2 r + 1 ) 4 + ( 2 s + 1 ) 4 . But then neither a , nor c is an integer, since the numerator of each of them is odd and the denominator is even. Hence there is no such triplet ( a , b , c ) satisfying the conditions of the problem. That is, the number of such triplets is 0 .
So this solution looks really cool, however, the problem can be solved WAY earlier in your explanation. You say that ab = m^2 - n^2, and ac = m^2 + n^2. Note that m^2 + n^2 and m^2 - n^2 must be relatively prime ( you can assume that a,b,c are primitive as if not, just use different variables). But if those 2 are relatively prime, then why do they have a common? a obviously must be greater than 1, and that's the proof done!
For any triple (a,b,c), say the ratio is x : y : z , where they are all relatively prime. They MUST all be relatively prime because if 2 of them have a common factor greater than 1, then the other will also have that factor by pythagorean theorem. Every pythagorean triple must have this 'primitive' triple, where all sides are relatively prime.
Now, if a triple had terms in a ratio of x 1 : y 1 : z 1 , it will be in a ratio of y z : x z : x y . Obviously, this is not primitive, since as discussed above, if 2 have a common prime factor, the third does as well. However, while each pair does have a common factor, all 3 should not, as x , y , z are relatively prime, and thus if y z and x z have z in common, x y should NOT have z in common. Therefore, this cannot be a pythagorean triple, and thus the answer is 0 .
Problem Loading...
Note Loading...
Set Loading...
Let the Pythagorean triple ( m , n , o ) be m < n < o . Then we have to prove if there is solution for
o 2 1 + n 2 1 o 2 n 2 o 2 + n 2 m 2 n 2 + n 4 m 2 + 2 n 2 m 4 + 2 m 2 n 2 n 2 m 2 + 2 n 2 m 2 + 1 − m 2 n 2 ( n 2 m 2 ) 2 + n 2 m 2 − 1 n 2 m 2 = m 2 1 = m 2 1 = m 2 1 = m 2 n 2 + n 4 = 1 + m 2 n 2 = 0 = 0 = 2 5 − 1 Note that m 2 + n 2 = o 2 Divide both sides by m 2 n 2 Multiply both sides by n 2 m 2 Since n 2 m 2 > 0
There is no rational solution for n m , hence the required natural number triple ( m , n , o ) does not exist.