Skip to main content
SpringerPlus logoLink to SpringerPlus
. 2014 Aug 29;3:485. doi: 10.1186/2193-1801-3-485

Alternating sums of reciprocal generalized Fibonacci numbers

Kantaphon Kuhapatanakul 1,✉
PMCID: PMC4161721  PMID: 25221739

Abstract

Abstract

Recently Holliday and Komatsu extended the results of Ohtsuka and Nakamura on reciprocal sums of Fibonacci numbers to reciprocal sums of generalized Fibonacci numbers. The aim of this work is to give similar results for the alternating sums of reciprocals of the generalized Fibonacci numbers with indices in arithmetic progression. Finally we note our generalizations of some results of Holliday and Komatsu.

AMS Subject Classification

Primary 11B37; secondary 11B39

Keywords: Fibonacci numbers, Reciprocal sums

Introduction

For a positive integer p, the generalized Fibonacci numbers Un are defined for n≥0 by

graphic file with name 40064_2014_1192_Equa_HTML.gif

If p = 1,2, then Un are called the Fibonacci numbers Fn and Pell numbers Pn, respectively. Also, if p is any variable x, then Un are called Fibonacci polynomials Fn(x).

(Ohtsuka and Nakamura 2008/2009) have found the formulas for the integer part of Inline graphic and Inline graphic. (Holliday and Komatsu 2011) generalized these identities to the generalized Fibonacci numbers as follows

graphic file with name 40064_2014_1192_Equ1_HTML.gif 1
graphic file with name 40064_2014_1192_Equ2_HTML.gif 2

where ⌊·⌋ is the floor function.

Similar properties were investigated in several different ways; see (Wu and Zhang 2012; Wu and Zhang 2013; Zhang 2011). Recently, (Kuhapatanakul 2013) gave a similar formula (1) for alternating sums of reciprocal generalized Fibonacci numbers.

In this paper we consider the alternating sums of reciprocals of the generalized Fibonacci numbers with indices in arithmetic progression and evaluate the integer part to the reciprocals of these sums. That is, we derive and prove the formulas of the following forms

graphic file with name 40064_2014_1192_Equb_HTML.gif

where a,b are non-negative integers with b < a. We also extend two identities (1) and (2) by replacing Uk with Uak−b.

Main results

We begin with some identities of the generalized Fibonacci numbers whose will be used in the proofs of main theorem.

Lemma1.

Let n,r be two integers with n > r > 0. Then

  • (i)

    UrUn+1 + Ur−1Un = Un+r.

  • (ii)

    UrUn−1 − Ur−1Un= (−1)r−1Un−r.

  • (iii)

    Inline graphic

Proof.

Every proof is done by induction and omitted.

Lemma2.

Let n,r be two integers with n > r > 0. Then

  • (i)

    Inline graphic

  • (ii)

    Inline graphic

Proof.

By using three identities of Lemma 1, we have

graphic file with name 40064_2014_1192_Equc_HTML.gif

and

graphic file with name 40064_2014_1192_Equd_HTML.gif

as desired.

We are now ready to verify our results.

Theorem1.

Let a,b be two integers with 0 ≤ b < a and f(n) = an−b. Suppose f(n−1)>0 for all positive integer n. Then for t = 1,2 we have

graphic file with name 40064_2014_1192_Eque_HTML.gif

Proof.

Since the proofs of both cases t = 1 and t = 2 are quite similar, we only give a proof for t = 2. We see that f(n) > a for all n. By Lemma 2 (ii),

graphic file with name 40064_2014_1192_Equf_HTML.gif

we get

graphic file with name 40064_2014_1192_Equg_HTML.gif

Thus,

graphic file with name 40064_2014_1192_Equh_HTML.gif

By applying the above inequality repeatedly, we obtain

graphic file with name 40064_2014_1192_Equ3_HTML.gif 3

In a similar way, we have

graphic file with name 40064_2014_1192_Equi_HTML.gif

so

graphic file with name 40064_2014_1192_Equj_HTML.gif

Repeating the above inequality, we obtain

graphic file with name 40064_2014_1192_Equ4_HTML.gif 4

Using Lemma 1(iii), we have

graphic file with name 40064_2014_1192_Equk_HTML.gif

The numerator of the right hand side of above equation is positive if f(n−1) + n is even. Also, the numerator is negative if f(n−1) + n is odd.

Case I: If f(n−1) + n is even, then

graphic file with name 40064_2014_1192_Equl_HTML.gif

so we obtain

graphic file with name 40064_2014_1192_Equ5_HTML.gif 5

Combining the (4) and (5), we get

graphic file with name 40064_2014_1192_Equm_HTML.gif

it is equivalent to

graphic file with name 40064_2014_1192_Equn_HTML.gif

where f(n−1) + n is even.

Case II: If f(n−1) + n is odd, then

graphic file with name 40064_2014_1192_Equo_HTML.gif

We obtain

graphic file with name 40064_2014_1192_Equ6_HTML.gif 6

Combining the (3) and (6), we get

graphic file with name 40064_2014_1192_Equp_HTML.gif

it is equivalent to

graphic file with name 40064_2014_1192_Equq_HTML.gif

where f(n−1)+n is odd.

This completes the proof.

Remark1.

  • If f(n−1) + n = a(n−1) + n − b is even, then we have “both a and b are odd” or “ a,b,n are even” or “a is even and b,n are odd”.

  • If f(n−1) + n = a(n−1) + n − b is odd, then we have “a is odd and b is even” or “ a,b are even and n is odd” or “ a,n are even and b is odd”.

Now we present some examples of Theorem 1 in the following corollary

Corollary1

For a positive integer n > 1, we have

  • (i)

    Inline graphic

  • (ii)

    Inline graphic

  • (iii)

    Inline graphic

  • (iv)

    Inline graphic

Some examples for the Fibonacci numbers.

Example1

For a positive integer n > 1, we have

  • (i)

    Inline graphic

  • (ii)

    Inline graphic

Sums of reciprocals

We will obtain generalizations of the result of (Holliday and Komatsu 2011) on the reciprocal sums of Uk to the reciprocal sums of Uak−b.

Theorem2.

Let a,b be two integers with 0 ≤ b < a and f(n) = an − b. Suppose f(n−1) ≥ 0 for all positive integer n. Then for t = 1,2 we have

graphic file with name 40064_2014_1192_Equr_HTML.gif

Proof.

We only give a proof for t=1 as that of t=2 is similar. Since f(n)≥a for all n, we get

graphic file with name 40064_2014_1192_Equs_HTML.gif

Using Lemma 1 (i) and above inequality, we have

graphic file with name 40064_2014_1192_Equt_HTML.gif

Thus, we obtain

graphic file with name 40064_2014_1192_Equ7_HTML.gif 7

Similarly, we can show that

graphic file with name 40064_2014_1192_Equ8_HTML.gif 8

On the other hand, we have

graphic file with name 40064_2014_1192_Equu_HTML.gif

The numerator of the right hand side of above equation is positive if f(n−1) is odd. Also, the numerator is negative if f(n−1) is even.

If f(n−1) is odd, then we can verify that

graphic file with name 40064_2014_1192_Equ9_HTML.gif 9

and if f(n−1) is even, then we get

graphic file with name 40064_2014_1192_Equ10_HTML.gif 10

Combining the (7) and (9), we obtain

graphic file with name 40064_2014_1192_Equv_HTML.gif

it is equivalent to

graphic file with name 40064_2014_1192_Equw_HTML.gif

where a(n−1)−b is odd.

Combining the (8) and (10), we obtain

graphic file with name 40064_2014_1192_Equx_HTML.gif

it is equivalent to

graphic file with name 40064_2014_1192_Equy_HTML.gif

where a(n−1)−b is even.

Remark2.

  • If f(n−1) = a(n−1)−b is odd, then we have “a is even and b is odd” or “ a,b,n are odd” or “a is odd and b,n are even”.

  • If f(n−1) = a(n−1)−b is even, then we have “both a and b are even” or “ a,b are odd and n is even” or “ a,n are odd and b is even”.

Since Inline graphic, if we take a = 1 in Theorem 2, we obtain the identities (1) and (2). Also, if we take b = 0, then we get the same results given in (Wu and Zhang 2013). In addition we have more results for t = 1,2 such as

  • (i)

    Inline graphic

  • (ii)

    Inline graphic

  • (iii)

    Inline graphic

  • (iv)

    Inline graphic

Acknowledgements

This research is supported by a research grant for new scholars from the Thailand Research Fund (TRF), Grant No. MRG5680127, and the Kasetsart University Research and Development Institute (KURDI), Thailand.

Footnotes

Competing interests

The author declares that he has no competing interests.

References

  1. Holliday SH, Komatsu T. On the sum of reciprocal generalized Fibonacci numbers. Integers. 2011;11A:A11. [Google Scholar]
  2. Kuhapatanakul K. On the sums of reciprocal generalized Fibonacci numbers. J Integer Seq. 2013;16(Article 13.7.1):8. [Google Scholar]
  3. Ohtsuka H, Nakamura S. On the sum of reciprocal sums of Fibonacci numbers. Fibonacci Quart. 2008/2009;46/47(2):153–159. [Google Scholar]
  4. Wu Z, Zhang W. The sums of the reciprocals of the Fibonacci polynomials and Lucas polynomials. J Inequal Appl. 2012;134:8. [Google Scholar]
  5. Zhang W, Wu, Z Several identities involving the Fibonacci polynomials and Lucas polynomials. J Inequal Appl. 2013;205:14. [Google Scholar]
  6. Zhang GJ. The infinite sum of reciprocal of Fibonacci numbers. J Math Res Expo. 2011;31(6):1030–1034. [Google Scholar]

Articles from SpringerPlus are provided here courtesy of Springer-Verlag

RESOURCES