In this video we use the Euclidean Algorithm to find the gcd of two numbers, then use that process in reverse to write the gcd as a linear combination of the two numbers.
Same here, decided to get back to maths for computer sciences, the very first warm-up question of the exercises was this. After hours straight on couldn't figure this, I feel so dumb... I can handle most shit, but discrete maths are just out of my brain's scope. I truly respect thoses who are good at it!
Thank you very much. My textbook explained it in a way confusing to me, and I could not find any explanation online that I could understand. You are a hero! Thanks for your teaching.
Thank you so so so much sir !!!!!! I had been suffering because of my poor concept regarding linear combination but watching your video cleared my concept that I hadn't been able to understand for the last 2 months. I thought I wouldn't be able to perform well in my upcoming exam because of this. But you made me confident. Respect from india
I gave up on trying to understand it. So all I did was remember: To get to the next equation: 1) The number being multiplied goes left of the equal sign 2) The remainder becomes the next being multiplied Repeat until you get no more remainder
Subhasmita Tripathy ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-qIj9oT4c3Bg.html A similar question can also be seen here . Just check it out as well .
hi everyone can some one please help me with these questions Using Euclid’s algorithm, express the following rational numbers in re-duced form. Show your working.(a)465651 (b)91283