Define a Primitive Pythagorean Triple as a set of three positive integers such that and , and where the integers don't all share a common factor greater than 1.
How many Primitive Pythagorean Triples exists that satisfy the equation ?
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.
We will use the parametrization of Pythagorean Triples, ( a , b , c ) = ( m 2 − n 2 , 2 m n , m 2 + n 2 ) . Note that we can swap the values of a and b to satisfy a < b < c since they are symmetric in a + b − c = 2 0
Substituting these values into the equation, m 2 − n 2 + 2 m n − ( m 2 + n 2 ) = 2 0 2 m n − 2 n 2 = 2 0 n ( m − n ) = 1 0
By trying n = 1 , 2 , 5 , 1 0 , we obtain ( m , n ) = ( 1 1 , 1 ) , ( 7 , 2 ) , ( 7 , 5 ) , ( 1 1 , 1 0 )
The corresponding values of a , b and c are ( a , b , c ) = ( 2 2 , 1 2 0 , 1 2 2 ) , ( 2 8 , 4 5 , 5 3 ) , ( 2 4 , 7 0 , 7 4 ) , ( 2 1 , 2 2 0 , 2 2 1 )
The first and third solutions are rejected since their g cd > 1 . This leaves us with 2 solutions.