Continued Fractions

J. J. P. Veerman ()
Additional contact information
J. J. P. Veerman: Portland State University

Chapter Chapter 6 in Numbers from all Angles, 2026, pp 99-122 from Springer

Abstract: Abstract The algorithm for continued fractions is really a reformulation of the Euclidean algorithm. However, the reformulated algorithm has had such a spectacular impact on mathematics that it deserves its own name and a separate treatment. One of the best introductions to this subject is the classic [75]. A generalization of these ideas can be found in [18].

Date: 2026
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-032-10000-9_6

Ordering information: This item can be ordered from
http://www.springer.com/9783032100009

DOI: 10.1007/978-3-032-10000-9_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().