Determine .
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.
Obviously a = 1 3 .
b is just a little trick, and it is that observe every odd prime number is in a Pythagorean triplet, and the triplet ( p , 2 p 2 − 1 , 2 p 2 + 1 ) holds for all primes, hence for all multiples of odd primes.
About powers of 2, as 4 comes in the triplet ( 3 , 4 , 5 ) , all the powers of 2 greater than 2 2 = 4 will be in some triplet.
So only people who remain are 2 and 1 , whose sum gives b = 3
Now c can be determined by using Modular Arithmetic, specifically the fact that
Quadratic residues of 3 and also for 4 , are ( 0 , 1 ) ; for 5 , they're ( 0 , 1 , − 1 )
x 2 + y 2 = z 2 , now as no combination of 1 in the remainders can give possible remainder for z , we conclude that 3 ∣ x y , similarly 4 ∣ x y and 5 ∣ x y z .
Thus 6 0 ∣ x y z .... from 2 quick examples of triplets ( 1 1 , 6 0 , 6 1 ) and 9 × ( 3 , 4 , 5 ) = = ( 2 7 , 3 6 , 4 5 ) , we can verify 6 0 is the maximum number. c = 6 0
The only triangle where 3 8 5 is Hypotenuse is ( 2 3 1 , 3 0 8 , 3 8 5 ) (sorry, used programming to determine this)
The other triangles will be like
y 2 + 3 8 5 2 = x 2 , i.e. 3 8 5 2 = x 2 − y 2
( x + y ) ( x − y ) = 5 2 ⋅ 7 2 ⋅ 1 1 2
As the RHS has 2 7 integer factors, exclude 5 × 7 × 1 1 and pair other 26 into 13 pairs of factors, that will give 13 pairs of x , y after solving simple simultaneous equations (didn't bother to solve them as all are different and have integer solutions).
That gives d = 1 + 1 3 ⟹ d = 1 4
Final answer, a + b + c + d = 1 3 + 3 + 6 0 + 1 4 = 9 0