Number Theory | Some properties of integer congruence.

[@proofbyexample1465]

Amazing videos, glad they're still up, these are all very helpful. Thank you Michael!

[@Abhisruta]

You deserve more subscribers...

[@phenomenalprince4390]

Thanks for uploading these videos...

[@georgesadler7830]

Professor Penn, thank you for an incredible lecture on Some properties of integer congruence.

[@mohammedboussardi7718]

verry good courses mohammed boussardi from morroco

[@mrflibble5717]

Really like this series of Vids. Nice clear explanations, fantastic!

[@PunmasterSTP]

Another phenomenal video! Congruence? More like congru-excellence!

[@nerototo2472]

"OK, good". "Fantastic"

[@tariqmath1845]

Wow thanks,

[@tanjinaaktar1146]

Thanka infinity sir❤

[@marcellobonnanza9532]

A simple def : a==b(mod n) it exists k such that a=b+kn

[@moslemasultana9388]

Thank you sir

[@treksis]

thanks. confused with modulo stuff. it helps a lot

[@JB-ym4up]

What if m is 8 and n is 4? 4 divides 8 5 mod 8 != 5 mod 4

[@Domisterwoozy]

You can't have both sides of your equation be different modules. His proof is saying if two numbers are congruent modulo n then they will be congruent modulo m. You are just saying 5 is congruent to 5 which is obviously true for all n.