Before revision: As a side result of this proof, one gets that the pairs of integers that give the maximum number of steps of the Euclidean algorithm (for a given size of ) are the pairs of consecutive Fibonacci numbers
After revision: .As a side result of this proof, one gets that the pairs of integers that give the maximum number of steps of the Euclidean algorithm (for a given size of ) are the pairs of consecutive Fibonacci numbers