YLL討論網

By the Lame's theorem, the number of steps in Euclid's algorithm to find gcd(a,b)=<t. What is it?
For example, please compute the bound t when a=1001 and b=34563.