Let S be the set of all distinct Pythagorean Triplets ( a , b , c ) where a , b , c are positive integers and a < b < c such that a b = 1 0 ( a + b + c ) .
Let the sum of all distinct values of c of the elements of S be x .
Let the number of elements or Pythagorean Triplets present in the set S be y .
Let the sum of all distinct Inradii of all such Right Angled Triangles formed by the Pythagorean Triplets present in S be z .
Find the value of x + y + z .
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.
That's a very clean way of getting to the diophantine equation! What made you think of it?
For a right-angled triangle with sides a , b , c where a < b < c , By Pythagoras theorem we have hypotenuse c = a 2 + b 2 . So our equation becomes a b = 1 0 ( a + b + a 2 + b 2 ) a b − 1 0 a − 1 0 b = 1 0 a 2 + b 2 . Now, squaring both the sides, we get: a 2 b 2 + 1 0 0 ( a 2 + b 2 ) − 2 0 a b ( a + b ) + 2 0 0 a b = 1 0 0 ( a 2 + b 2 ) => a b ( a b − 2 0 a − 2 0 b + 2 0 0 ) = 0 . Since a b = 0 , ( a b − 2 0 a − 2 0 b + 2 0 0 ) = 0 . Factorizing and rearranging the given equation, we get: a ( b − 2 0 ) − 2 0 ( b − 1 0 ) = 0 => 2 0 a = b − 2 0 b − 1 0 = > a = 2 0 + b − 2 0 2 0 0 We can easily solve this Diophantine equation, starting with the factorization of 2 0 0 , followed by setting values for b , then finding a and finally c , under the following constraints: 0 < a < b < c and ( a , b , c ) ∈ Z + . So we arrive at 6 possible solutions of ( a , b , c ) : ( 3 0 , 4 0 , 5 0 ) , ( 2 8 , 4 5 , 5 3 ) , ( 2 5 , 6 0 , 6 5 ) , ( 2 4 , 7 0 , 7 4 ) , ( 2 2 , 1 2 0 , 1 2 2 ) , ( 2 1 , 2 2 0 , 2 2 1 )
Therefore, x = ∑ c Δ = 5 8 5 , y = 6 . For finding the in-radius, we can apply the formula, r = 2 a + b − c (This can be derived easily through the properties of tangents to circles). By replacing values from the solution-set we get the in-radii of all triangles as 1 0 . ∴ z = 1 0 . Hence, x + y + z = 5 8 5 + 6 + 1 0 = 6 0 1 : )
Corollary: Given the equation a b = 1 0 ( a + b + c )
= > 1 0 = a + b + c a b = > a + b + c 2 ( a + b ) 2 − 2 ( a 2 + b 2 )
= > 1 0 = 2 ( a + b + c ) ( a + b ) 2 − c 2 = > 1 0 = 2 ( a + b + c ) ( a + b + c ) ( a + b − c )
∴ 1 0 = 2 a + b − c = r
Hence for any triplet of ( a , b , c ) satisfying the above equation, the inradius of all possible triangles formed will always be equal to 1 0
While solving this question , I came across an interesting fact:
∙ If you look closely at the set of solutions, we see for ( a , b , c ) ,except ( 3 0 , 4 0 , 5 0 ) that. b + ( unit’s digit of a ) = c
Can somebody explain this to me , please? @Brian Charlesworth @Kazem Sepehrinia @Kartik Sharma @Sharky Kesa @Calvin Lin
Problem Loading...
Note Loading...
Set Loading...
a 2 + b 2 = c 2 ( a + b ) 2 − c 2 = 2 a b ( a + b + c ) ( a + b − c ) = 2 0 ( a + b + c ) a + b − c = 2 0 1 0 ( a + b + c ) + 1 0 ( a + b − c ) = a b + 2 0 0 ( a − 2 0 ) ( b − 2 0 ) = 2 0 0
Solving the above diophantinus equation and substituting the values of a and b in a 2 + b 2 = c 2 . We get,
S = { ( 2 1 , 2 2 0 , 2 2 1 ) , ( 2 2 , 1 2 0 , 1 2 2 ) , ( 2 4 , 7 0 , 7 4 ) , ( 2 5 , 6 0 , 6 5 ) , ( 2 8 , 4 5 , 5 3 ) , ( 3 0 , 4 0 , 5 0 ) }
So, x = 2 2 1 + 1 2 2 + 7 4 + 6 5 + 5 3 + 5 0 = 5 8 5 , y = 6 .
Now, inradius, r = s Δ = 2 1 ( a + b + c ) 2 1 a b = a + b + c a b = 1 0 . So, it is constant for all the triangles formed by these Pythagorean triplets. So, z = 1 0 .
So, x + y + z = 6 0 1 .