GCD & LCMhard
0:00.0
For consecutive Fibonacci numbers, the Euclidean algorithm requires the maximum number of steps relative to input size (Lamé's theorem). How many division steps does require?
For consecutive Fibonacci numbers, the Euclidean algorithm requires the maximum number of steps relative to input size (Lamé's theorem). How many division steps does require?