Abstract
In [4], we defined three kinds of number tree, and described some of their properties. The third kind we called the Regular Knot Tree (RKT), and showed how it arose as a law of evolution of the string-runs of Regular Knots (which are a type of cylindrical braid).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Knuth, D.E. “The Art of Computer Programming.” Seminumerical Algorithms. Addison-Wesley, Vol. 2(1981): p. 63.
Mohanty, S. “On Multi-Sets.” The Fibonacci Quarterly, Vol. 29.2 (1991): pp. 108–112.
Schroeder, M. Chaos. Fractals and Power Laws. W.H. Freeman, 1991.
Turner, J.C. “Three Number Trees — Their Growth Rules and Related Number Properties.” Fibonacci Numbers & Their Applications, Volume 4. Edited by G.E. Bergum, A.N. Philippou and A.F. Horadam. Kluwer Academic Publishers, Dordrecht, The Netherlands (1990): pp. 335–350.
Turner, J.C. and Schaake, A.G. “Number Trees for Pythagoras, Plato, Euler and the Modular Group.” Research Report No. 200, Department of Mathematics and Statistics, University of Waikato, Hamilton, New Zealand (1990): pp. 1–30.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Turner, J.C., Garcia, H., Schaake, A.G. (1993). Totient Functions on the Euler Number Tree. 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_57
Download citation
DOI: https://doi.org/10.1007/978-94-011-2058-6_57
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-4912-2
Online ISBN: 978-94-011-2058-6
eBook Packages: Springer Book Archive