skip to main content
article
Free access

Analysis of the subtractive algorithm for greatest common divisors

Published: 01 May 1976 Publication History

Abstract

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

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM SIGSAM Bulletin
    ACM SIGSAM Bulletin  Volume 10, Issue 2
    May 1976
    28 pages
    ISSN:0163-5824
    DOI:10.1145/1093397
    Issue’s Table of Contents

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 May 1976
    Published in SIGSAM Volume 10, Issue 2

    Check for updates

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 277
      Total Downloads
    • Downloads (Last 12 months)42
    • Downloads (Last 6 weeks)12
    Reflects downloads up to 13 Jan 2025

    Other Metrics

    Citations

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media