Also known for his running time analysis of the Euclidean algorithm. Using Fibonacci numbers, he proved that when finding the gcd of integers a and b, the algorithm runs in no more than 5k steps, where k is the number of decimal digits of b.
See also: