Linear Congruence - Part 2

preview_player
Показать описание
This video clearly explains the solution of linear congruencies. It is a continuation of the first video. Enjoy!!!
Рекомендации по теме
Комментарии
Автор

Thank you so much! I and other students really appreciate your well-thought out examples, along with your many explanations of *why* you do certain operations. It's very kind of you to produce these videos.

alacarterr
Автор

You do a great job explaining the material! Thanks!

Zealdonut
Автор

Hola Miguel. Your question on the solution of a system of linear congruences can be solved using the Chinese Remainder Theorem. I am yet to do a video on the Chinese Remainder Theorem, but there are several good web resources that covered that concept.

SamuelChukwuemeka
Автор

Thanks a lot. But what if you had something like 2x = 1156(mod89) instead of 1x = 1156(mod 89). How would you solve for x?

The equal to (=) sign is for congruence. I can't type the congruence sign with the keyboard.

amahct
Автор

Hola Samuel. Thank you very much for a great video. However I have come across a problem of solving linear congruences. For example I have this question: "solve the system of linear congruences x=1(mod3); x=2(mod5); x=3(mod7)." where the equal signs are congruence signs. I can only work out the answer using trial and error?!

MiguelRodriguez-fgou
Автор

can u provide a solution for 7x= 13 (mod 100)

manikanta-grvb
Автор

lol drink some soda and dance.
dance i shall!!!

xbluethunderx
Автор

Chinese Remainder theorem, youtube chinese remainder theorem

JustinGi