wow I wish I found this months ago, I've watched TONS of videos on this topic. This was easier than every single one of them by a mile. Thank You!

you are an ANGEL sent from aboveeee

Sir, I wanted to know that till when the course playlist will be completed? Will it be completed by November end?

Sir I am getting inverse of 23 mod 26 as 11 .My value in T1 after the operation is -15 so when I add it to 26 I get 11.But the inverse actually is 17.What I am doing wrong??

@ghdocker9427

9 күн бұрын

Check your solution. you will get -9, and then you'll add it to 26 and that is 17

while trying with 91 mod 12 the answer is not coming to 7 which is the MI

What if multiplicative inverse comes i negative. As id did the ML inverse of 89 and 34 , the inverse was -34 whereas the answer is 55 which is obtained by adding 89 and -34. Do we need to add T1 and T2 if the multiplicative inverse is in negative form??

@ta-seenjunaid1097

Жыл бұрын

I think your point is correct.

@testaccount525

Жыл бұрын

yes

@technical-sensei

Жыл бұрын

At ther end of video, it is metioned if M.I comes negative, add it with n, like in yr case. (-34+89) = 55. Watch till end.

multiplicative inverse of 42 mod 5 is 3 but the EEA gives 17....why is that?

@kathirvel.be18

7 ай бұрын

Absolutely correct.

hi sir ☺. please complete DBMS subject , Java. I had them in my current semester. please 🙏🏼 🙏🏼 🙏🏼 🙏🏼 🙏🏼 🙏🏼 complete these subjects sir.please please please please please

❤️❤️❤️

please complete discrete mathematics and datastructures ASAP

Sir, upload videos in FRENCH Language. Neso Academy - Languages channel.

The main flaw of this explanation is that saying you put the greater value in A (A > B). By this logic, you're basically saying that we should get the same answer for the multiplicative inverse of 26 mod 11 (which would be 3) and the multiplicative inverse of 11 mod 26 (which is 19), and this is incorrect. This made me make a big mistake smh

@vitaminprotein2217

4 ай бұрын

exactly,but can u provide sol how to solve these qs?

@temexmichael1289

4 ай бұрын

@@vitaminprotein2217 Idk why whenever I reply to you with the link I used it's getting deleted

@vitaminprotein2217

4 ай бұрын

@@temexmichael1289 yes u can't send links in chat Instead name me the video name

@temexmichael1289

4 ай бұрын

@@vitaminprotein2217 It's a small channel called "Good Explanation", search for extended euclidean algorithm good explanation, may be you'll find it that way

this method is not success with large numbers. 790 mod 121 try this. it is not success from this method. this is perfect for small numbers like 11 mod 26.

@ghdocker9427

9 күн бұрын

it works you will get T1 value of -17 and the you add to your initial A value which is 121 and you get 104

@lochaniperera7285

9 күн бұрын

@@ghdocker9427 Then how can I know the correct specific stop point to get the T1 value. Then different end points for different questions.. :/

@ghdocker9427

9 күн бұрын

@@lochaniperera7285 when B value gets to 0 you stop and whatever value you have at t1 is what you work with. That's where you can apply "if T1 is negative then add to initial value of A." iand that is your answer else a positive T1 value, no need to add any initial value.

@ghdocker9427

9 күн бұрын

@@lochaniperera7285 when B value gets to 0, you cant divide further and its corresponding A value is your gcd as well.

@ghdocker9427

9 күн бұрын

@@lochaniperera7285 When B value gets to 0, you realize no further division can be applied and also the corresponding A value becomes your gcd.

In this method gcd will be A not T1 . so sad .you guys just ruined my 4 marks by this wrong info .shit

@sanador2826

Жыл бұрын

Lol or you can learn to read that you are finding the multiplicative inverse and NOT the gcd

@nikhildhital3011

Жыл бұрын

bruh got whole wrong idea about extended euclidean