Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

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)

[img]
Preview
HTML
WRAP_Beynon_cs-rr-034.pdf - Published Version

Download (15Mb) | Preview

Request Changes to record.

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:
DateEvent
January 1981["eprint_fieldopt_dates_date_type_available" not defined]
Number: Number 34
Number of Pages: 51
DOI: 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 View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us