Using Fibonacci numbers, he proved that when finding the greatest common divisor of integers a and b, the algorithm runs in no more than 5k steps, where k is the number of (decimal) digits of b
Text from Wikipedia, available under CC BY-SA 4.0.
- #wikipedia
- #event