Skip to main content

The Elements of Enteger Geometry

  • Chapter
Applications of Fibonacci Numbers

Abstract

In [5] we described three kinds of number tree, giving their growth rules and some of their number properties. The third kind we called either the regular knot tree (RKT) or the rational number tree (RNT). The first name arose naturally, since the arrangement of numbers (pairs of integers) on its nodes reflects precisely the manner by which string-runs of regular knots — a class of braids — evolve (see [2,5]) from the unknot. Alternatively, if each pair of integers on a node is taken as a ratio, or rational number, then the same tree generates all the rational numbers, uniquely and in lowest form; hence the second name we gave to the tree. In the RNT guise, its properties have been studied by others: for example, in [4] Schroeder gives many results and mentions applications for its left-subtree, which is known as the Farey tree. In [1, page 63] Knuth, in a problem refers to it as the Stern-Peirce tree, and gives three early references.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Knuth, D.E. The Art of Computer Programming. Vol 2/Seminumerical Algorithms. Addison-Wesley, (1981): p. 63.

    MATH  Google Scholar 

  2. Schaake, A.G. and Turner, J.C. A New Theory of Braiding (RR1/1). Research Report 165, Department of Mathematics and Statistics, University of Waikato, Hamilton, N.Z. (1988): pp. 1–42.

    Google Scholar 

  3. Schaake, A.G. and Turner, J.C. New Methods for Solving Quadratic Diophantine Equations (Part I and Part II). Research Report 192, Department of Mathematics and Statistics, University of Waikato, Hamilton, N.Z., (1989): pp. 1–99.

    Google Scholar 

  4. Schroeder, M. Fractals, Chaos and Power Laws W.H. Freeman, New York. (1991).

    Google Scholar 

  5. Turner, J.C. “Three Number Trees — Their Growth Rules and Related Number Properties.” Applications of Fibonacci Numbers, Vol. 3. Edited by A.N. Philippou, A.F. Horadam, G.E. Bergum. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1991: pp. 335–350.

    Google Scholar 

  6. Turner, J.C. “Problem No. H-429.” The Fibonacci Quarterly, Vol. 27.1 (1989): p. 92.

    Google Scholar 

  7. Turner, J.C. and Schaake, A.G. Number Trees for Pythagoras, Plato, Euler, and the Modular Groups. Research Report 200, Department of Mathematics and Statistics, University of Waikato, Hamilton, N.Z. (1990): pp. 1–29.

    Google Scholar 

  8. Waterhouse, W.C. “Continued Fractions and Pythagorean Triples.” The Fibonacci Quarterly, Vol. 30.2 (1992): pp. 144–147.

    MathSciNet  MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Turner, J.C., Schaake, A.G. (1993). The Elements of Enteger Geometry. In: Bergum, G.E., Philippou, A.N., Horadam, A.F. (eds) Applications of Fibonacci Numbers. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-2058-6_56

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-2058-6_56

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-4912-2

  • Online ISBN: 978-94-011-2058-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics