Discrete Math - 4.3.4 Greatest Common Divisors as Linear Combinations

Writing the greatest common divisor of two integers as a linear combination of those integers. Bezout's Theorem is also covered.

Video Chapters:
Introduction 0:00
Write GCD as a Linear Combination 0:08
Practice Writing GCD as a Linear Combination 7:09
Bezout's Theorem 11:05
Up Next 11:47

Textbook: Rosen, Discrete Mathematics and Its Applications, 7e

[k.]

"So you might be thinking "ok she's lost it" "LMAO

[revazzhvania]

Hi.
I have been using your channel for a while now.
I just found these new series and im really grateful.
I thank you for me and many other students who use your clear explanations of discrete mathematics.

[yosidy_]

This was explained to me extremely poorly in my Discrete Math class. Thank you for making this easy to understand!

[g.ryanpeterson]

I watched about 5 different YouTube videos explaining this. Your video is the one that finally made it click for me. Thank you!

[maheenfatima]

I don't know how to express my resepect and love towards you.You clear my concepts which were brutally messed up by grad school teachers

[jabrild]

I want to thank you for this whope course. I have wachted basically all the chapters by now haha

[laibash]

Thankyou so much, you help me pass my semster, many more success to you teacher <3

[lukendorf]

Thank you so much for this explanation, it really helped me!

[DavidDixon-qb]

Linear Combinations and Extend Euclidean Algorithm is the same thing, right?

[khethukuthulasabela]

Hei do you have a video doing modular exponential?