Originally Posted by
LL_5 I'm finding it hard to get my head around Chinese Remainder Theorem. So wondering if anyone could help with this problem?
Solve the egg problem used to illustrate the Chinese Remainder Theorem if the remainders on division by 2,3,4,5,6 and 7 are all 1 by (i) the given proceduce (ii) the easier way.
I have no idea what the easier way is.
But I have managed to set up the problem for (i) as below:
X=1(Mod2)
X=1(Mod3)
X=1(Mod4) this is ignored as it is the same as the first
X=1(Mod5)
X=1(Mod6)
X=1(Mod7)
Is this correct and if so what is my next step?