If a + b + a b = 2 0 1 9 and a , b are positive integers, find the sum of all possible values of a .
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.
I think 2019mod(a+1) should be -1. Pls correct me if I m wrong
Thank you, I fixed the error
a + b + a b = 2 0 1 9 ⇒ a + b ( a + 1 ) = 2 0 1 9 ⇒ a + 1 + b ( a + 1 ) = 2 0 2 0 ⇒ ( a + 1 ) ( b + 1 ) = 2 0 2 0
Adding 1 to both sides, it is rewritten as ( a + 1 ) ( b + 1 ) = 2 0 2 0 . So a + 1 must be a factor of 2 0 2 0 .
All factors of 2 0 2 0 = 2 2 × 5 × 1 0 1 are 1 , 2 , 4 , 5 , 1 0 , 2 0 , 1 0 1 , 2 0 2 , 4 0 4 , 5 0 5 , 1 0 1 0 , 2 0 2 0 .
Since a and b must be positive, both factors must be greater than 1, and the factorization 1×2020 is discarded.
The sum of all possible a then is equals 1 + 3 + 4 + 9 + 1 9 + 1 0 0 + 2 0 1 + 4 0 3 + 5 0 4 + 1 0 0 9 = 2 2 5 3 .
b a + 1 a ∑ a = a + 1 2 0 2 0 − 1 ∣ 2 0 2 0 ∈ { 1 , 3 , 4 , 9 , 1 9 , 1 0 0 , 2 0 1 , 4 0 3 , 5 0 4 , 1 0 0 9 } ( a ∈ / { 0 , 2 0 1 9 } ∵ a , b ∈ Z + ) = 2 2 5 3
Problem Loading...
Note Loading...
Set Loading...
Solving for b gives b = a + 1 2 0 1 9 − a , or b = a + 1 2 0 1 9 − a + 1 a
Because b is an integer, 2 0 1 9 ≡ a ( m o d a + 1 )
a ≡ − 1 ( m o d a + 1 ) for any positive integer value of a , so 2 0 1 9 ≡ − 1 ( m o d a + 1 ) . Therefore, ( a + 1 ) is a divisor of 2 0 2 0
The factors of 2 0 2 0 are { 1 , 2 , 4 , 5 , 1 0 , 2 0 , 1 0 1 , 2 0 2 , 4 0 4 , 5 0 5 , 1 0 1 0 , 2 0 2 0 }, so these are the possible values of ( a + 1 ) . However, 1 doesn't work because a would be 0 (not positive), and 2 0 2 0 doesn't work because b would be 0 . Subtracting one from each of the remaining numbers leaves { 1 , 3 , 4 , 9 , 1 9 , 1 0 0 , 2 0 1 , 4 0 3 , 5 0 4 , 1 0 0 9 } as the possible values of a .
1 + 3 + 4 + 9 + 1 9 + 1 0 0 + 2 0 1 + 4 0 3 + 5 0 4 + 1 0 0 9 = 2 , 2 5 3