Lemma. Bezout [0038]
Lemma. Bezout [0038]
For any natural numbers . There exist integers such that the gcd of can we written as .
Proof. Do the Euclidean Algorithm in reverse.
For any natural numbers . There exist integers such that the gcd of can we written as .
Proof. Do the Euclidean Algorithm in reverse.