A Note on the Euclidean Algorithm
A Note on the Euclidean Algorithm
The problem of determining the number of steps needed to find the greatest common divisor of two positive integers by Euclidean algorithm has been investigated in elementary number theory for decades.Different upper bounds have been found for this problem.Here, we provide a sharp upper bound for a function which has …