Exercise · ZW-EXTENDED-EUCLIDEAN-ALGORITHM-003 · ★☆☆ Basic
If \(\gcd(a,b)=d\), what relation do \(a\), \(b\) and \(d\) satisfy in Bézout's identity?
Choose one option.
Show answer
- B. \(d=ax+by\) for some integers \(x,y\)
Exercise · ZW-EXTENDED-EUCLIDEAN-ALGORITHM-003 · ★☆☆ Basic
Choose one option.
Bézout's identity ensures an integer linear combination of \(a\) and \(b\) equal to \(d\). The product option confuses it with a multiplicative relation that does not hold in general.
The extended Euclidean algorithm computes \(d=\gcd(a,b)\) and integers \(x\), \(y\) such that \(ax+by=d\). It is the Euclidean algorithm that also tracks the Bézout coefficients.
← ZW-EXTENDED-EUCLIDEAN-ALGORITHM-002 ZW-EXTENDED-EUCLIDEAN-ALGORITHM-004 →