I have seen so many videos, but no one explained it as clear as you did, what I liked is the fact that you also included examples with negative numbers, and adding that a congruent to b (mod n) where b is negative is also true, but we don't usually put -ve values for b(the remainder when a is divided by n)
i always knew that modular arithmetic had something to do with remainders, and im a visual learner so i loved the way you used the clock as an example. thanks this was so clear and showed me that i shouldn’t be scared of this concept cuz i always thought it was so hard ‼️
WHERE HAVE YOU BEEN ALL MY COLLEGE LIFE!!!??? This was the easiest explanation out of like 7 videos I wasted time watching and you explained it so effortlessly and it ACTUALLY makes sense :) Thank you!
Though this is a few years late, thanks a ton for this video! I was struggling with the idea of modular arithmetic, but the clock example really opened my eyes to how truly simple this is!
What's the difference between this and the modulo used in computing? For example here, we say 34 = 10 mod 12. But in computing, it would be 34 mod 12 = 10. Why is the notation different?
Big brain! Man, you actually know how to teach math in English and I love it! Some folks out here sound like they are from another planet with their explanations lol. Appreciate it.
I’m Canadian. I took all advanced math through high school, never learned mod math. Even took the pre university math courses. Have to wonder why. All these concepts that help you manipulate numbers are useful to know if you’re going to take math further.
good vid, greatly explained, would like to say that it might be confusing for some that you did not use paranthesis, since not using them is a different notation to what you are explaining. (denominator and remainder switch places)
thank you so much, i was afraid that i would fail since i cant understand a single thing which my teacher thought me , but after watching your video i can understand everything, once again thank you so much sir ....
9:20 Little correction: You only do division properly mod p if p is a prime number. Non-prime modular arithmetics do not have all inverses under multiplication. You can see this easily if you think of any divisors of the mod. Let's say we use the 12. Because both 2 & 6 divide twelve 2*6 = 12 which is 0 mod 12 and thus neither 2 or 6 can have multiplicative inverses mod 12. Which implies that you can't divide all numbers by 2 in mod 12 arithmetic.
Thank you! Was taught this earlier today and everyone got it n whizzed through it except me. I became the laughing stock of the classroom for struggling with such basic maths. Thanks for this video. I see what was so hilarious now. I don't see any humanity in my peers though...
Perfect intro to modular arithmetic for decimal number system 👍 Please do the equivalent presentations for hexadecimal and octal 😀 Kindest regards, friends and neighbours.
43 mod 10 = ? Answer is 3 but I didn't get to know how at first . Here RHS is not known . according to me there are four 10s and three is left out . 10+10+10+10+3=43 Ignoring four 10s , and considering 3, So answer is 3 . Am I correct ? Did the answer explanation match ?
Hi tom, i understood this but how does this relate to congruency?if a is equivalent b in modulo n, is this equivalent to saying a is congruent to b in modolu n
There are now 10 videos in the series for you to enjoy - all available here: ruclips.net/video/by8Mf6Lm5I8/видео.html
I'm genuinely really impressed by how well you explained this. well done and thank you.
You're very welcome Adriana :)
Holy crap, always assumed modular arithmetic was super confusing, but you explained it so well it actually seems like fun.
Just watched a 30min uni lecture explaining this twice ... still didn't get it. Watched the first 4 mins of this and understand completely. Cheers!
I have seen so many videos, but no one explained it as clear as you did, what I liked is the fact that you also included examples with negative numbers, and adding that a congruent to b (mod n) where b is negative is also true, but we don't usually put -ve values for b(the remainder when a is divided by n)
i always knew that modular arithmetic had something to do with remainders, and im a visual learner so i loved the way you used the clock as an example. thanks this was so clear and showed me that i shouldn’t be scared of this concept cuz i always thought it was so hard ‼️
I love how THOROUGHLY you explained the concept long before you gave the equation. I will definitely take this pedagogic lesson along with me now
Thanks!
The best explanation for modular arithmetic, love your class
You teach so well, it's my first time to understand clearly what it is comparing to other videos ! Thank you sir !
You're very welcome :)
I was really longing for this kind of explanation.
Everyone were like into the numbers but you told us what the number is about
I love it!!
Thanks Zia - glad you enjoyed it!!
WHERE HAVE YOU BEEN ALL MY COLLEGE LIFE!!!??? This was the easiest explanation out of like 7 videos I wasted time watching and you explained it so effortlessly and it ACTUALLY makes sense :) Thank you!
Glad I could help :)
Though this is a few years late, thanks a ton for this video! I was struggling with the idea of modular arithmetic, but the clock example really opened my eyes to how truly simple this is!
Fantastic explanation, by far the best out there. Well appreciated Tom!
Glad it helped Vincent!
What's the difference between this and the modulo used in computing? For example here, we say 34 = 10 mod 12. But in computing, it would be 34 mod 12 = 10. Why is the notation different?
Best explanation of modular arithmetic.
This is the best explanation of modular on youtube. Great work. Thank you.
Thanks - glad I could help.
Incredible explanation! It's awesome that we all use modular arithmetic when doing time math and we don't even realize it! Thanks for the video!
The best explanation of modular arithmetic on the internet. Thank you!
Thank you so much, I really appreciate the simple yet detailed explanation.
best elucidation of this concept I have seen thank you
The best explanation I found online. Bravo
Thanks Jason - glad it was helpful.
Marvelous explanation!!
Hey what is the angle between two hands of a clock at 2:12 ?
Ha. Trying to understand this for months....your clock example is just what I need. Thanks a lot. Keep up the good work
Awesome to hear, thanks Santosh.
I swear this guy makes things easier. Thanks man.
happy to help :)
Big brain! Man, you actually know how to teach math in English and I love it! Some folks out here sound like they are from another planet with their explanations lol. Appreciate it.
happy to help :)
Thanks Tom. Best explanation of modulo!
Thanks Fernando :)
Thank you for using an intuitive example, made the concept easier to grasp!
Glad it was helpful!
Your content is really good for abstract algebra!
Awesome - thanks :)
Thank you so much for your simple, clear explanation! The penny has finally dropped!!
Glad it helped!
Thanks bro!! I studied this math for like 4 hours and I was clueless…. But I only watched your video for like 5 mins and I understand everything!!!
happy I could help :)
My lecturer spent 2 hours explaining this I didn't get it. after 9 minutes of watching this video, I understood very well. Thank you so much.
You're very welcome Emmanuelle :)
I’m Canadian. I took all advanced math through high school, never learned mod math. Even took the pre university math courses. Have to wonder why. All these concepts that help you manipulate numbers are useful to know if you’re going to take math further.
ive watched a couple videos on this topic but yours is the best.
Thanks Nihin!
best explanation
This just helped a ridiculous amount thank you!
good vid, greatly explained, would like to say that it might be confusing for some that you did not use paranthesis, since not using them is a different notation to what you are explaining. (denominator and remainder switch places)
Great Explanation
Glad it was helpful!
*MIND BLOWN*
thank you so much, i was afraid that i would fail since i cant understand a single thing which my teacher thought me , but after watching your video i can understand everything, once again thank you so much sir ....
glad I could help :)
Brilliant video. I'm taking Abstract Algebra atm and I was looking for a video that explains it further. This is it!
Glad it was helpful Jay!
9:20 Little correction: You only do division properly mod p if p is a prime number. Non-prime modular arithmetics do not have all inverses under multiplication. You can see this easily if you think of any divisors of the mod. Let's say we use the 12. Because both 2 & 6 divide twelve 2*6 = 12 which is 0 mod 12 and thus neither 2 or 6 can have multiplicative inverses mod 12. Which implies that you can't divide all numbers by 2 in mod 12 arithmetic.
First explanation i really understood, the clock analogy was neat :D ty
Thank you so much! It was explained in a way I completely understand! Great job!
this is very explanatory! I totally understand now! thank you!
Glad it was helpful Simi!
Great explanation mate 👊
Glad it helped
The analogy was the best 😊
its so mind blowing the way concepts are explained using simple examples
Happy to help.
I really understand your teaching.THANK YOU SO MUCH SIR
You are most welcome
Thanks man for making me understand this confusing topic that takes me a day to realize what is it
Wow, amazing explanation
Thank you! Was taught this earlier today and everyone got it n whizzed through it except me. I became the laughing stock of the classroom for struggling with such basic maths. Thanks for this video. I see what was so hilarious now. I don't see any humanity in my peers though...
Glad I could help.
Tom, you rocked this maths. Thank you
Glad you enjoyed it Trevor!
Watching this in 2020! THANK YOU TOM!!!!
YOU'RE VERY WELCOME SAAR!!!! loving your enthusiasm :)
Perfect intro to modular arithmetic for decimal number system 👍
Please do the equivalent presentations for hexadecimal and octal 😀
Kindest regards, friends and neighbours.
Thks brot! you are clear!
Thanks for explaining this topic, I really appreciate this, it really helped a lot with my assignment
You're very welcome Beatrice!
This was very helpful and clearly explained, thank you.
glad it was useful!
Thankyou so much I'm studying and this completely went over my head clock was a good example.
Glad it was helpful!
Finally. Good tutorial. Thank you. 😊
You're welcome Nuwan!
Can you do some follow up videos on modular arithmetic (don't forget to mention some interesting and challenging problems please!)
thanks. I have a cryptography exam tomorrow and I forgot what this was.
Glad it helped - hope it went well!
Would modular arithmetic be better named as cyclical arithmetic?
It certainly works based on the concept, yes!
Loved this. Thank you so much!!! (I also love your hair) 💕😜
😊 thank you
While i found hard to have another chanel on m already full yt playlist I'm following you through your other social media, thk a lot
Awesome :)
Thanks alot
Thank you. This was really clear!
I easily understood the concept which is a great achievement for me thank you so much!
Glad it was helpful Mariel!
Well done Tom! Thanks
Thanks for watching Rawan!
Nice one sir. Lov the explanation.
Glad you liked it!
Great presentation
Thanks very much
You're very welcome :)
Thank you so much for this video the way you explained it was very clear and I understood everything very quickly
Awesome, thanks!!
You're so good at this. Thank you very much. :)
you're very welcome :)
Thanks it's very fascinating
Thanks bro this was helpful
this was really helpful!
Awesome - glad you found it helpful Josh.
Brilliant. Thanks
You're very welcome.
love your video, your are so passionate about math!
Thanks - and you know it.
Very helpful explanation, thank you! So can we say that in a week it's a modular 7 arithmetic? :D
Yes, absolutely :)
Love your channel so much . Now I can tell my friend to stop bragging of how smart he is, because I understand this 😂 😌
Awesome - happy to help!
Shouldn't those be congruence symbols, not equalities?
Excellent video Tom, pretty good 👍. Greetings for Mexico
Thanks Emiliano - and hello Mexico! Y'all stay safe.
@@TomRocksMaths hahaha Tom that sounds like The Purge. But thanks u to over there. Stay with the t-shirt on.
Thank you very much, you are amazing 🙌
You're welcome 😊
Good job!
Thanks Priyavart.
43 mod 10 = ?
Answer is 3 but I didn't get to know how at first .
Here RHS is not known . according to me there are four 10s and three is left out .
10+10+10+10+3=43
Ignoring four 10s , and considering 3,
So answer is 3 .
Am I correct ? Did the answer explanation match ?
Perfect :)
@@TomRocksMaths Thank-You
What an absolute legend
Thanks Justin!
After doing 3years of maths did understood now.
Thank You so much!
You're welcome!
....the clock is always an elegant, effective illustration of very critical aspect of modular math; C Y C L E S !
Very true.
thank you so much !!!
You're welcome!
Dude is the bob Ross of mathematics!
Why remainders have this "cycle/loop" nature ?
thank u so much. number of hours in earth from its existance≡ (1/2/3/4/5/6/7/8/9/10/11/12) mod 12 best wishes for your growth
You explained like it's so easy to do😂 and yes! It makes me do it easily! Thank you
Glad it helped Katherine :)
@@TomRocksMaths all thanks to you😊
Wow this guy is great
Thank you!!! This helped me so much!!!
You're very welcome Cindy!
very helpful, came from UNIQ.
Glad you found it helpful - and welcome to the channel :)
Hi tom, i understood this but how does this relate to congruency?if a is equivalent b in modulo n, is this equivalent to saying a is congruent to b in modolu n
yes they're the same thing!
Great Video :D!
Thanks Snake!
very helpful