Тёмный

What is Modular Congruence? | Congruence Modulo n, Modular Congruence Definitions 

Wrath of Math
Подписаться 127 тыс.
Просмотров 21 тыс.
50% 1

What is modular congruence? What is congruence modulo n? We go over two equivalent definitions of this relation in today’s math lesson! This is your first step to learning modular arithmetic, and can serve as a great gateway to learning about equivalence classes as well! We also briefly discuss modular congruence with negative numbers in the video lesson.
We say that a is congruent to b mod n ( written a ≡ b (mod n) ) if and only if a and b have the same remainders when divided by n. So for example, when we divide 12 by 5, we have a remainder of 2. When we divide 27 by 5, we also have a remainder of 2. Thus, 12 is congruent to 27 mod 5. We can observe the remainders by noticing 12 = 5*2 + 2 and 27 = 5*5 + 2. See? They both have remainder 2!
An equivalent definition says that a is congruent to b mod n if and only if n divides a - b, which means that a - b is an integer multiple of n. For example, 20 - 2 = 18, and 6 divides 18. Thus, 20 ≡ 2 (mod 6).
Also, it is important to note that modular congruence is an equivalence relation! Just like “equals”! This means that modular congruence is reflexive, symmetric, and transitive!
I hope you find this video helpful, and be sure to ask any questions down in the comments!
********************************************************************
The outro music is by a favorite musician of mine named Vallow, who, upon my request, kindly gave me permission to use his music in my outros. I usually put my own music in the outros, but I love Vallow's music, and wanted to share it with those of you watching. Please check out all of his wonderful work.
Vallow Bandcamp: vallow.bandcamp.com/
Vallow Spotify: open.spotify.com/artist/0fRtu...
Vallow SoundCloud: / benwatts-3
********************************************************************
+WRATH OF MATH+
◆ Support Wrath of Math on Patreon: / wrathofmathlessons
Follow Wrath of Math on...
● Instagram: / wrathofmathedu
● Facebook: / wrathofmath
● Twitter: / wrathofmathedu
My Music Channel: / seanemusic

Опубликовано:

 

1 фев 2019

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 46   
@maxien101
@maxien101 3 месяца назад
I wish i found this before my exams! Absolutely golden explanation
@mandy7212
@mandy7212 3 года назад
This is the most clear and concise intro to mods I have found on YT. I will definitely be sharing this with my students. Keep up the great instructional content!
@WrathofMath
@WrathofMath 3 года назад
So glad you found it clear, thanks a lot! Looking forward to making more lessons on the topic!
@shambo9807
@shambo9807 8 месяцев назад
Thanks for this clear explanation of how it works for negative numbers. I finally understand it now.
@rajendranchockalingam1079
@rajendranchockalingam1079 Год назад
Good morning sir Excellent explanation I am from Tamil Nadu Thank you sir
@johnw1368
@johnw1368 3 года назад
Thank you! Could you please do a video on solving congruence equation? Ex , ax= b (mod") etc etc. But could you please break it down very easily?
@srinidhinagendran7523
@srinidhinagendran7523 4 года назад
Thanks for clean explanation
@luisdfernandez2601
@luisdfernandez2601 3 года назад
On 3:50 do you mean a = 14 and b = 8? Because on the previous example you used the same numbers as an example but got a positive 2 as a remainder and here you get a -2 as remainder.
@daisyg509
@daisyg509 Год назад
Thank you SO much
@yousufh5053
@yousufh5053 4 года назад
thank you, very useful and it helps alot . .
@WrathofMath
@WrathofMath 4 года назад
Thank you for watching, I am glad it helped! Let me know if you ever have any lesson requests!
@user-is8fw2je1y
@user-is8fw2je1y 3 года назад
Hi, I have doubt. There are 2 ways of solving modulo systems I guess. So my professor gave an example: 14 congruent 2 (mod 12). We solved it like: 14-2=12, and 12 would be an integral multiple of m. But when I tried the same problem with your method, I am getting different remainders for both. Why is that?
@mandy7212
@mandy7212 3 года назад
14 = 1(12) + 2 2 = 0(12) + 2 I read this mentally as: "14 is 1 multiple of 12 plus 2", and "2 is 0 multiples of 12 plus 2". In both cases, the remainder is 2. Thus, 14 ≡ 2 (mod 12). Note it is the case that 12 | (14-2) or 12 | (2-14)
@janabaijadhav7490
@janabaijadhav7490 3 года назад
Best explaination, Thank you sir
@WrathofMath
@WrathofMath 3 года назад
Thank you!
@rochellealonzo8519
@rochellealonzo8519 3 года назад
Thank you so much sir. Very helpful😇
@WrathofMath
@WrathofMath 3 года назад
Glad to hear it! Thanks for watching, Rochelle!
@saritha9623
@saritha9623 4 года назад
Good explanation. Thank u sir.
@WrathofMath
@WrathofMath 4 года назад
Glad it helped! You're welcome and thanks a lot for watching!
@ahmedmghabat7982
@ahmedmghabat7982 3 года назад
3/n(n^2 -1) ? For every n natural Actually i had it in my previous exam to answer if its true or false . Please can you solve it?
@julventuba1515
@julventuba1515 4 года назад
Can you give example of this theorem? if ca and cb is congruent mod n, then a and b congruent modulo n/d where d= gcd (c,n)
@WrathofMath
@WrathofMath 4 года назад
Thanks for watching! Sure, let c = 12, a = 3, and b = 7. Then ca = 36 and cb = 84. Then we have a few options for n if we want congruence mod n. Let's pick n = 8. Notice 36 is congruent to 84 mod 8. Then, d = gcd(12, 8) = 4. Thus, the theorem tells us 3 is congruent to 7 mod 8/4. Simplifying we have 3 is congruent to 7 mod 2. Indeed this is true, as 7 - 3 is divisible by 2, or equivalently, they both have remainder 1 when divided by 2.
@julventuba1515
@julventuba1515 4 года назад
Thank you so much! Big help
@RonUS2009
@RonUS2009 3 года назад
Good job.
@WrathofMath
@WrathofMath 3 года назад
Thank you, Ron!
@jairoselin5119
@jairoselin5119 3 года назад
Helpful ❤️
@WrathofMath
@WrathofMath 3 года назад
Glad to hear it, thanks for watching!
@srinidhinagendran7523
@srinidhinagendran7523 4 года назад
I want to know about thereom on this topic
@WrathofMath
@WrathofMath 4 года назад
Thanks for watching, Murali! Is there a particular theorem you have in mind you'd like to see?
@luisdfernandez2601
@luisdfernandez2601 3 года назад
I have to laugh. I kept asking myself "how did he get 4 as a remainder??" And then, I remembered we're dealing with whole numbers and that 6 can't go into 4 therefore it is 0 and the remainder is the actual 4. It had me scratching my temple for a minute or two LOL
@madihachaklader2378
@madihachaklader2378 Год назад
I thought it’s only me… as for a moment I thought it’s 0.6 then I realised it’s 0 multiplied with 6 hahah
@universalponcho
@universalponcho 2 года назад
Very useful
@WrathofMath
@WrathofMath 2 года назад
Glad to hear it, thanks for watching!
@oshawastaken
@oshawastaken 3 года назад
bless got my final in 2 weeks
@WrathofMath
@WrathofMath 3 года назад
Good luck! Thanks for watching and let me know if you have any questions!
@exercisefitnesshealth8965
@exercisefitnesshealth8965 4 года назад
thank you for the video, sir. how about this? Find x: 1. 8 = x (mod 3) 2. x = 38 (mod 4)
@OMPRAKASHVerma-dh6ve
@OMPRAKASHVerma-dh6ve 4 года назад
I think x might be equal to 38
@fergusjohnson3788
@fergusjohnson3788 3 года назад
@@OMPRAKASHVerma-dh6ve when we divide 8 by modulus 3 (8:3), then we obviously get the result with a remainder 2. So, to get 8 back, we have to multiply 2 by 3 and finally add 2 (8=2*3+2). To get X, we use the same division strategy when it comes to dividing x by 3 (x:3). As b=x, a=8, and c=3, we have to find the number as when it is divided by 3 the remainder should exactly be 2. So, it is 38. PROOF: 38=12*3+2.
@OMPRAKASHVerma-dh6ve
@OMPRAKASHVerma-dh6ve 3 года назад
@@fergusjohnson3788 ooo yes
@mm-wm6uh
@mm-wm6uh 3 месяца назад
1:40 how you get 0 on 4=0.6+4
@jamaicarabino7897
@jamaicarabino7897 3 года назад
Nice
@WrathofMath
@WrathofMath 3 года назад
Thanks for watching!
@d12kiem7
@d12kiem7 3 года назад
wiping my tears....still trying to get it
@WrathofMath
@WrathofMath 3 года назад
Do you have any questions I can help clear up?
@koshka02
@koshka02 2 года назад
My prof is so garbage compared to these videos My prof doesn't explain anything, and I'm genuinely trying my hardest to learn then I go here and you explain it so simply My tuition should be going here, not my prof
@WrathofMath
@WrathofMath 2 года назад
I'm glad to help! Thanks for watching and let me know if you have any questions!
Далее
(Abstract Algebra 1) Congruence Modulo n
15:11
Просмотров 137 тыс.
Intro to Relations | Discrete Math
12:53
Просмотров 9 тыс.
Кто быстрее? (GTARP)
19:19
Просмотров 453 тыс.
МАРИЯ ГОЛУБКИНА О БАБУШКЕ #shorts
00:43
Congruences & Modular Arithmetic ← Number Theory
12:26
Modular exponentiation
11:37
Просмотров 282 тыс.
Basics of Modular Arithmetic
18:39
Просмотров 58 тыс.
Number Theory | Congruence and Equivalence Classes
9:50
Hilbert's Curve: Is infinite math useful?
18:18
Просмотров 2,2 млн
The Art of Linear Programming
18:56
Просмотров 637 тыс.
Solving linear congruences
33:12
Просмотров 9 тыс.
Кто быстрее? (GTARP)
19:19
Просмотров 453 тыс.