An Example of GCD, and Extended Euclidean Algorithm In Finding the Bezout Coefficients
gcd (5083, 345) = 23
Find x, y such that 5083x+345y = gcd(5083,345)
check out an earlier video on the subject:
GCD, Euclidean Algorithm and Bezout Coefficients
• GCD, Euclidean Algorit...
Пікірлер: 8
Thank you so much
What is q
🤯
Still didn't get it 😢
@thinkinginmath3009
Жыл бұрын
it is not easy to explain the details with Shorts. I will consider a longer video on the Extended Euclidean algorithm. For now, please refer this wiki page en.wikipedia.org/wiki/Extended_Euclidean_algorithm
I can't understand
@joshbrill4657
5 ай бұрын
dummy