Abstract
The notion of an arithmetic progression was extended to embrace the class of polynomials of degree \(k>1\). Some properties of difference sequences are analyzed and their connections with some number-theory problems are studied. In particular, a certain aspects of Fermat’s Last Theorem and the Fibonacci numbers are revisited.
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
References
von Brasch, T., Bystrm, J., Lystad, L.P.: Optimal control and the fibonacci sequence. J Optim Theory Appl 154, 857–878 (2012)
Jordan, C.: Calculus of Finite Differences. Chelsea Publishing, New York (1939/1965)
Newton, I.: J Principia, Book III, Lemma V, Case 1 (1687)
Nowakowski, J., Borowski K.: Zastosowanie teorii Carolana i Fischera na rynku kapitaowym. Difin (2006)
Stark, H.: An Introduction to Number Theory. MIT Press, Cambridge (1978)
Vajda, S.: Fibonacci and Lucas Numbers, and the Golden Section. p. 179. Halsted Press, Sydney (1989)
Wagstaff Jr., S.S.: Some questions about arithmetic progressions. Am. Math. Mon. 86, 579–582 (1979)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Kołacz, A. (2016). k-Arithmetic Sequences—Theory and Applications. In: Trė, G., Grzegorzewski, P., Kacprzyk, J., Owsiński, J., Penczek, W., Zadrożny, S. (eds) Challenging Problems and Solutions in Intelligent Systems. Studies in Computational Intelligence, vol 634. Springer, Cham. https://doi.org/10.1007/978-3-319-30165-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-30165-5_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-30164-8
Online ISBN: 978-3-319-30165-5
eBook Packages: EngineeringEngineering (R0)