Chinese Remainder Theorem

[8zz8]

I have a little applet at ywhmaths.webs.com/NumberTheory­/ChineseRemainder.html

for anyone who wish to try out the Chinese Remainder Theorem.

[iianhthuiii]

Thanks!!

[iianhthuiii]

Very helpful!

[AkintoyeDaniel]

how can i download this?

[burny1]

@AkintoyeDaniel i did find a youtube downloader at some point. a quick google gets me to saveyoutube website

[beep1234beeper]

every year I need this and every year I forget.....

[CHistrue]

Very clear and concise!

[aznlalaland]

Now do one about the application of this in the isomorphism of rings. :)

[WhiteValkery]

how come this doesn;t work for:

x=2(mod3)

x=3(mod5)

x=2(mod7)

[LordConti]

@WhiteValkery

I'm not sure what the work for your solution looked like, so I can't tell you where you went wrong, but this does work for your set of equations. I ended up with the equation x = 105t + 23. If you want to compare notes, just shoot me a message :)

[WhiteValkery]

@LordConti

this is from last year lol...

i have no idea what i did now...

though if i remember... the solution obtained throw this method is simply different from what my prof got...

and hwne i asked him about this method he said it was incorrect and only works for some problems with cirtain patterns...

or something...

[isak885]

Decent lecture, however you were inconsitent with the use of the congruence. At around 5:00 you have 5y + 2 = 4 mod 7. Also... it is (I think) more proper to write.

a = b (mod n) "where we have the brackets. Otherwise... nice :)

[bloodfire1004]

Thanks for the video! It helped me!

[Nicholasng92]

Thanks a lot!!! ^_^

[kowtnaak]

maaan!! thank you!!!