A positive integer n has the same remainder of 2019 when divided by 2020 and 2021. What is the remainder when this number is divided by 235?
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.
Ma'am can you please provide proof of this...
""As n has the same remainder of 2019 when divided by both 2020 and 2021, nn must be 2019 more than an integer multiple of the LCM of 2020 and 2021""
n = 2 0 1 9 has a remainder of 2 0 1 9 when divided by both 2 0 2 0 and 2 0 2 1 , and when 2 0 1 9 is divided by 2 3 5 there is a remainder of 1 3 9 .
N mod 2021=2019
N mod 2020=2019
N=4084439
N mod 235 =139
Notice that 2 0 2 0 = 2 ⋅ 2 ⋅ 5 ⋅ 1 0 1 and 2 0 2 1 = 4 3 ⋅ 4 7 . We are interested in the remainder of n modulo 2 3 5 = 5 ⋅ 4 7 .
2 0 2 0 has a factor of 5 and 2 0 2 1 has a factor of 4 7 , so we can consider n modulo 5 and 4 7 . This gives: n ≡ 2 0 1 9 ≡ 4 5 ( mod 4 7 ) , n ≡ 2 0 1 9 ≡ 4 ( mod 5 ) From this, the Chinese Remainder Theorem gives us the solution n ≡ 1 3 9 ( mod 2 3 5 ) .
Problem Loading...
Note Loading...
Set Loading...
As n has the same remainder of 2019 when divided by both 2020 and 2021, n must be 2019 more than an integer multiple of the LCM of 2020 and 2021. Since any two consecutive integers greater than 2 are relatively prime, their LCM is simply their product. This means that n = 2 0 2 0 ⋅ 2 0 2 1 ⋅ k + 2 0 1 9 where k is a positive integer. We then divide this equation by 235. As the product of 2020 and 2021 is divisible by 235, we need only find the remainder of 2 3 5 2 0 1 9 which we find to be 139.