@@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.
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!
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!
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!!
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!
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 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
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!!!!! 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!
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!
He says at the end of this video: "stay tuned for the next video", I just wanted to post that the next video in this series is /watch?v=_bRVA5b4sb4 because I found it not that easy to find myself. That video is called "Multiplicative inverses mod n"
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)
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.
![CAMPปลิ้น | รวม Highlight 2024! PART [1/2]](http://i.ytimg.com/vi/6hnvNnvYloU/mqdefault.jpg)
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.
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.
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
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!
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!
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!!
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!
Excellent explanation, an annotation to the next video at the end would be cool..
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!
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.
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
Euclid and Bezout were on drugs that day
I've read a book many times + I watched many videos..
but this one was the best explaining this algorithm !!
thanks a lot ;)
Thanks a million. Your explanation is very clear. It helps me a lot since I will take the midterm exam tomorrow.
you have no idea how many times i have rewatched this over the past few years
i keep forgetting :(
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.
My professor is too bad at teaching this. Thank you so much
Love from Nepal🇳🇵
Thank you so, so much! I had such a hard time grasping the weird arithmetic of these problems until I ran into your video
good explanation! hope to add more explanation on how to calculate x and y in extended euclidean algorithm
You sir are a legend. Made such a complicated topic to me easy.
This was the best explanation I receive on this subject.
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 👀
Excellent video describing how EEA is used to solve gcd(a,b) = ax+by for {x,y}
Excellent explanation...great step-by-step instructions!
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!
Got my discrete math midterm tomorrow, thank you so much, this was super helpful!
thanks to this video, i passed my finals exam on my number theory class
brilliant explanation..been struggling with this over a day and here we are done in just 12 mins..Thanks a lot!!
best video that efficiently explained the concept, thanks
Best Explanation online.
This is the best explanation for the Extended Euclidean Algorithm. Thank you very much for this. Greatly appreciated.
You did a fantastic job. Good teaching.
Best video on TH-cam on this topic . Thanks ....
Thank you so much for this video! Extremely helpful and clear explanation.
This helped so much with a problem I needed to tackle in a week and had no idea, thanks so much!
Not only the best explanation but also the easiest way to remember the steps.
This is a much better explanation than my teacher. Thank you!
Thank u so much. I was literally scratching my head learning this in class!
9 years later here to thank you for your perfect explanation!
Thank you so much. By far the best explanation.
This is really well explained.
thank you so much for the video. I finally understood this concept now!
School got me all mixed up with complicated terms and you made it so easy to grasp, thank you!.
So basically this is just backsubtitution.
Thanks man! you helped me a lot! greetings from Hungary!
Well explained. This is by far the simplest I have seen. Thank you for posting. :)
This was incredibly useful, thank you
Thank you very much, your video was very helpful explaining the concept that I was having trouble grasping in Discrete Mathmatics.
immensely helpful. Thank you good sir
i love this explanation so much
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!
didnt get it until i found this video. thank u
At around 9:40, what do you do if the other number isn't used in the eclidean algorithm?
Absolutely excellent explanation! Definitely will help my on my final this Friday!
What is the next video btw?
The next video is Multiplicative inverses mod n
as posted by
@Celebrian 1 year ago
Thanku sir it's too easy to understand . Well explained .
Thanks for the concise explanation
Great explanation. Thank you so much 🙏
you're truly a good person. be proud!
Great tutoring,wish you were my Lecturer
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
this is more effective than my teacher and took like a tenth of the time
where did you get 13 ?
The next video is Multiplicative inverses mod n
Celebrian Euclidean algorithm what class?
Sorry, my english is bad.
He says at the end of this video: "stay tuned for the next video", I just wanted to post that the next video in this series is /watch?v=_bRVA5b4sb4 because I found it not that easy to find myself. That video is called "Multiplicative inverses mod n"
Advent of Code brought me here
Wonderfully explained, thank you.
Thank you. Beautifully explained.
thank you for the clear workings
Extremely helpful. Thank you.
what is the benefit of expressing the gcd as a linear combination?
Thank you SO MUCH! I think I actually understand it now
THANK YOU! Wish my math teacher was able to teach this half as good....
very clear and well structured explanation, thanks a lot :)
which class ya'll in?
It is indeed a beautiful explanation. It helped me a lot
brilliantly explained
Thanks! Very helpful and easy to understand
this is amazing. Thank you so much! I had been stuck for hours!
Thanks this might be a dumb question but is there a way to construct a matrix and row reduce the augmented matrix to find the weights?
Dude you are the best, thanks a lot!
Legend
How does this relate to RSA?
Great explanation!
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)
Oh thank-you so much. I was looking all over how to do this
ياخي ما اقول إلا الله يهديك للأسلام يا انت اسطوري
Bless, UMich barely even taught this lol
well explained sir !!!
This was extremely helpful, thanks a lot
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.
Wow who knew Kermit was such a great math teacher!
5:41 I too, use the Euclidean Algorithm to find god
Thank you so much for this! I was stuck with discrete math and this helped so much! Hope ur doing well
helped me out alot; thank you
Thanks. It helps me a lot
such an amazing video thank you!
Thanks. Very clear!!!