What is the remainder when the number
is divided by 990?
(The digits of the number are just the digits of all the integers from 101 to 998 inclusive, written side-by-side.)
I think I would have to use chinese remainder theorem and factor 990.
Do I just create a system of 4 modular equations with different modulos as the factors listed above?