Steps of Euclidean Algorithm

49 Views Asked by At

On page 15 of "An Introduction to the Theory of Numbers" by Niven,Zuckerman and Montgomery, the numbers of steps requires is given as 3logc ,where it is the natural log. Can anyone please help me understand this? The proofs I've seen assert that it is log2 ab, then how is this possible?