关于整数辗转相除次数的估计

Estimates for Number of Times on Euclidean algorithm between two Integers

文章得到正整数ａ、ｂ（ａ≥ｂ）辗转相除次数ｎ的估计为ｎ≤ｌｏｇ＋５ｂ２，它改进了现行的一些估计〔１～３〕，对于一部分整数ｂ。

In this paper we will further the results 1-3 and obtain that estimation of the number of times on Euclidean algorithm between two positive integers a and b(a≥b) is not larger than log1+52b,in some integer n ≤log1+52b is the best of estimations.