GCD & LCMhard
0:00.0

The numbers 144 and 89 are consecutive Fibonacci numbers. How many steps does the Euclidean algorithm require to compute gcd(144,89)\gcd(144, 89), and which quotient pattern appears?