GCD & LCMhard
0:00.0

Using the extended Euclidean algorithm on (77,33)(77, 33), find integers xx and yy such that 77x+33y=gcd(77,33)77x + 33y = \gcd(77, 33). The Euclidean steps are: 77=233+1177 = 2 \cdot 33 + 11 and 33=311+033 = 3 \cdot 11 + 0.