A Yearly Remainder

A positive integer n n has the same remainder of 2019 when divided by 2020 and 2021. What is the remainder when this number is divided by 235?


The answer is 139.

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.

4 solutions

Anthony Lamanna
Dec 20, 2019

As n n has the same remainder of 2019 when divided by both 2020 and 2021, n 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 = 2020 2021 k + 2019 n=2020 \cdot 2021 \cdot k+2019 where k 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 2019 235 \frac{2019}{235} which we find to be 139.

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""

Anshik Kumar Tiwari - 1 year, 5 months ago
David Vreken
Dec 25, 2019

n = 2019 n = 2019 has a remainder of 2019 2019 when divided by both 2020 2020 and 2021 2021 , and when 2019 2019 is divided by 235 235 there is a remainder of 139 \boxed{139} .

Vinod Kumar
May 25, 2020

N mod 2021=2019

N mod 2020=2019

N=4084439

N mod 235 =139

Matthew Burr
Jan 28, 2020

Notice that 2020 = 2 2 5 101 2020=2\cdot 2\cdot 5\cdot 101 and 2021 = 43 47 2021=43\cdot 47 . We are interested in the remainder of n n modulo 235 = 5 47 235=5\cdot 47 .

2020 2020 has a factor of 5 5 and 2021 2021 has a factor of 47 47 , so we can consider n n modulo 5 5 and 47 47 . This gives: n 2019 45 ( mod 47 ) , n\equiv 2019 \equiv 45 (\textrm{mod}\enspace 47), n 2019 4 ( mod 5 ) n\equiv 2019 \equiv 4 (\textrm{mod}\enspace 5) From this, the Chinese Remainder Theorem gives us the solution n 139 ( mod 235 ) n\equiv 139 (\textrm{mod}\enspace 235) .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...