A Pythagorean triplet is a set of three natural numbers, a < b < c , for which,
a 2 + b 2 = c 2
For example, 3 2 + 4 2 = 9 + 1 6 = 2 5 = 5 2
There exists exactly one Pythagorean triplet for which a + b + c = 1 0 0 0 .
Find the product a b c .
Try other problems here .
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.
Just to provide an analytic solution....
With c = 1 0 0 0 − ( a + b ) we require 0 < a < b < 1 0 0 0 such that
a 2 + b 2 = ( 1 0 0 0 − ( a + b ) ) 2 ⟹ a 2 + b 2 = 1 0 0 0 2 − 2 0 0 0 ( a + b ) + ( a + b ) 2 ⟹
0 = 1 0 0 0 2 − 2 0 0 0 ( a + b ) + 2 a b ⟹ a b − 1 0 0 0 a − 1 0 0 0 b = − 5 0 0 0 0 0 ⟹
( a − 1 0 0 0 ) ( b − 1 0 0 0 ) − 1 0 0 0 2 = − 5 0 0 0 0 0 ⟹ ( a − 1 0 0 0 ) ( b − 1 0 0 0 ) = 5 0 0 0 0 0 ⟹
( 1 0 0 0 − a ) ( 1 0 0 0 − b ) = 2 5 × 5 6 .
Now since 0 < a < b < 1 0 0 0 we require that 0 < ( 1 0 0 0 − b ) < ( 1 0 0 0 − a ) < 1 0 0 0 , so we need to look for pairs of positive integers under these restrictions whose product is 5 0 0 0 0 0 = 2 5 × 5 6 . Given this factorization, the only option is 6 7 5 × 8 0 0 , which leads to ( a , b , c ) = ( 2 0 0 , 3 7 5 , 4 2 5 ) , and thus a b c = 3 1 8 7 5 0 0 0 .
Any Pythagorean triple with a , b , c > 0 can be generated uniquely (up to exchange of a and b ) as ⎩ ⎪ ⎨ ⎪ ⎧ a = p 2 − q 2 b = 2 p q c = p 2 + q 2 p > q > 0 . Adding these, we find that a + b + c = 2 p ( p + q ) = 1 0 0 0 . We also have that p < p + q < 2 p . Thus we solve for integers the system { p ( p + q ) = 5 0 0 5 0 0 > p > 2 5 0 , i.e. 2 2 ≥ p ≥ 1 6 It is easy to find the only solution to be p = 2 0 , q = 5 , a = 3 7 5 , b = 2 0 0 , c = 4 2 5 . (But we must flip a , b to satisfy the given condition a < b < c .) The answer is 2 0 0 ⋅ 3 7 5 ⋅ 4 2 5 = 3 1 8 7 5 0 0 0 .
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 |
|
Problem Loading...
Note Loading...
Set Loading...
We are looking for an integer sided right angle triangle with perimeter 1000. Let's check if there are any 'basic' right triangles whose perimeter is a factor of 1000.
3 + 4 + 5 = 12 :-(
5 + 12 + 13 = 30 :-(
7 + 24 + 25 = 56 :-(
8 + 15 + 17 = 40 :-) Yes! This is a factor as 40 x 25 = 1000
So scale it up 25 times to get the perimeter 1000, giving sides to be 200, 375, 425. Whose product is 31875000