Finding the Multiplicative Inverse using Extended Euclidean Algorithm Example 1 HD 

The most clear explanation of this topic on RU-vid! Thank you very much.

Self referential note: MI using Extended Euclidean Algo starts at 3:50

Thanks for the explanation! Much easier to follow than the other ones on RU-vid.

Just like previous posts, this has been "fantastically explained"!

Fantastically explained. Need some more examples.

Great session with full of energy :) I also watch Vidya Guru sessions because of their good content competitive exams videos. Those remained so helpful in many SSC exams.

After searching Many videos and lectures i found your video And finally i got it. Many many thanks dear

It's good you explain what the use is of a modular inverse. Other tutorials just go straight to EEA.

Very good lecture sir. Thank you very much sir subramaniam.

Thank you for the lesson, it helped a lot

Great explanation

sir this is soo good thank you very much🙌

Thanks a lot

superb explanation

Very good explanation sir

Thanks it really helped in my open book exam. You basically gifted me 15 of the 100 marks.

Thanks for this video.

Wow! I think this is the best explained MI video I found on the internet!

Tank You Very much

is there is any method for finding for general derivation of multiplicative inverse of special moduli set like 2n+1, 2n....

clappings 🙌🙌🙆fantastic...

thank you

Thank You Sir Now I understood! 🙂

I legit think God sent me here This is explained so much more simply here than in my textbook I have a midterm exam coming up this week so thank you sir!

lovely video

Love you sir, you are genius

Great work brother

its too beneficial

good explanation sir

great explanation 🎇🎇

Think you

Thank you sir. It's great help for me 🙏

Here's an easier method, Write the continued fraction representation of 3/17 = [5, 1, 2] (showing the partial quotient)partial nu. Underneath write the convergents = [ 1/5, 1/6, 3/17] For an odd number of partial quotients (we have 3), the answer is the denominator to the left of the rightmost denominator, a 6. Correct since 3 * 6 = 1 mod 17.

Thank you so much for this. Indians always works!

Well explained!.. Thankyou so much sir. Sir could u plz do a video for this 👇🏻👇🏻👇🏻question too..? Plzz... Multiplicative inverse of 60 mod 97 using the same method applied here.

Sir ur genius love❤ u

Excellent

Thankkkkk yoouuuuu

how to calculate multiplicative inverse of 13 mod 40

Sir, can you please guide: how to find multiplicative inverse of a one equation question like: 5 mod 31. Please

Please put some problems from ag school from chapter exponent and powers

sir can 10 mod 13 be solved??

Good explanation.. But is this really EXTENDED Euclidean Algorithm?

mod 17 3X=1 ------------(1) 20X=1 ----------(2) (1) X7 21X=7 ----------(3) (3) - (2) X=6 Ans. 6