How many ordered pairs of positive integers , where , 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 can rearrange the equation:
2 0 1 7 1 = a b 2 ( a + b ) ⟹ a b = 2 ⋅ 2 0 1 7 ( a + b ) . Let then p = a b and s = a + b .
Since p ( x ) = x 2 − s x + p x has two integer roots, precisely a and b , it must be Δ = q 2 for a certain q ∈ Z , so that s 2 − 4 p = q 2 . Also, we have b = 2 s + q , a = 2 s − q . Recalling then from above that p = 2 ⋅ 2 0 1 7 s , it follows:
s 2 − 8 ⋅ 2 0 1 7 s = q 2
( s − q − 4 ⋅ 2 0 1 7 ) ( s + q − 4 ⋅ 2 0 1 7 ) = ( 4 ⋅ 2 0 1 7 ) 2
( a − 2 ⋅ 2 0 1 7 ) ( b − 2 ⋅ 2 0 1 7 ) = ( 2 ⋅ 2 0 1 7 ) 2
So, we narrowed our search to couples of integers A , B : A ⋅ B = 2 2 2 0 1 7 2 , where A + 2 ⋅ 2 0 1 7 = a and B + 2 ⋅ 2 0 1 7 = b . For such couples, 0 < a ≤ b ⇒ − 2 ⋅ 2 0 1 7 < A ≤ B . However, if A < 0 , then − 2 ⋅ 2 0 1 7 < A ⇒ A ( 2 ⋅ 2 0 1 7 ) 2 < − 2 ⋅ 2 0 1 7 ( 2 ⋅ 2 0 1 7 ) 2 and so B < − 2 ⋅ 2 0 1 7 , which cannot be accepted, as just stated. The same goes for B . Thus, A , B > 0 .
There are 3 ⋅ 3 = 9 positive divisors of 2 2 ⋅ 2 0 1 7 2 , and hence there are 4 couples of distinct A , B and 1 couple with A = B = 2 ⋅ 2 0 1 7 .
So, 4 + 1 = 5