Skip to main content
Proceedings of the National Academy of Sciences of the United States of America logoLink to Proceedings of the National Academy of Sciences of the United States of America
. 1975 Dec;72(12):4720–4722. doi: 10.1073/pnas.72.12.4720

Analysis of the subtractive algorithm for greatest common divisors

Andrew C Yao 1,*, Donald E Knuth 1
PMCID: PMC388801  PMID: 16592294

Abstract

The sum of all partial quotients in the regular continued fraction expansions of m/n, for 1 ≤ mn, is shown to be 6π-2n(ln n)2 + O(n log n(log log n)2). This result is applied to the analysis of what is perhaps the oldest non-trivial algorithm for number-theoretic computations.

Keywords: continued fractions, partial quotients, number theory

Full text

PDF
4720

Articles from Proceedings of the National Academy of Sciences of the United States of America are provided here courtesy of National Academy of Sciences

RESOURCES