GCD & LCMhard
0:00.0
When finding \gcd(35, 12) via the Extended Euclidean Algorithm, the steps are:
Working backwards to express , what is ?
When finding \gcd(35, 12) via the Extended Euclidean Algorithm, the steps are: Working backwards to express , what is ?