LAME’S THEOREM

Read the proof of the following theorem from your textbook and write the A

proof in your own words.

LAME‘S THEOREM Let a and b be positive integers with a ≥ b. Then the number of
divisions used by the Euclidean algorithm to find gcd (a, b) is less than or equal to five times
the number of decimal digits in b.