Abstract
In this paper we show that a sequence {A n} defined by the second order recurrence relation
, satisfies the congruence relation
for all choices of integers u 1 and u 2 and all initial values A 1 and A 2 if and only if k = 1 or 5 (mod 24). In the rest of this section we summarize the relevant earlier work in this area.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Freitag, H.T. “A Property of Unit Digits of Fibonacci Numbers.” Applications of Fibonacci Numbers, Volume 2. Edited by G.E. Bergum, A.F. Horadam and A.N. Philippou. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1986: pp. 39–42.
Freitag, H.T. and Phillips, G.M. “A congruence relation for certain recursive sequences.” The Fibonacci Quarterly, Vol. 24.4 (1986): pp. 332–335.
Freitag, H.T. and Phillips, G.M. “A congruence relation for a linear recursive sequence of arbitrary order.” Applications of Fibonacci Numbers. Volume 3. Edited by G.E. Bergum, A.F. Horadam and A.N. Philippou. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1988: pp. 39–44.
Somer, Lawrence. “Congruence Relations for kth Order Linear Recurrences.” The Fibonacci Quarterly, Vol. 27.1 (1989): pp. 25–30.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Freitag, H.T., Bicknell-Johnson, M., Phillips, G.M. (1999). A Property of the Unit Digits of Recursive Sequences. In: Howard, F.T. (eds) Applications of Fibonacci Numbers. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-4271-7_14
Download citation
DOI: https://doi.org/10.1007/978-94-011-4271-7_14
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-5851-3
Online ISBN: 978-94-011-4271-7
eBook Packages: Springer Book Archive