Abstract
In the literature, the Fibonacci numbers are usually denoted by \(F_n\), but this symbol is already reserved for the Fermat numbers in this book. So we will denote them by \(K_n\). The sequence of Fibonacci numbers \(\,\,(K_n)_{n=0}^\infty \,\,\) starts with \(K_0=0\) and \(K_1=1\) and satisfies the recurrence.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The solution of the linear difference equations of the kth order is described, for example, in Henrici [143, p. 213].
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Křížek, M., Somer, L., Šolcová, A. (2021). Fibonacci and Lucas Numbers. In: From Great Discoveries in Number Theory to Applications. Springer, Cham. https://doi.org/10.1007/978-3-030-83899-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-83899-7_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-83898-0
Online ISBN: 978-3-030-83899-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)