Skip to main content
Log in

Multiplicative Independence in k-Generalized Fibonacci Sequences

  • Published:
Lithuanian Mathematical Journal Aims and scope Submit manuscript

Abstract

A generalization of the Fibonacci sequence is the k-generalized Fibonacci sequence (F (k) n )n ≥ 2 − k with some fixed integer k ≥ 2 whose first k terms are 0,…, 0, 1 and each term afterward is the sum of the preceding k terms. Carmichael’s primitive divisor theorem ensures that all members after the twelfth of the Fibonacci sequence are multiplicatively independent. Although there is no version of this theorem for k-generalized Fibonacci sequences with k > 2, here we find all the pairs of k-Fibonacci numbers that are multiplicatively dependent.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J.J. Bravo and F. Luca, On a conjecture about repdigits in k-generalized Fibonacci sequences, Publ. Math., 82(3–4):623–639, 2013.

    MathSciNet  MATH  Google Scholar 

  2. J.J. Bravo and F. Luca, On the largest prime factor of the k-Fibonacci numbers, Int. J. Number Theory, 9(5):1351–1366, 2013.

    Article  MathSciNet  MATH  Google Scholar 

  3. R.D. Carmichael, On the numerical factors of the arithmetic forms \( \alpha \) n ± β n, Ann. Math., 15(1):30–70, 1913.

    Article  MathSciNet  Google Scholar 

  4. H. Cohen, Number Theory, Vol. I: Tools and Diophantine Equations, Springer, New York, 2007.

  5. C. Cooper and F.T. Howard, Some identities for r-Fibonacci numbers, Fibonacci Q., 49(3):231–243, 2011.

    MathSciNet  MATH  Google Scholar 

  6. G.P. Dresden and Z. Du, A simplified Binet formula for k-generalized Fibonacci numbers, J. Integer Seq., 17(4), Article 14.4.7, 2014.

  7. L.-K. Hua and Y. Wang, Applications of Number Theory to Numerical Analysis, Springer, Berlin, Heidelberg, 1981. Translated from Chinese.

  8. E.M. Matveev, An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. II, Izv. Ross. Akad. Nauk, Ser. Mat., 64(6):125–180, 2000 (in Russian). English transl.: Izv. Math., 64(6):1217–1269, 2000.

  9. E.P. Miles Jr., Generalized Fibonacci numbers and associated matrices, Am. Math. Mon., 67(8):745–752, 1960.

    Article  MathSciNet  MATH  Google Scholar 

  10. M.D. Miller, On generalized Fibonacci numbers, Am. Math. Mon., 78(10):1108–1109, 1971.

    Article  MathSciNet  MATH  Google Scholar 

  11. D.A. Wolfram, Solving generalized Fibonacci recurrences, Fibonacci Q., 36(2):129–145, 1998.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Carlos Alexis Gómez Ruiz.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ruiz, C.A.G., Luca, F. Multiplicative Independence in k-Generalized Fibonacci Sequences. Lith Math J 56, 503–517 (2016). https://doi.org/10.1007/s10986-016-9332-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10986-016-9332-1

MSC

Keywords

Navigation

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy