The Library
On Raney's binary encoding for continued fractions, generalisations of Pell's Equation, and the theory of factorisation
Tools
Tools
Tools
Beynon, Meurig (1981) On Raney's binary encoding for continued fractions, generalisations of Pell's Equation, and the theory of factorisation. University of Warwick. Department of Computer Science. (Theory of Computation Report). (Unpublished)
|
HTML
WRAP_Beynon_cs-rr-034.pdf - Published Version Download (15Mb) | Preview |
Abstract
Raney's algorithm for computing the continued fraction expansion of
(ax+b)/cx+d) from the continued fraction expansion of x was first described
in [R]. In that paper, a simple binary encoding for continued fraction
expansions is of fundamental importance. In some sense, the study of this
encoding - wnich is fully described in $1 below - is the unifying idea
underlying this paper. The first five sections of the paper cover
essentially the same ground as [R], but adopt a perspective in which the algorithm is the central object of interest. As far as the mathematical
results are concerned, any originality is confined to presentation and
organisation, and the most novel aspects of these sections are concerned
with the formulation and justification of the algorithm and its
derivatives. Of particular interest is the use of Dijkstra's guarded
command notation [Di], a formalism ideally suited for expressing Raney's
algorithm in its non-deterministic form (Algorithm 3.4).
| Item Type: | Report | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics | ||||
| Divisions: | Faculty of Science > Computer Science | ||||
| Library of Congress Subject Headings (LCSH): | Continued fractions, Pell's equation, Factorization (Mathematics) | ||||
| Series Name: | Theory of Computation Report | ||||
| Publisher: | University of Warwick. Department of Computer Science | ||||
| Official Date: | January 1981 | ||||
| Dates: |
|
||||
| Number: | Number 34 | ||||
| Number of Pages: | 51 | ||||
| Identifier: | CS-RR-034 | ||||
| Institution: | University of Warwick | ||||
| Theses Department: | Department of Computer Science | ||||
| Status: | Not Peer Reviewed | ||||
| Publication Status: | Unpublished | ||||
| Access rights to Published version: | Open Access | ||||
| Funder: | Nuffield Foundation (NF) |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
Downloads
Downloads per month over past year
