Skip to main content

Part of the book series: Springer Series in Computational Mathematics ((SSCM,volume 12))

  • 689 Accesses

Abstract

The history of continued fractions is certainly one of the longest among those of mathematical concepts, since it begins with Euclid’s algorithm for the greatest common divisor at least three centuries B.C. As it is often the case and like Monsieur Jourdain in Molière’s “le bourgeois gentilhomme” (who was speaking in prose though he did not know he was doing so), continued fractions were used for many centuries before their real discovery.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 249.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Brezinski, C. (1991). Introduction. In: History of Continued Fractions and Padé Approximants. Springer Series in Computational Mathematics, vol 12. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58169-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-58169-4_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-63488-8

  • Online ISBN: 978-3-642-58169-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics