I'm still revising for my final (this class is absolutely killing me) and I need some help on the following problem:
What is the remainder when the number 101102103104105...996997998 is divided by 990?
The question says that CRT must be used. I actually found an alternative answer to this question on this site (link: Remainder when dividing by 990: Chinese Remainder Theorem) and understand the policy on duplicates, but I wish to know how we can use CRT on such a large number.
If we were to set x = 101102103104105...996997998, then based on the factors of 990, we would get x = k mod 10, x = k mod 11 and x = k mod 9. But how can I apply the CRT on such a large number?
Thanks! And sorry about the very similar question.