a 1 + b 1 = 2 0 1 8 3
Find the number of all ordered pairs of integers ( a , b ) , such that a ≥ b > 0 .
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.
Clearing the denominators and factorizing the equation gives 3 a b = 2 0 1 8 ( a + b ) ⟹ ( a − 3 2 0 1 8 ) ( b − 3 2 0 1 8 ) = 9 2 0 1 8 2 ⟹ ( 3 a − 2 0 1 8 ) ( 3 b − 2 0 1 8 ) = 2 0 1 8 2 It it follows that { 3 a − 2 0 1 8 , 3 b − 2 0 1 8 } ∈ { { 1 , 2 0 1 8 2 } , { 4 , 1 0 0 9 2 } , { 1 0 0 9 , 4 0 3 6 } } , as the other three factorizations of 2 0 1 8 2 do not give integers for a and b .
This gives us the solutions: { a , b } ∈ { { 6 7 3 , 6 7 3 ⋅ 2 0 1 8 } , { 6 7 4 , 3 3 7 ⋅ 1 0 0 9 } , { 1 0 0 9 , 2 0 1 8 } } .
Note: This was the first problem on the 2018 Putnam test .
The solutions are ( 2 0 1 8 , 1 0 0 9 ) , ( 3 4 0 0 3 3 , 6 7 4 ) , and ( 1 3 5 8 1 1 4 , 6 7 3 ) . First, I figured that there is no solution for where a = b , and that b < 1 3 4 6 . Solving for a , you get that a = 3 b − 2 0 1 8 2 0 1 8 b . If 3 b − 2 0 1 8 is a factor of 2 0 1 8 , a is an integer. The only times when 3 b − 2 0 1 8 is a factor of 2 0 1 8 , and 3 b − 2 0 1 8 is positive (because a cannot be negative) is when 3 b − 2 0 1 8 = 1 and 3 b − 2 0 1 8 = 1 0 0 9 , where b = 6 7 3 , 1 0 0 9 . Another way a is an integer is if 3 b − 2 0 1 8 is a factor of b or 2 b or 1 0 0 9 b (as 2018's factors are 2 and 1009). The only time this happens is when b = 6 7 4 and 3 b − 2 0 1 8 = 4 .
Problem Loading...
Note Loading...
Set Loading...
There is a relevant theorem by the Czech mathematician P. Bartoš. I'm having trouble finding the original 1970 paper containing the theorem, but it's Theorem 3 in this paper. The theorem states (rephrased):
Applying this theorem to the case of m = 3 and n = 2 0 1 8 , we get that f 1 f 2 = 2 0 1 8 2 = 2 2 ⋅ 1 0 0 9 2 . This leaves five possibilities (up to the order of f 1 and f 2 ):
(1) f 1 = 1 and f 2 = 2 2 ⋅ 1 0 0 9 2
(2) f 1 = 2 and f 2 = 2 ⋅ 1 0 0 9 2
(3) f 1 = 1 0 0 9 and f 2 = 2 2 ⋅ 1 0 0 9
(4) f 1 = 2 2 and f 2 = 1 0 0 9 2
(5) f 1 = f 2 = 2 ⋅ 1 0 0 9
Those cases for which both f 1 + 2 0 1 8 and f 2 + 2 0 1 8 are divisible by 3 will be our solutions. 2 0 1 8 ≡ 2 m o d 3 , so we are looking for f 1 ≡ f 2 ≡ 1 m o d 3 . These are cases (1), (3), and (4) above. So there are 3 solutions.
We can verify that these cases yield solutions, if desired.
(1) x = 3 1 + 2 0 1 8 = 6 7 3 and y = 3 2 2 ⋅ 1 0 0 9 2 + 2 0 1 8 = 1 3 5 8 1 1 4 6 7 3 1 + 1 3 5 8 1 1 4 1 = 2 0 1 8 3 (3) x = 3 1 0 0 9 + 2 0 1 8 = 1 0 0 9 and y = 3 2 2 ⋅ 1 0 0 9 + 2 0 1 8 = 2 0 1 8 1 0 0 9 1 + 2 0 1 8 1 = 2 0 1 8 3 (4) x = 3 2 2 + 2 0 1 8 = 6 7 4 and y = 3 1 0 0 9 2 + 2 0 1 8 = 3 4 0 0 3 3 6 7 4 1 + 3 4 0 0 3 3 1 = 2 0 1 8 3