Everytime i search for math related lecture in English i always have a thought my English must be poor that's why i am not understanding but when i see your lecture my all doubts gets cleared.
The reality is that most teachers doesn't have command over English language. So they are not able to explain the the things. Also many don't know how to teach
Oh, I get it now. For any of you struggling, its just the notation that is "unintuitive". if you see 1 mod 5, its not literally 1 mod 5, its 1 (mod 5). So 1 "when you mod by 5". Instead of 3*n = 1 (mod 5) i think the simplest way of understanding it is putitng it in "normal" notation. (3*n) mod 5 = 1 6 mod 5 = 1, so n=2
thanks bro, i have been watching videos and reading books for multiplicative inverse in modulo and all the time it was the REMAINDER that matters. LOL i thought it was the quotient that should be equal to 1 haha thanks a lot!
Great video, thanks!! I was sitting here scratching my head on why my crypto book kept telling me the multiplicative inverse of 3 is 9 and not 1/3 until i found your video. Mod, gotta remember that mod
Your videos have been very helpful, much appreciated! 1 issue though, I believe [ a mod b ] where a is less than b is equal to a. (ex. 2 mod 5 = 2, because 2 is less than 5 and therefore the remainder). You mentioned 2 mod 5 = -3, so you then perform 2 x 3 = 6 then 6 mod 5 = 1 which is different from 2 mod 5 being equal to 2.
4 * 4 = 16 here incase if we divided 16/5 thn the reminder would be 3.2 not the 1 and since the mod is 5 we can do this by 4*1 = 4 by this we get reminder as 1
ty, this is EXACTLY what I didn't understand about these things. So from what you said, a relative prime will never be two even numbers, but will always be either even/odd or odd/odd. Clearly, sometimes even those won't work, but we will never have two even numbers which are relatively prime.
When you say 2 into 4 it means division. When referring to multiplication you should use the word 'times' instead. I was confused through certain parts of the video. Great video though; I now understand.
Can there be more than 1 multiplicative inverse? Like for 3(mod 5) you said multi inverse is 2. Even 7 can be it's inverse right, because 7*3=21 and 21 mod 5 = 1.
You mentioned in a few parts about -1 as remainder. Would you mind explaining how come there can be negative remainders? Shouldn’t remainders only always be positive?
Relatively prime and prime are different. Two numbers are relatively prime if they don't have a common factor. 4 and 5 don't have a common factor other than 1 so they r called relatively prime
Everytime i search for math related lecture in English i always have a thought my English must be poor that's why i am not understanding but when i see your lecture my all doubts gets cleared.
❤
The reality is that most teachers doesn't have command over English language. So they are not able to explain the the things. Also many don't know how to teach
Oh, I get it now. For any of you struggling, its just the notation that is "unintuitive". if you see 1 mod 5, its not literally 1 mod 5, its 1 (mod 5). So 1 "when you mod by 5".
Instead of
3*n = 1 (mod 5)
i think the simplest way of understanding it is putitng it in "normal" notation.
(3*n) mod 5 = 1
6 mod 5 = 1, so n=2
I was trying to answer questions in Number Theory in the Brilliant app, and I just coundn't figure them out until I watched you video. Thank you!
Thank you!!! I couldn't wrap my brain around this concept and you explain it so well!!!
Thank you! Finally I understood how calculate multip.inverse
Great explanation! Thanks!
This really helped out
Thank you sir! You slayed this.
Chill explanation
Thanks 🙏🏻
thanks bro, i have been watching videos and reading books for multiplicative inverse in modulo and all the time it was the REMAINDER that matters. LOL i thought it was the quotient that should be equal to 1 haha thanks a lot!
thank you sir best explaining
Great video, thanks!! I was sitting here scratching my head on why my crypto book kept telling me the multiplicative inverse of 3 is 9 and not 1/3 until i found your video. Mod, gotta remember that mod
Your videos have been very helpful, much appreciated! 1 issue though, I believe [ a mod b ] where a is less than b is equal to a. (ex. 2 mod 5 = 2, because 2 is less than 5 and therefore the remainder). You mentioned 2 mod 5 = -3, so you then perform 2 x 3 = 6 then 6 mod 5 = 1 which is different from 2 mod 5 being equal to 2.
if you subtract 5 from 2 you get remainder as -3 as 2-5*1 is -3 it's on the other side of positive modulus...
Thank you so much sir . I watched many videos about modular inverse, but didnt understand. I understood very easily from your video. Thank you so much
man you are the BEST EVER!
4 * 4 = 16 here incase if we divided 16/5 thn the reminder would be 3.2 not the 1
and since the mod is 5 we can do this by 4*1 = 4 by this we get reminder as 1
see properly reminder is 1 ur being mistaken b/w reminder and quotient
ty, this is EXACTLY what I didn't understand about these things. So from what you said, a relative prime will never be two even numbers, but will always be either even/odd or odd/odd. Clearly, sometimes even those won't work, but we will never have two even numbers which are relatively prime.
Great video
Thanks for your efforts ♥
For large numbers, use :
a^-1 mod p = a^(p-2) mod p, where p is prime.
Is this a theorem or just a simple formula?
@@sayharshu this is Fermat's Little Theorem
@@Mehraj_IITKGP thankyou brotha :)
Thank you so much!
You are the best!!! ❤️
thanks! But could you tell please, why do we use it?
When you say 2 into 4 it means division. When referring to multiplication you should use the word 'times' instead. I was confused through certain parts of the video. Great video though; I now understand.
simple explanation
Great, Explanation
Thanks for the subtitles.
Can there be more than 1 multiplicative inverse?
Like for 3(mod 5) you said multi inverse is 2.
Even 7 can be it's inverse right, because 7*3=21 and 21 mod 5 = 1.
Wonderful Explanation 🔥🔥
for small numbers we can find it out easily what about for large numbers how to find can you give me some tips for that
Thanks!
Thank you :)
I can not wait for the next lesson.
you are the best
Nice one!
Sir I have an assignment ,can you help me?
You mentioned in a few parts about -1 as remainder. Would you mind explaining how come there can be negative remainders? Shouldn’t remainders only always be positive?
when you have x=-1 mod n that is same as x=n-1 mod n
even if we get -ve remainder it is simply = to the inverse of it.
Thank you
Good job BRoz NEZXT LV
when can we expect a video of DES Algorithm?
but how do we calculate it when we have large numbers?
he said that at the end of the video. by extended euclidean algorithm
I know two ways for finding inverse
Euler's theorem
extended Euclidean algorithm
thanks man
hapo safi nimeelewa sana mkuu
Bro what is 24 x ? = 1 mod 26
Gcd (24,26)=\=1 inverse will not exist in this case
thanks sir i did not uderstand anything
next time write it out. i got it when I went back
4 is not prime 🙄, how is it relatively prime of 5?
Relatively prime and prime are different. Two numbers are relatively prime if they don't have a common factor. 4 and 5 don't have a common factor other than 1 so they r called relatively prime
Thakns lot
Common factor?
@@sakthi_chesz GCD
i can barely understand you.
You are just brute forcing to find inverse. That is not how we do mathematics
Then how is it done correctly
😮
Not best better explain matalb tatti
❤️❤️❤️
whos here for cs70🤣🤣
begairat !!!
Pajeets, man
based