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

  • @someone-jl4sj
    @someone-jl4sj Жыл бұрын

    Thank you so much

  • @antarticakhloe3109
    @antarticakhloe31098 ай бұрын

    What is q

  • @prasantasahu5156
    @prasantasahu5156 Жыл бұрын

    🤯

  • @KashifKhan-gh1zs
    @KashifKhan-gh1zs Жыл бұрын

    Still didn't get it 😢

  • @thinkinginmath3009

    @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

  • @praveenasoma2064
    @praveenasoma20646 ай бұрын

    I can't understand

  • @joshbrill4657

    @joshbrill4657

    5 ай бұрын

    dummy