Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T05:24:10.820Z Has data issue: false hasContentIssue false

On the continued fraction algorithm

Published online by Cambridge University Press:  17 April 2009

J. M. Mack
Affiliation:
University of Sydney, Sydney, New South Wales.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The fact that continued fractions can be described in terms of Farey sections is used to obtain a generalised continued fraction algorithm. Geometrically, the algorithm transfers the continued fraction process from the real line R to an arbitrary rational line l in Rn. Arithmetically, the algorithm provides a sequence of simultaneous rational approximations to a set of n real numbers θ1, …, θn in the extreme case where all of the numbers are rationally dependent on 1 and (say) θ1. All but a finite number of best approximations are given by the algorithm.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1970