It is known that there exists a Pythagorean triple such that both sum of legs and hypotenuse are perfect squares.
Evaluate the sum of all prime factors of .
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.
TRIVIA: According to Fermat , the smallest such triple has sides a = 4 5 6 5 4 8 6 0 2 7 7 6 1 , b = 1 0 6 1 6 5 2 2 9 3 5 2 0 and c = 4 6 8 7 2 9 8 6 1 0 2 8 9 .
Here we have a + b = 2 3 7 2 1 5 9 2 and c = 2 1 6 5 0 1 7 2 , so a + b − c = 2 0 7 1 4 2 .
It can be factorized as 2 0 7 1 4 2 = 2 ⋅ 1 3 ⋅ 3 1 ⋅ 2 5 7 , thus our desired sum is 2 + 1 3 + 3 1 + 2 5 7 = 3 0 3 .
An original solution to this problem would obviously require some code computing.