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\)

Explanation

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.

Study Elementary number theory in ZWMath →

Review the concept: Extended Euclidean algorithm

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.

\[r_k=r_{k-2}-q_{k-1}r_{k-1}\\s_k=s_{k-2}-q_{k-1}s_{k-1}\\t_k=t_{k-2}-q_{k-1}t_{k-1}\]

More practice problems: extended euclidean algorithm

← ZW-EXTENDED-EUCLIDEAN-ALGORITHM-002 ZW-EXTENDED-EUCLIDEAN-ALGORITHM-004 →