Skip to main content
Log in

On the sum of powers of terms of a linear recurrence sequence

  • Published:
Bulletin of the Brazilian Mathematical Society, New Series Aims and scope Submit manuscript

Abstract

Let (F n ) n≥0 be the Fibonacci sequence given by F n+2 = F n+1 + F n , for n ≥ 0, where F 0 = 0 and F 1 = 1. There are several interesting identities involving this sequence such as F 2 n + F 2 n+1 = F 2n+1, for all n ≥ 0. In a very recent paper, Marques and Togbé proved that if F s n + F s n+1 is a Fibonacci number for all sufficiently large n, then s = 1 or 2. In this paper, we will prove, in particular, that if (G m ) m is a linear recurrence sequence (under weak assumptions) and G s n + ... + G s n+k ∈ (G m ) m , for infinitely many positive integers n, then s is bounded by an effectively computable constant depending only on k and the parameters of G m .

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

Access this article

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. D. Kalman and R. Mena. The Fibonacci numbers exposed. Math. Mag., 76(3) (2003), 167–181.

    Article  MathSciNet  MATH  Google Scholar 

  2. F. Luca and R. Oyono. An exponential Diophantine equation related to powers of two consecutive Fibonacci numbers. Proc. Japan Acad. Ser. A, 87 (2011), 45–50.

    Article  MathSciNet  MATH  Google Scholar 

  3. D. Marques and A. Togbé. On the sum of powers of two consecutive Fibonacci numbers. Proc. Japan Acad. Ser. A, 86 (2010), 174–176.

    Article  MATH  Google Scholar 

  4. E.M. Matveev. An explict lower bound for a homogeneous rational linear form in logarithms of algebraic numbers, II. Izv. Ross. Akad. Nauk Ser. Mat., 64 (2000), 125–180. English transl. in “Izv. Math.”, 64 (2000), 1217–1269.

    Google Scholar 

  5. R.S. Melham. Some analogs of the identity F 2n + F 2 n+1 = F 2n+1. Fibonacci Quart., 37(4) (1999), 305–311.

    MathSciNet  MATH  Google Scholar 

  6. R.S. Melham. On certain combinations of higher powers of Fibonacci numbers. Fibonacci Quart., 48(3) (2010), 256–259.

    MathSciNet  MATH  Google Scholar 

  7. R.S. Melham. More on combinations of higher powers of Fibonacci numbers. Fibonacci Quart., 48(4) (2010), 307–311.

    MathSciNet  MATH  Google Scholar 

  8. A.S. Posamentier and I. Lehmann. The (fabulous) Fibonacci numbers. Prometheus Books, Amherst, NY (2007).

    MATH  Google Scholar 

  9. T.N. Shorey and R. Tijdeman. Exponential Diophantine Equations. Cambridge Tracts in Mathematics, Cambridge University Press, Cambridge, 87 (1986).

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ana Paula Chaves.

Additional information

Scholarship holder of Capes-Brazil.

Supported by FEMAT and CNPq-Brazil.

Supported in part by Purdue University North Central.

About this article

Cite this article

Chaves, A.P., Marques, D. & Togbé, A. On the sum of powers of terms of a linear recurrence sequence. Bull Braz Math Soc, New Series 43, 397–406 (2012). https://doi.org/10.1007/s00574-012-0018-y

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00574-012-0018-y

Keywords

Mathematical subject classification

Navigation