Advertisement

k-Arithmetic Sequences—Theory and Applications

  • Adam Kołacz
Chapter
Part of the Studies in Computational Intelligence book series (SCI, volume 634)

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.

Keywords

Arithmetic progression Difference sequence Polynomials Fibonacci numbers 

2010 Mathematics Subject Classification

11B83 

References

  1. 1.
    von Brasch, T., Bystrm, J., Lystad, L.P.: Optimal control and the fibonacci sequence. J Optim Theory Appl 154, 857–878 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Jordan, C.: Calculus of Finite Differences. Chelsea Publishing, New York (1939/1965)Google Scholar
  3. 3.
    Newton, I.: J Principia, Book III, Lemma V, Case 1 (1687)Google Scholar
  4. 4.
    Nowakowski, J., Borowski K.: Zastosowanie teorii Carolana i Fischera na rynku kapitaowym. Difin (2006)Google Scholar
  5. 5.
    Stark, H.: An Introduction to Number Theory. MIT Press, Cambridge (1978)Google Scholar
  6. 6.
    Vajda, S.: Fibonacci and Lucas Numbers, and the Golden Section. p. 179. Halsted Press, Sydney (1989)Google Scholar
  7. 7.
    Wagstaff Jr., S.S.: Some questions about arithmetic progressions. Am. Math. Mon. 86, 579–582 (1979)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Faculty of Mathematics and Information ScienceWarsaw University of TechnologyWarsawPoland

Personalised recommendations