What does a ≡ b (mod n) mean? Basic Modular Arithmetic, Congruence
Vložit
- čas přidán 21. 04. 2018
- Basic congruence introduction in modular arithmetic. We will go over 3 ways to interpret a ≡ b (mod n), and you will see this in a number theory or a discrete math class. Learn how to solve congruence, subscribe to @blackpenredpen
💪 Support this channel, / blackpenredpen
What donuts are those?
The heart attack kind of donuts.
I meant to ask where they are from
Heaven
Look like Krispy Kreme.
Kevin got it!!
Some teachers in universities: 2h lecture
blacklenredpen: 6minutes
Too right mate, plus we can repay bprp's videos as often as we like.
He is just explaining the procedure not the theory, origins or proof
@@aymenchamia7470
I do, and he is 100% right.
Our lecturer is extremely smart and knowledgeable no doubt, but he just can’t explain the procedures and concepts in a simple enough way for anyone to understand.
It took you around 3 minutes to say what I needed to know, the same thing that my professor unsuccessfully tried to explain in one hour. Thank you so much
same
so fucking dmn right
True
True. I am right now going through the same experience.
I wonder which professor took one hour for congruence 😅then for sure your whole syllabus time schedule gonna wasted..., ഒരു മയത്തിൽ ഒക്കെ ആവം കേട്ടോ ...
I am a senior math and CS major, I have used modulo almost as much as I’ve used pi and I have always been confused by congruency. No one has been able to explain congruency more clearly and digestible than you. Thank you!
Basically you throw out the quotient and keep the remainder. It's periodic math like the roots of a trig function.
30min trying to understand this congruence with my book .
And this man make me understand it just in 1:46 seconds
I wanna cry .
Why professor make life complicated whyyy ...
THANK YOU SO MUCH.
I really respect you 🙏🙏
PLEASE MORE MODULAR ARITHMETIC! You're the best
Sergio H will do!!
I watch 7 videos of about 20 minutes about modular arithmetic and didn’t understand anything but your 6 minutes video made me understand. I don’t know what to say
Why is this video 2Pi minutes long ?
It's Tau
Burn!
2π=6
@@ansper1905 😑😑😑3.14159265358979323846264338
...
In can not be 3😐
@@sieger358 tell that to engineers
Finally I've been looking for a decent explanation for this for about an hour! Years ago when I was in school we never learned this and 'remainder' was only referred to when you were doing sums by hand, the remainder would be the next 10, 100 or 1000 etc. from your addition, I didn't see it as any other sense!
Your ability to change the marker you’re writing with so fast is amazing...
I read this comment and watched the video again just because of this. lmao. Wow! You were not joking.
just had a great and clear understanding this was the lecture i needed thanks a lot mate!!!
Omg saving my grade once again. God bless you. Wish you had a patreon...
For those of you watching this in the future:
He does!
www.patreon.com/blackpenredpen
Having test next week, found this video this week. Thank you 😊 Always wanted to know the interpretation of the congruent notation.
You should do more number theory, especially stuff like Euler’s totient function (since it’s my favorite subject ;D)!
I will. In the meantime, you can check out Max's videos here: czcams.com/channels/P-ZCMz7olJPUI78b_bQrvQ.htmlvideos?disable_polymer=1
Thanks blackpenredpen for teaching us this!
Lovely explanation. Helped me finally visualize this concept before you even did the examples.
Eres un crack! Y todo lo digo en español, porque hasta en Latinoamerica disfrutamos de tus videos; en serio, aprendo muchísimo! Thank you!
Thank you professor BlackpenRedpen I appreciate you this amazing lesson.
I spent an hour trying to understand it from my book... 6 minute video is what i needed.
yoo great tutorials/lessons love ur stuff keep em coming !!
When I took abstract algebra, I found
a ≡ b (mod n) quite confusing. The meaning seems to be
a (mod n) = b (mod n), but equivalence must mean more than this.
I learned more from this guy than from my entire math class xDDD
My math teacher made this look like rocket science...
same hahahahahahahhaha
thanks for your vdo you saved me from an algorithm course
it looked me quite a long time to understand what is meant by a=b (mod n)
In Beachy 4th Ed., the authors write " a ≡ b (mod n) if and only if n|(a - b)." The proof goes in both directions, so you see that n|(a -b) does indeed show that a/n and b/n have the same remainder. I just finished going over this proof again for my abstract algebra class. Very simple when you do the proof both ways.
Thank you so much! This video really helps me with number theories
Excelente me salvaste de leer mucha álgebra, continua con el álgebra moderna que es bien interesante al igual que el calculo
Congruence relations and their corresponding quotient sets (and groups, and spaces, etc) are some of the richest topics in maths, and modular congruence is one of the most useful and ubiquitous ones.
Dude i normally watch ur vids for fun but now i actually need help and i come back to ur channel😂
thank you so much! you are amazing to explain the modular arithmetic! thank you thank you!
You make math so entertaining :)
This video was awesome! I'm so glad I found your channel. You have a new subscriber here.
Your explanation is amazing. It is way better than my professor's! Thank you so much!
C# exercises led me here... and I ain't even mad. Awesome video!
this is the best number theory explanation, well done
Amazing explanation, just what I needed
I just keeping learning a lot from you.
Greetings from Mexico!
Can you talk about set theory or keep doing number theory?
Silvestre Frijol Cruz thank you!! I will focus on number theory, probability and combinatorics and calc.
Congrats on the 100k!!
U made it so easy ! thanks @you
do you have my schedule or something ?? how do you always upload what I need. thanks man !
OH wow!! ; )
Very well explained. Thank you so much.
This is by far the best explanation....IMO!...here I come....!!!!
thanks!
Thanks for the refresher. I hardly understood this when getting my undergrad degree and now that im working on my masters it came back to haunt me 🤣
I just want to say thank you man, you really helped me out
😃
Great video, loving all the number theory :)
Thanks!!!
(by wikipaedia) Actually, the first claim is the most correct one, same remainder when a and b are divided by n,
a = kn + r, b = jn + r then we have a - b = (k-j)n + 0 which means that n | a - b (the last claim). If we add b to both side,
a = Kn + b by setting K = k - j.
edit: depends on variables to choose the most suitable one.
bro you really came through i was having trouble understanding that claim
thankyou so much!! this really helped a lot 🥰🥰
Amazing video! Thank you!
Couldn’t learn this my whole life until I saw this. Damn please complete series on modular arithmetic please sir.
Thank you very much. Very well explained.
Straight to the point.. thanks
Good video. It helped a lot. Thanks!
Great video, would love some more examples to cement how to use :)
Thanks a lot, brief and effective
Thanks man I was bit confused in equivalence relations when this came up , turns out I was interpreting it in a wrong way
Can you please do a video on multiplicative inverse modular arithmetic? I fully understand the basic modular arithmetic but finding the multiplicative inverse in modular arithmetic just keeps going over my head!
Thanks a lot man. That helps a lot!
thaaaaaaaaaaaaank you , amazing , I love your explanation
Great video as always !
thanks for this video helped me a lot.
Very helpful! Thanks!!
great teaching🥰 I finally understand 👍
It was very helpful.Nice video.Keep uploading more videos.....
Thanks a ton, man! 👌👌
Thanks that was helpful to me.
I would attend every class of this guy 😭👍💓
No one told me this! And neither I could understand anyone but now I can
Thank you for explaining this in a straightforward manner, I FUCKING LOVE YOU!
I have actually seen (mod 1) used. It was to denote the fractional part of a non-integer, but non-integers aren't being considered here
Excellent explanation!
You are great.
Thank You Very Much
Wow I wish I found this in my first year. It would've saved me hours of lengthy abstract examples and confusion. Why do universities make things so unnecessarily complicated sometimes 🙄.
Helpful man thanks ; )
Thank you for this!! :DD
: )
Thanks it's so nice and useful 👏👏👏
u are the best professor..
Thank you so mucj for this video! I was just watching an IMO prpblem solving video and i couldn't help but wonder what "mod(n)" meant.
very good video and very good explanation!
Thank you you are talented keep it up good work
mod 1 is quite useful in programming, i would assume some special handling is written for it but it turns out useful
: D this is exactly what I taught my students.
: )))))
This is really helpful! Where is the number Theory section in your channel
that was so good. thanks
U just explained a concept which my maths tutor took 35 minutes to explain in under 10 minutes.
Kudos to you sir!!
Smooth explanation
Please keep uploading Number Theory videos!
ok!!!!!!!!
Very good, thank you!
Crystal clear!
does anyone know what the reverse of modular arithmetic is? Im decrypting and cannot find anything on it
THANK YOU SO MUCH!
excellent explanation
Great video!
thanks this helped me pass my test
Thank you very much
Thank you so much
Thank you for this video
How can you solvw the equation -17 mode 7
hey man how did you derive the 2 equation i am having a lot of trouble understanding that . how did you remove mod from the equvalence and all that
im doing proofs with modular congruence and my head is exploding
Thanks for telling me that the brackets were important.
I was just subtracting.
Is it necessary to state that a, k, n and b are all integers? For example, would I need to write that if I was asked to give these definitions on a test?