Алгоритм Евкліда (Ukrainian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Алгоритм Евкліда" in Ukrainian language version.

refsWebsite

Global rank Ukrainian rank

2^nd place

4^th place

6^th place

70^th place

91^st place

archive.org

von Fritz K (1945). The Discovery of Incommensurability by Hippasus of Metapontum. Ann. Math. 46: 242—264. doi:10.2307/1969021.
Grossman H (1924). On the Number of Divisions in Finding a G.C.D. The American Mathematical Monthly. 31: 443. doi:10.2307/2298146.
Knuth DE (1976). Evaluation of Porter's Constant. Computers and Mathematics with Applications. 2: 137—139. doi:10.1016/0898-1221(76)90025-0.
Dixon JD (1970). The Number of Steps in the Euclidean Algorithm. J. Number Theory. 2: 414—422. doi:10.1016/0022-314X(70)90044-2.
Norton GH (1990). On the Asymptotic Analysis of the Euclidean Algorithm. Journal of Symbolic Computation. 10: 53—58. doi:10.1016/S0747-7171(08)80036-3.

Ogilvy CS, Anderson JT (1966). Excursions in number theory. New York: Oxford University Press. с. 27—29. LCCN 66-14484.
Stewart BM (1964). Theory of Numbers (вид. 2nd). New York: Macmillan. с. 43—44. LCCN 64-10964.
Heilbronn HA (1969). On the Average Length of a Class of Finite Continued Fractions. У Paul Turán (ред.). Number Theory and Analysis. New York: Plenum. с. 87—96. LCCN 68-8991.