Talk:Discrete Mathematics/Modular arithmetic

under Chinese remainder theorem it says

N=m1m2...mk, then write n1=N/m1, ..., nk=N/mk.

leading to

nk=N/mk and nkmk=N (sounds right)

and

Our solution will be x ≡ a1m1n1+...+akmknk (mod N)

leading to

Our solution will be x ≡ (a1+...+ak)N (mod N) ≡ 0 (mod N)

which sounds wrong. Hopefully someone can fix this, or explain better why it is right.

also, N can be lcm(m1,...,mk) when gcd(m1,...,mk)!=1


 * I've always disliked the CRT, so there might be an error lurking there somewhere. I've got to review and expand that section, but I have little time nowadays... Dysprosia 08:29, 16 Mar 2004 (UTC)

More explanations for the answers would be awesome
For question 6 I have a hard time grasping why the answer would be 3. A more in depth explanation of the answers provided would be helpful. --Emilhem (discuss • contribs) 18:48, 25 August 2016 (UTC)