How many pairs ( m , n ) of positive integers satisfy the equation m 2 + 1 0 5 = n 2 ?
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.
Similar solution as @Alak Bhattacharya 's just more details for the better understanding of some.
m 2 + 1 0 5 ⟹ n 2 − m 2 ( n − m ) ( n + m ) = n 2 = 1 0 5 = 1 0 5
Since m and n are positive integers, this means that n > m , and n − m and n + m are the factors of 1 0 5 , with n − m < n + m . For example, 1 0 5 = 1 × 1 0 5 , this means that n − m = 1 and n + m = 1 0 5 , ⟹ n − m + n + m = 1 + 1 0 5 ⟹ 2 n = 1 0 6 ⟹ n = 5 3 ⟹ m = 5 2 . Then we have:
⟹ ( n − m ) ( n + m ) = ⎩ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎧ 1 × 1 0 5 3 × 3 5 5 × 2 1 7 × 1 5 ⟹ n = 5 3 , m = 5 2 ⟹ n = 1 9 , m = 1 6 ⟹ n = 1 3 , m = 8 ⟹ n = 1 1 , m = 4 . Therefore there are 4 solution pairs.
Problem Loading...
Note Loading...
Set Loading...
( n − m ) ( n + m ) = 1 0 5 = 1 × 3 × 5 × 7 .
So there are 4 pairs of ( m , n ) in all; ( 4 , 1 1 ) , ( 8 , 1 3 ) , ( 1 6 , 1 9 ) , ( 5 2 , 5 3 )