State the Chinese Reminder Theorem Compute 810003 mod 105 us

State the Chinese Reminder Theorem. Compute 8^10003 (mod 105) using the Chinese reminder theorem. Note that 105 = 3 middot 5 middot 7.

Solution

There are certain things whose number is unknown.

Repeatedly divided by 3, the remainder is 2;

by 5 the remainder is 3; and by 7 the remainder is 2.

What will be the number?

part b no idea