For any integer , if
and
*b* < *F*_{k+1}, then
Euclid(a,b) makes fewer than *k* recursive calls.

Remember that , ,

,

,

k = O(lg b) recursive calls

O() arithmetic operations

O() bit operations

,

k = O(lg b) recursive calls

O() arithmetic operations

O() bit operations