pLAMS THEOREM Let a and b be positive integers with a b Then the number of divisions used by the Euclidean algorithm to find gcda b is less than or equal to five times the number of decimal digits in bp