Multiplicative Inverse

[@mirzashemin5556]

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.

[@AaryaDeshmukh-e6l]

❤

[@NoobsDeveloper]

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

[@iosonoi.7132]

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

[@Ion-Luca-Caragiale]

Yeah, at first when I saw that somewhere else, was confusing af

[@jamm9848]

Thank you so much for adding the other example at the bottom for 5 and 10 not being multiplicative indexes. It really made it clear to me

[@juliettetworsey3060]

Great explanation! Thanks!

[@isirlasplace91]

Thank you!!! I couldn't wrap my brain around this concept and you explain it so well!!!

[@imRJD14]

Chill explanation Thanks 🙏🏻

[@taiwojoshua4787]

This really helped out

[@The2000kittykat]

Thanks!

[@nesoacademy]

Thank you :)

[@The2000kittykat]

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!

[@Бейнесабақтар-и2н]

Thank you! Finally I understood how calculate multip.inverse

[@Ahmedtalib1]

man you are the BEST EVER!

[@sophiesaj]

Thank you sir! You slayed this.

[@jawherdhaou617]

Thanks for your efforts ♥

[@RAMANKUMAR20BCE193]

Great video

[@Limegreenslice]

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

[@chi_naemerem]

Thank you so much! You are the best!!! ❤️

[@sadiashaheen7361]

Wonderful Explanation 🔥🔥

[@ahmadsahilainy9106]

thank you sir best explaining

[@letsimage]

thanks! But could you tell please, why do we use it?

[@nz_ncht9660]

what about some negative numbers or fraction number??

[@srchoudharyy]

Great, Explanation

[@Aaronmx12]

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.

[@JatinSinghMehra-q1u]

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...

[@Eneri_]

ur the goat bro holy

[@DouglaStaks]

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!

[@chamin111]

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

[@utilizator1701]

I can not wait for the next lesson.

[@Foruni-hw6uz]

Nice one!

[@Mehraj_IITKGP]

For large numbers, use : a^-1 mod p = a^(p-2) mod p, where p is prime.

[@Fr_Epic]

Is this a theorem or just a simple formula?

[@Mehraj_IITKGP]

@@Fr_Epic this is Fermat's Little Theorem

[@Fr_Epic]

@@Mehraj_IITKGP thankyou brotha :)

[@SequinBrain]

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.

[@vamppyre]

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.

[@lindeanchuang8115]

Thanks for the subtitles.

[@josiassunzu9252]

hapo safi nimeelewa sana mkuu

[@KavyaS-m6r]

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

[@uday_mahaan]

see properly reminder is 1 ur being mistaken b/w reminder and quotient

[@hannanhub1717]

simple explanation

[@priyankakonduru7089]

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

[@faisalhisham4685]

you are the best

[@SachinKumar-fd2kg]

Sir I have an assignment ,can you help me?

[@mauthoormotasim6332]

but how do we calculate it when we have large numbers?

[@nitac2237]

he said that at the end of the video. by extended euclidean algorithm

[@pigslave3]

Thank you

[@Black-xy4pj]

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.

[@rcrist2221]

thanks man

[@vEr5eX]

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?

[@barackobama5867]

when you have x=-1 mod n that is same as x=n-1 mod n

[@iLieOfficial]

even if we get -ve remainder it is simply = to the inverse of it.

[@shashanks8453]

when can we expect a video of DES Algorithm?

[@addy405]

Good job BRoz NEZXT LV

[@purushothamans5527]

Bro what is 24 x ? = 1 mod 26

[@SAMIULLAHPARRAY-h1x]

Gcd (24,26)=\=1 inverse will not exist in this case

[@iramshahzadi8297]

[@holyshit922]

I know two ways for finding inverse Euler's theorem extended Euclidean algorithm

[@mr.a8130]

thanks sir i did not uderstand anything

[@alexsedgwick4546]

next time write it out. i got it when I went back

[@rajeshprajapati1851]

❤️❤️❤️

[@ToanPham-wr7xe]

😮

[@abdulhaq5263]

4 is not prime 🙄, how is it relatively prime of 5?

[@sanjana6931]

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

[@sakthi_chesz]

Thakns lot

[@sakthi_chesz]

Common factor?

[@Ghost_Rider_54]

​@@sakthi_chesz GCD

[@shailmurtaza9082]

You are just brute forcing to find inverse. That is not how we do mathematics

[@GotchunUmbra]

Then how is it done correctly

[@jassonHoward]

whos here for cs70🤣🤣

[@gggamingboyz]

Not best better explain matalb tatti

[@hassanzafar4849]

begairat !!!

[@kimkarlson7820]

Pajeets, man

[@DepressionandMemes]

based