References

Baladi, Viviane, and Brigitte Vallée. 2005. “Euclidean Algorithms Are Gaussian.” Journal of Number Theory 110 (2): 331–86. https://doi.org/10.1016/j.jnt.2004.08.008.

Heilbronn, Hans. 1968. “On the Average Length of a Class of Finite Continued Fractions.” In Abhandlungen Aus Zahlentheorie Und Analysis. VEB Deutscher Verlag. https://doi.org/10.1007/978-1-4615-4819-5_7.

Knuth, Donald E. 1997. The Art of Computer Programming, Volume 2: Seminumerical Algorithms. 3rd ed. Addison-Wesley.

Lhote, Loïck. 2005. “Efficient Computation of a Class of Continued Fraction Constants.” In Algorithms Seminar 2002–2004, edited by Frédéric Chyzak.

Norton, G. H. 1990. “On the Asymptotic Analysis of the Euclidean Algorithm.” Journal of Symbolic Computation 10 (1): 53–58. https://doi.org/10.1016/S0747-7171(08)80036-3.

Porter, J. W. 1975. “On a Theorem of Heilbronn.” Mathematika 22 (1): 20–28. https://doi.org/10.1112/S0025579300004459.

Shallit, Jeffrey. 1994. “Origins of the Analysis of the Euclidean Algorithm.” Historia Mathematica 21 (4): 401–19. https://doi.org/10.1006/hmat.1994.1031.