The most clear explanation of this topic on KZread! 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 KZread.

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

Fantastically explained. Need some more examples.

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

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.

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.

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

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

@prabhusubramanianlectures4307

4 жыл бұрын

Glad it helped!

Great work brother

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

@prabhusubramanianlectures4307

4 жыл бұрын

Wow, thanks!

Thank you for the lesson, it helped a lot

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!

@whatsup968

4 жыл бұрын

@Prabhu Subramanian Thank you!

Love you sir, you are genius

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

sir this is soo good thank 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...

Thanks for this video.

Great explanation

Very good explanation sir

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.

Thanks a lot

superb explanation

Thank you so much for this. Indians always works!

Tank You Very much

lovely video

thank you

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

@MaheshKumar-vi7pi

Жыл бұрын

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

great explanation 🎇🎇

good explanation sir

its too beneficial

how to calculate multiplicative inverse of 13 mod 40

Think you

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

Thankkkkk yoouuuuu

Sir ur genius love❤ u

@gamingboy7426

3 жыл бұрын

Sir, suppose they have given two number example (13, 21), how to calculate Multpllicative universe

sir can 10 mod 13 be solved??

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

Excellent

@prabhusubramanianlectures4307

4 жыл бұрын

Thank you! Cheers!

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

@prabhusubramanianlectures4307

4 жыл бұрын

Yes. In a different way I have explained

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

@MaheshKumar-vi7pi

Жыл бұрын

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