Let and be positive integers satisfying and . Find .
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.
If you know the Pythagoras triples 8 2 + 6 2 = 1 0 2 , then it would be very easy to solve this.
If not, use Euclid's formula, where m , n are positive integers and m > n :
x = m 2 − n 2 ⟹ Eq.(1)
y = 2 m n ⟹ Eq.(2)
1 0 = m 2 + n 2 ⟹ Eq.(3)
Since we know that m and n are positive integers, and 4 2 = 1 6 > 1 0 , it means that m and n are a combination of integers 1 , 2 , 3
Try out a few combinations of m and n in Eq.(3), and you would find that 1 0 = 3 2 + 1 2
This means that m = 3 , n = 1
Substitute into Eq.(1) and Eq. (2):
x = 3 2 − 1 2 = 8 y = 2 ( 3 ) ( 1 ) = 6
Therefore, x + y = 8 + 6 = 1 4