Number Theory | Congruence Modulo n -- Definition and Examples

[@ahsanshah7626]

Thank you for uploading these videos, they are super helpful! Literally saved me from getting bad grades

[@PunmasterSTP]

This is such a wonderful series of videos, and almost nothing else I've seen comes close to being...equivalent!

[@thomasboi2255]

living upto the username 😂

[@PunmasterSTP]

@@thomasboi2255 That’s how I do it.

[@rd-bz8dg]

I learn much from you.

[@raymondwakasi4923]

now that is what i have been looking for. Well delineated sir Michael.....bravo

[@georgesadler7830]

Professor Penn, thank you for a classic definition and example of Congruence Modulo N.

[@lucas.nicolodi]

Hi, Michael! Thank you so much for your classes. Learned a lot from you.
Do you have any references to share with us about Number Theory? Thank you.

[@BackUp-cz6zn]

better than my professor, also dude you're ripped. nice.

[@jimzuck8964]

You are a great teacher! Love your videos

[@legofilms2430]

Well explained. Thank you 🙂

[@modoulaminceesay9211]

Couldn’t agree more he explained it better than my tutor

[@kennethlevasseur]

Great video that I assigned to my class, but a couple of students complained of what seems to be an echo from your chalk.

[@srinivassapavath2882]

We learned a lot from you and can you please explain what is Gauss theorem

[@mukeshkumarkumar5885]

sir please give example for chapter relation and function for practice
and thank you for this helpful video

[@chasemarangu]

helped me finish my homework!

[@Ensign_Cthulhu]

"A == B mod C if C/(a-b) is an integer". Got it. Clear at last.

[@changjeffreysinto3872]

um its (A-B)/C

[@inthebackwiththerabbish]

@@changjeffreysinto3872 i think he was referring to C being a divisor

[@شيخةالحكمانية]

How we can show that 89 | 2^44 - 1 ????

[@gchh-44]

This guy is a legend

[@xoppa09]

My favorite younger-ish math professor who has the guns (arm muscles).

[@jackdeago3639]

What is the benefits? Where is it use?

[@2EZ4CR7siuuu]

To find the day of a particular date of a year

[@draido-dev]

mostly encryption, there is no paper explaining RSA without using it and the chinese remainder algorithm :P

[@tanjinaaktar1146]

Amazing sir❤

[@GracoNathanaelEspinozaHérnande]

2:16 n in naturals then n=-1

[@HoD999x]

maybe one of the examples should have been a is congruent to b where b > a. otherwise i'll ask why you didn't just say "a mod n = b"

[@brightlin777]

There is another proof for the third condition of equivalence relations :
if n | (a - b) and n | (b - c), then n | [(a - b) + (b - c)] = [a - c].

[@mrunal902]

Thank you

[@srinivasadireddi]

THANKS A TON :)

[@UwU-dx5hu]

thank you so much

[@rahulranjan8873]

I just love how they still go the old school way in Europe with a chalk and a blackboard, just love it💥

[@merry6423]

感觉黑板看不太清要是投影仪就好多了

[@anurodhkumar2943]

Thank you sir

[@raalfize7977]

Helpful thanks

[@srinivassapavath2882]

Thanks

[@izapochowska4779]

「どうやってやるの？」、

[@christophersedlak1147]

thanks!!!!!!!!!!!!!!!!!!

[@universalponcho]

Well explained.

[@pointer7pl]

like in school do not understand

[@sleazyd9683]

1:45 8=3 teehee

[@Chris-xc1vd]

Thank You

[@TheBabyDerp]

Thank you.