@@roobiki4494 It's a valid criticism of other educators. Especially considering that the most arrogant and self-righteous ones are always the worst at teaching.
Thank you!!!!! Like seriously I have been pulling my hair out trying to understand this. This video actually made it simple and easy to understand. I appreciate what you did, and it made the whole process MUCH easier!!
I was in homework panic and couldn't find a clear explanation on the Extended Euclidean algorithm. This is one of the clearest explanation I had on the topic. Thank you soooo much!
Thank you so much, I went into office hours and he seemed to giggle that it did not make sense to me from the one example we worked in class like this, but now I actually get it!
I know this video is from 2014 but I just watched this to make sense of my Discrete Math 2 class and wanted to say thank you for explaining this in such a simple way that makes perfect sense!
In the last example he wanted 1180/482. Using a ;pocket calculator this reduces to 241/590. Write out the continued fraction representation = [2, 2, 4, 3, 8] and underneath write the convergents, = [1/2, 2/5, 9/22, 29/ 71, 241/590] For an odd number of convergents (we have 5), the rule is to extract the denominatlor to the left of the rightmost denominator, that is, 71. That's the answer as stated in the lesson.
omg Tysm, I was studying affine cipher and I didn’t even know number theory existed and this made it so easy to understand and to decrypt affine ciphers. Thank you
My professor finished 3 problems and sped through the 2nd portion (the harder part) of these problems in less time than this video is in length. Thank you for taking the time to explain it carefully. Better to fully understand one problem than to be confused while the professor rushes through 3.
OMG!!!!! THANK YOU SO MUCH!!! I kept getting stuck on the step towards the last step and you just explained it to where the other vids I watched just neglected to explain that step!
Sorry guys, but this is not the Extended Euclidean Algorithm. This a procedure called back substitution. en.m.wikipedia.org/wiki/Extended_Euclidean_algorithm
We've learnt it under the name "coefficients de Bézout" and I think it's the exact same thing that is displayed in this video (i.e Extended Euclidean algorithm and this video are the same). But I might be mistaken.
This is Extended: s_0 , s_1, t_1, t_0 are constant. r_i = s_i a +t_i b s_i is a recursive function such that s_i =( s_i-2) +( s_i-1)(q_i-1) t_i is also similar. q_i = Floor(r_i-2/r_i-1)
you're fucking amazing i searched like 2 hours for explain how to do this and all the others was so understandble and when i watched that i just so quick understood it your explains are so good thank you so much you are awsome!!!!!!!!!
Hello Sir, Could you please tell me why is it important to do extended Euclidean algorithm? You said well find that out in a next video but couldn't find any video. Please help!
One of the best explanations. Can't understand why professors have such hard time explaining this, looks so simple here! Thanks a lot.
It would be nice if one day we get to the place where we can celebrate a job well done by one educator, without turning around and shitting on others.
@@roobiki4494 It's a valid criticism of other educators. Especially considering that the most arrogant and self-righteous ones are always the worst at teaching.
@@roobiki4494 Keep licking those boots
Finnaly a good explanation, it's such an easy concept but pretty hard to grasp.
Finally a resource that clearly explains what's going on in finding the coefficients of a linear combination. Well done!
this isn’t too bad but my teacher wants to make it hard talking at 5000mph smh thank you so much
Thank you!!!!! Like seriously I have been pulling my hair out trying to understand this. This video actually made it simple and easy to understand. I appreciate what you did, and it made the whole process MUCH easier!!
I was in homework panic and couldn't find a clear explanation on the Extended Euclidean algorithm. This is one of the clearest explanation I had on the topic. Thank you soooo much!
My lands. I cannot tell you how much time I have spent trying to understand this. This finally, finally, finally, gave me the explanation I needed.
Excellent explanation, an annotation to the next video at the end would be cool..
Thank you so much, I went into office hours and he seemed to giggle that it did not make sense to me from the one example we worked in class like this, but now I actually get it!
I know this video is from 2014 but I just watched this to make sense of my Discrete Math 2 class and wanted to say thank you for explaining this in such a simple way that makes perfect sense!
In the last example he wanted 1180/482. Using a ;pocket calculator this reduces to 241/590. Write out the continued fraction representation = [2, 2, 4, 3, 8] and underneath write the convergents, = [1/2, 2/5, 9/22, 29/ 71, 241/590] For an odd number of convergents (we have 5), the rule is to extract the denominatlor to the left of the rightmost denominator, that is, 71. That's the answer as stated in the lesson.
Thank you so much for this clear explanation! I have struggled with this algorithm for a while, but you made it so easy to understand!
I've read a book many times + I watched many videos..
but this one was the best explaining this algorithm !!
thanks a lot ;)
Excellent stuff. Between your Multiplicative inverses video, and this one, you've helped me greatly in my Cryptography and Security class.
omg Tysm, I was studying affine cipher and I didn’t even know number theory existed and this made it so easy to understand and to decrypt affine ciphers. Thank you
Thanks a million. Your explanation is very clear. It helps me a lot since I will take the midterm exam tomorrow.
My professor finished 3 problems and sped through the 2nd portion (the harder part) of these problems in less time than this video is in length.
Thank you for taking the time to explain it carefully. Better to fully understand one problem than to be confused while the professor rushes through 3.
You sir are a legend. Made such a complicated topic to me easy.
Thank you so, so much! I had such a hard time grasping the weird arithmetic of these problems until I ran into your video
Thank you so much. By far the best explanation.
brilliant explanation..been struggling with this over a day and here we are done in just 12 mins..Thanks a lot!!
Thank you so much for this video! Extremely helpful and clear explanation.
you have no idea how many times i have rewatched this over the past few years
i keep forgetting :(
This is the best explanation for the Extended Euclidean Algorithm. Thank you very much for this. Greatly appreciated.
good explanation! hope to add more explanation on how to calculate x and y in extended euclidean algorithm
I have a test tomorrow and this was the only concept that I was just not grasping at all. I now understand it completely. THANK YOU.
what did u get on the test 👀
This was the best explanation I receive on this subject.
thanks to this video, i passed my finals exam on my number theory class
Got my discrete math midterm tomorrow, thank you so much, this was super helpful!
Excellent explanation...great step-by-step instructions!
This is a much better explanation than my teacher. Thank you!
Great explanation. Thank you so much 🙏
OMG!!!!! THANK YOU SO MUCH!!! I kept getting stuck on the step towards the last step and you just explained it to where the other vids I watched just neglected to explain that step!
best video that efficiently explained the concept, thanks
This helped so much with a problem I needed to tackle in a week and had no idea, thanks so much!
So basically this is just backsubtitution.
Thank u so much. I was literally scratching my head learning this in class!
Excellent video describing how EEA is used to solve gcd(a,b) = ax+by for {x,y}
Best Explanation online.
immensely helpful. Thank you good sir
School got me all mixed up with complicated terms and you made it so easy to grasp, thank you!.
Thank you very much, your video was very helpful explaining the concept that I was having trouble grasping in Discrete Mathmatics.
thank you so much for the video. I finally understood this concept now!
Thanks for the concise explanation
You did a fantastic job. Good teaching.
Sorry guys, but this is not the Extended Euclidean Algorithm. This a procedure called back substitution. en.m.wikipedia.org/wiki/Extended_Euclidean_algorithm
We've learnt it under the name "coefficients de Bézout" and I think it's the exact same thing that is displayed in this video (i.e Extended Euclidean algorithm and this video are the same). But I might be mistaken.
Beautifully said.
this is more effective than my teacher and took like a tenth of the time
Well explained. This is by far the simplest I have seen. Thank you for posting. :)
This is really well explained.
didnt get it until i found this video. thank u
Great tutoring,wish you were my Lecturer
Not only the best explanation but also the easiest way to remember the steps.
9 years later here to thank you for your perfect explanation!
you're truly a good person. be proud!
Advent of Code brought me here
Absolutely excellent explanation! Definitely will help my on my final this Friday!
thank you for the clear workings
What is the next video btw?
The next video is Multiplicative inverses mod n
as posted by
@Celebrian 1 year ago
Wonderfully explained, thank you.
My professor is too bad at teaching this. Thank you so much
Love from Nepal🇳🇵
This was incredibly useful, thank you
Best video on UA-cam on this topic . Thanks ....
Thanks man! you helped me a lot! greetings from Hungary!
brilliantly explained
THANK YOU! Wish my math teacher was able to teach this half as good....
Thank you SO MUCH! I think I actually understand it now
Thanks! Very helpful and easy to understand
Thanku sir it's too easy to understand . Well explained .
Thank you. Beautifully explained.
Bless, UMich barely even taught this lol
Great explanation!
if someone could explain how it works when the outcome of a lineair function is a multiply of the GCD(r,s) . Try: 6600r + 505050r = 150
It is indeed a beautiful explanation. It helped me a lot
5:41 I too, use the Euclidean Algorithm to find god
Extremely helpful. Thank you.
Dude you are the best, thanks a lot!
You're the best best best omggg this helped me so much thanks a lot! 😭❤❤
This is Extended:
s_0 , s_1, t_1, t_0 are constant.
r_i = s_i a +t_i b
s_i is a recursive function such that s_i =( s_i-2) +( s_i-1)(q_i-1)
t_i is also similar.
q_i = Floor(r_i-2/r_i-1)
Wow who knew Kermit was such a great math teacher!
you're fucking amazing i searched like 2 hours for explain how to do this and all the others was so understandble and when i watched that i just so quick understood it your explains are so good thank you so much you are awsome!!!!!!!!!
very clear and well structured explanation, thanks a lot :)
This guy is a legend
Oh thank-you so much. I was looking all over how to do this
easy to understand, tks!
well explained sir !!!
this is amazing. Thank you so much! I had been stuck for hours!
Hello Sir,
Could you please tell me why is it important to do extended Euclidean algorithm? You said well find that out in a next video but couldn't find any video. Please help!
perfect explanation!!
Thanks man!!
Help alot!!
Thanks. Very clear!!!
Thank you sir, it really helped alot
This was extremely helpful, thanks a lot
Thank you so much for this! I was stuck with discrete math and this helped so much! Hope ur doing well
Legend
Awesome..
Thank You
Thanks. It helps me a lot
such an amazing video thank you!
helped me out alot; thank you
Next video hes talking about: ua-cam.com/video/_bRVA5b4sb4/v-deo.html
2021 anyone??