Research
Open access
Published: 25 April 2013

Several identities involving the Fibonacci polynomials and Lucas polynomials

Zhengang Wu¹ &
Wenpeng Zhang¹

Journal of Inequalities and Applications volume 2013, Article number: 205 (2013) Cite this article

4090 Accesses
1 Altmetric
Metrics details

Abstract

In this paper, the authors consider infinite sums derived from the reciprocals of the Fibonacci polynomials and Lucas polynomials. Then applying the floor function to the reciprocals of these sums, the authors obtain several new identities involving the Fibonacci polynomials and Lucas polynomials.

MSC:11B39.

1 Introduction

For any variable quantity x, the Fibonacci polynomials $F_{n} (x)$ and Lucas polynomials $L_{n} (x)$ are defined by $F_{n + 2} (x) = x F_{n + 1} (x) + F_{n} (x)$ , $n \geq 0$ , with the initial values $F_{0} (x) = 0$ and $F_{1} (x) = 1$ ; $L_{n + 2} (x) = x L_{n + 1} (x) + L_{n} (x)$ , $n \geq 0$ , with the initial values $L_{0} (x) = 2$ and $L_{1} (x) = x$ . For $x = 1$ , we obtain the usual Fibonacci numbers and Lucas numbers. Let $α = \frac{1}{2} (x + \sqrt{x^{2} + 4})$ and $β = \frac{1}{2} (x - \sqrt{x^{2} + 4})$ , then from the properties of second-order linear recurrence sequences, we have

F_{n} (x) = \frac{α^{n} - β^{n}}{\sqrt{x^{2} + 4}} and L_{n} (x) = α^{n} + β^{n} .

Various authors studied the properties of the Fibonacci polynomials and Lucas polynomials and obtained many interesting results; see [1–3], and [4].

The so-called Fibonacci zeta function and Lucas zeta function defined by

ζ_{F} (s) = \sum_{n = 1}^{\infty} \frac{1}{F_{n}^{s}} and ζ_{L} (s) = \sum_{n = 1}^{\infty} \frac{1}{L_{n}^{s}},

where the $F_{n}$ and $L_{n}$ denote the Fibonacci numbers and Lucas numbers, have been considered in several different ways. Navas [5] discussed the analytic continuation of these series. In [6] it is shown that for any positive distinct integer $s_{1}$ , $s_{2}$ , $s_{3}$ , the numbers $ζ_{F} (2 s_{1})$ , $ζ_{F} (2 s_{2})$ , and $ζ_{F} (2 s_{3})$ are algebraically independent if and only if at least one of $s_{1}$ , $s_{2}$ , $s_{3}$ is even.

Ohtsuka and Nakamura [7] studied the partial infinite sums of reciprocal Fibonacci numbers and proved the following conclusions:

\begin{matrix} ⌊ {(\sum_{k = n}^{\infty} \frac{1}{F_{k}})}^{- 1} ⌋ = {\begin{matrix} F_{n - 2} & if n is even and n \geq 2; \\ F_{n - 2} - 1 & if n is odd and n \geq 1 . \end{matrix} \\ ⌊ {(\sum_{k = n}^{\infty} \frac{1}{F_{k}^{2}})}^{- 1} ⌋ = {\begin{matrix} F_{n - 1} F_{n} - 1 & if n is even and n \geq 2; \\ F_{n - 1} F_{n} & if n is odd and n \geq 1 . \end{matrix} \end{matrix}

Wu and Zhang [8] generalized these identities to the Fibonacci polynomials and Lucas polynomials. Similar properties were investigated in several different ways; see [9, 10], and [11]. Recently, some authors considered the nearest integer of the sum of reciprocal Fibonacci numbers and other famous sequences and obtained several new interesting identities; see [12] and [13]. Kilic and Arikan [14] defined a k th-order linear recursive sequence $u_{n}$ for any positive integer p, q and $n > k$ as follows:

u_{n} = p u_{n - 1} + q u_{n - 2} + u_{n - 3} + \dots + u_{n - k},

and they proved that there exists a positive integer $n_{0}$ such that

∥ {(\sum_{k = n}^{\infty} \frac{1}{u_{k}})}^{- 1} ∥ = u_{n} - u_{n - 1} (n \geq n_{0}),

where $∥ \cdot ∥$ denotes the nearest integer. (Clearly, $∥ x ∥ = ⌊ x + \frac{1}{2} ⌋$ .)

In this paper, we consider the subseries of infinite sums derived from the reciprocals of the Fibonacci polynomials and Lucas polynomials and prove the following.

Theorem 1 For any positive integer x, n and even $a \geq 2$ , we have

\begin{aligned} (1) ⌊ {(\sum_{k = n}^{\infty} \frac{1}{F_{a k} (x)})}^{- 1} ⌋ = F_{a n} (x) - F_{a n - a} (x) - 1 (n \geq 1) . \\ (2) ⌊ {(\sum_{k = n}^{\infty} \frac{1}{L_{a k} (x)})}^{- 1} ⌋ = L_{a n} (x) - L_{a n - a} (x) (n \geq 1) . \\ (3) ⌊ {(\sum_{k = n}^{\infty} \frac{1}{F_{a k}^{2} (x)})}^{- 1} ⌋ = F_{a n}^{2} (x) - F_{a n - a}^{2} (x) - 1 (n \geq 1) . \\ (4) ⌊ {(\sum_{k = n}^{\infty} \frac{1}{L_{a k}^{2} (x)})}^{- 1} ⌋ = L_{a n}^{2} (x) - L_{a n - a}^{2} (x) + 1 (n \geq 2) . \end{aligned}

Theorem 2 For any positive integer x and odd $b \geq 1$ , we have

\begin{aligned} (1) ⌊ {(\sum_{k = n}^{\infty} \frac{1}{F_{b k} (x)})}^{- 1} ⌋ = {\begin{matrix} F_{b n} (x) - F_{b n - b} (x) & if n is even and n \geq 2; \\ F_{b n} (x) - F_{b n - b} (x) - 1 & if n is odd and n \geq 1 . \end{matrix} \\ (2) ⌊ {(\sum_{k = n}^{\infty} \frac{1}{L_{b k} (x)})}^{- 1} ⌋ = {\begin{matrix} L_{b n} (x) - L_{b n - b} (x) - 1 & if n is even and n \geq 2; \\ L_{b n} (x) - L_{b n - b} (x) & if n is odd and n \geq 3 . \end{matrix} \\ (3) ⌊ {(\sum_{k = n}^{\infty} \frac{1}{F_{b k}^{2} (x)})}^{- 1} ⌋ = {\begin{matrix} F_{b n}^{2} (x) - F_{b n - b}^{2} (x) & if n is even and n \geq 2; \\ F_{b n}^{2} (x) - F_{b n - b}^{2} (x) - 1 & if n is odd and n \geq 1 . \end{matrix} \end{aligned}

Particularly, for $x \geq 2$ , we have

(4) ⌊ {(\sum_{k = n}^{\infty} \frac{1}{L_{b k}^{2} (x)})}^{- 1} ⌋ = {\begin{matrix} L_{b n}^{2} (x) - L_{b n - b}^{2} (x) - 3 & if n is even and n \geq 2; \\ L_{b n}^{2} (x) - L_{b n - b}^{2} (x) + 2 & if n is odd and n \geq 3 . \end{matrix}

If $x = 1$ , $b = 1$ (respectively, $x = 2$ , $b = 1$ ) or $x = 1$ , $b = 3$ , then from our theorems we can deduce the conclusions of [7–10], and [11].

2 Proof of theorems

To complete the proof of our theorems, we need the following lemma.

Lemma For any positive integer x, m, and n,

F_{m} (x) F_{n} (x) = \frac{1}{x^{2} + 4} (L_{m + n} (x) - {(- 1)}^{n} L_{m - n} (x)),

(1)

L_{m} (x) L_{n} (x) = L_{m + n} (x) + {(- 1)}^{n} L_{m - n} (x),

(2)

F_{m} (x) L_{n} (x) = F_{m + n} (x) + {(- 1)}^{n} F_{m - n} (x) = F_{m + n} (x) - {(- 1)}^{m} F_{n - m} (x),

(3)

F_{n - 1} (x) + F_{n + 1} (x) = L_{n} (x) .

(4)

Proof We only prove identities (1) and (4), and other identities are proved similarly. For any positive integer x, m, and n, from the identity

F_{n} (x) = \frac{α^{n} - β^{n}}{\sqrt{x^{2} + 4}} and L_{n} (x) = α^{n} + β^{n},

we have

\begin{aligned} F_{m} (x) F_{n} (x) & = \frac{(α^{m} - β^{m}) (α^{n} - β^{n})}{x^{2} + 4} = \frac{(α^{m + n} + β^{m + n} - α^{n} β^{m} - α^{m} β^{n})}{x^{2} + 4} \\ = \frac{1}{x^{2} + 4} (L_{m + n} (x) - {(- 1)}^{n} L_{m - n} (x)), \end{aligned}

and

\begin{aligned} F_{n - 1} (x) + F_{n + 1} (x) & = \frac{α^{n - 1} - β^{n - 1}}{\sqrt{x^{2} + 4}} + \frac{α^{n + 1} - β^{n + 1}}{\sqrt{x^{2} + 4}} = \frac{α^{n} (α + α^{- 1}) - β^{n} (β + β^{- 1})}{\sqrt{x^{2} + 4}} \\ = \frac{(\sqrt{x^{2} + 4}) α^{n} + (\sqrt{x^{2} + 4}) β^{n}}{\sqrt{x^{2} + 4}} = α^{n} + β^{n} = L_{n} (x) . \end{aligned}

This proves identities (1) and (4). □

Now we shall complete the proof of our theorems. We shall prove only Theorems 1(1), 1(3), 2(1), and 2(4), and other identities are proved similarly and omitted. First, we prove Theorem 1(1).

Proof of Theorem 1(1) Theorem 1(1) is equivalent to

\frac{1}{F_{a n} (x) - F_{a n - a} (x)} < \sum_{k = n}^{\infty} \frac{1}{F_{a k} (x)} \leq \frac{1}{F_{a n} (x) - F_{a n - a} (x) - 1} .

(5)

For any positive integer x, k and even $a \geq 2$ , using identity (1), we have

\begin{aligned} \frac{1}{F_{a k} (x)} - \frac{1}{F_{a k} (x) - F_{a k - a} (x)} - \frac{1}{F_{a k + a} (x) - F_{a k} (x)} \\ = \frac{1}{F_{a k + a} (x) - F_{a k} (x)} - \frac{F_{a k - a} (x)}{F_{a k} (x) (F_{a k} (x) - F_{a k - a} (x))} \\ = \frac{F_{a k}^{2} (x) - F_{a k - a} (x) F_{a k + a} (x)}{F_{a k} (x) (F_{a k} (x) - F_{a k - a} (x)) (F_{a k + a} (x) - F_{a k} (x))} \\ = \frac{L_{2 a} (x) - 2}{F_{a k} (x) (x^{2} + 4) (F_{a k} (x) - F_{a k - a} (x)) (F_{a k + a} (x) - F_{a k} (x))} . \end{aligned}

(6)

Since $F_{n} (x)$ and $L_{n} (x)$ are monotone increasing for n and a fixed positive integer x, we have $L_{2 a} (x) - 2 > 0$ , $F_{a k} (x) - F_{a k - a} (x) > 0$ , and $F_{a k + a} (x) - F_{a k} (x) > 0$ for any positive integer x, k and even $a \geq 2$ . Hence the numerator of the right-hand side of the above identity is positive for any positive integer x, k and even $a \geq 2$ , so we get

\frac{1}{F_{a k} (x)} > \frac{1}{F_{a k} (x) - F_{a k - a} (x)} - \frac{1}{F_{a k + a} (x) - F_{a k} (x)} .

(7)

Using (7) repeatedly, we have

\begin{aligned} \sum_{k = n}^{\infty} \frac{1}{F_{a k} (x)} > & \sum_{k = n}^{\infty} (\frac{1}{F_{a k} (x) - F_{a k - a} (x)} - \frac{1}{F_{a k + a} (x) - F_{a k} (x)}) \\ = & \frac{1}{F_{a n} (x) - F_{a n - a} (x)} - \frac{1}{F_{a n + a} (x) - F_{a n} (x)} + \frac{1}{F_{a n + a} (x) - F_{a n} (x)} \\ - \frac{1}{F_{a n + 2 a} (x) - F_{a n + a} (x)} + \frac{1}{F_{a n + 2 a} (x) - F_{a n + a} (x)} - \dots \\ = & \frac{1}{F_{a n} (x) - F_{a n - a} (x)} . \end{aligned}

(8)

On the other hand, we prove that for any positive integer x, k and even $a \geq 2$ ,

\frac{1}{F_{a k} (x)} < \frac{1}{F_{a k} (x) - F_{a k - a} (x) - 1} - \frac{1}{F_{a k + a} (x) - F_{a k} (x) - 1} .

(9)

Inequality (9) is equivalent to

\frac{F_{a k - a} (x) + 1}{F_{a k} (x) (F_{a k} (x) - F_{a k - a} (x) - 1)} > \frac{1}{F_{a k + a} (x) - F_{a k} (x) - 1},

F_{a k - a} (x) F_{a k + a} (x) - F_{a k - a} (x) + F_{a k + a} (x) - 1 > F_{a k}^{2} (x) .

Using identity (1), the above inequality is equivalent to

\begin{aligned} F_{a k + a + 2} (x) + F_{a k + a - 2} (x) - F_{a k - a + 2} (x) - F_{a k - a - 2} (x) \\ + 2 F_{a k + a} (x) - 2 F_{a k - a} (x) - L_{2 a} (x) - L_{2} (x) > 0, \end{aligned}

\begin{aligned} (F_{a k + a + 2} (x) - L_{2 a} (x)) + (F_{a k + a} (x) - F_{a k - a + 2} (x)) \\ + (F_{a k + a - 2} (x) - F_{a k - a - 2} (x) - L_{2} (x)) + (F_{a k + a} (x) - 2 F_{a k - a} (x)) > 0 . \end{aligned}

(10)

Since $F_{n} (x)$ and $L_{n} (x)$ are monotone increasing for n and a fixed positive integer x, we have $F_{a k + a} (x) - F_{a k - a + 2} (x) > 0$ , $F_{a k + a - 2} (x) - F_{a k - a - 2} (x) - L_{2} (x) > 0$ , and $F_{a k + a} (x) - 2 F_{a k - a} (x) > 0$ for any positive integer x, k and even $a \geq 2$ . Using identity (4), we have

\begin{aligned} F_{a k + a + 2} (x) - L_{2 a} (x) & > F_{2 a + 2} (x) - L_{2 a} (x) \\ = x F_{2 a + 1} (x) + F_{2 a} (x) - F_{2 a + 1} (x) - F_{2 a - 1} (x) \\ = (x - 1) F_{2 a + 1} (x) + F_{2 a} (x) - F_{2 a - 1} (x) > 0 . \end{aligned}

Hence the numerator of each part in parentheses of the left-hand side of inequality (10) is positive, so inequality (10) holds for any positive integer x, k and even $a \geq 2$ . Hence inequality (9) is true. Using (9) repeatedly, we have

\begin{aligned} \sum_{k = n}^{\infty} \frac{1}{F_{a k} (x)} & < \sum_{k = n}^{\infty} (\frac{1}{F_{a k} (x) - F_{a k - a} (x) - 1} - \frac{1}{F_{a k + a} (x) - F_{a k} (x) - 1}) \\ = \frac{1}{F_{a n} (x) - F_{a n - a} (x) - 1} . \end{aligned}

(11)

Now inequality (5) follows from (8) and (11). This proves Theorem 1(1). □

Proof of Theorem 1(3) Now we prove Theorem 1(3). Theorem 1(3) is equivalent to

\frac{1}{F_{a n}^{2} (x) - F_{a n - a}^{2} (x)} < \sum_{k = n}^{\infty} \frac{1}{F_{a k}^{2} (x)} \leq \frac{1}{F_{a n}^{2} (x) - F_{a n - a}^{2} (x) - 1} .

(12)

For any positive integer x, k and even $a \geq 2$ , using identities (1) and (2), we have

\begin{aligned} \frac{1}{F_{a k}^{2} (x)} - \frac{1}{F_{a k}^{2} (x) - F_{a k - a}^{2} (x)} - \frac{1}{F_{a k + a}^{2} (x) - F_{a k}^{2} (x)} \\ = \frac{F_{a k}^{4} (x) - F_{a k - a}^{2} (x) F_{a k + a}^{2} (x)}{F_{a k}^{2} (x) (F_{a k}^{2} (x) - F_{a k - a}^{2} (x)) (F_{a k + a}^{2} (x) - F_{a k}^{2} (x))} \\ = \frac{(F_{a k}^{2} (x) - F_{a k - a} (x) F_{a k + a} (x)) (F_{a k}^{2} (x) + F_{a k - a} (x) F_{a k + a} (x))}{F_{a k}^{2} (x) (F_{a k}^{2} (x) - F_{a k - a}^{2} (x)) (F_{a k + a}^{2} (x) - F_{a k}^{2} (x))} \\ = \frac{(L_{2 a} (x) - 2) (F_{a k}^{2} (x) + F_{a k - a} (x) F_{a k + a} (x))}{F_{a k}^{2} (x) (x^{2} + 4) (F_{a k}^{2} (x) - F_{a k - a}^{2} (x)) (F_{a k + a}^{2} (x) - F_{a k}^{2} (x))} . \end{aligned}

(13)

Since $F_{n} (x)$ and $L_{n} (x)$ are monotone increasing for n and a fixed positive integer x, we have $L_{2 a} (x) - 2 > 0$ , $F_{a k}^{2} (x) - F_{a k - a}^{2} (x) > 0$ , and $F_{a k + a}^{2} (x) - F_{a k}^{2} (x) > 0$ for any positive integer x, k and even $a \geq 2$ . Hence the numerator of the right-hand side of the above identity is positive for any positive integer x, k and even $a \geq 2$ , so we get

\frac{1}{F_{a k}^{2} (x)} > \frac{1}{F_{a k}^{2} (x) - F_{a k - a}^{2} (x)} - \frac{1}{F_{a k + a}^{2} (x) - F_{a k}^{2} (x)} .

(14)

Using (14) repeatedly, we have

\sum_{k = n}^{\infty} \frac{1}{F_{a k}^{2} (x)} > \sum_{k = n}^{\infty} (\frac{1}{F_{a k}^{2} (x) - F_{a k - a}^{2} (x)} - \frac{1}{F_{a k + a}^{2} (x) - F_{a k}^{2} (x)}) = \frac{1}{F_{a n}^{2} (x) - F_{a n - a}^{2} (x)} .

(15)

On the other hand, we prove that for any positive integer x, k and even $a \geq 2$ ,

\frac{1}{F_{a k}^{2} (x)} < \frac{1}{F_{a k}^{2} (x) - F_{a k - a}^{2} (x) - 1} - \frac{1}{F_{a k + a}^{2} (x) - F_{a k}^{2} (x) - 1} .

(16)

Inequality (16) is equivalent to

\frac{F_{a k - a}^{2} (x) + 1}{F_{a k}^{2} (x) (F_{a k}^{2} (x) - F_{a k - a}^{2} (x) - 1)} > \frac{1}{F_{a k + a}^{2} (x) - F_{a k}^{2} (x) - 1},

F_{a k - a}^{2} (x) F_{a k + a}^{2} (x) - F_{a k}^{4} (x) + F_{a k + a}^{2} (x) - F_{a k - a}^{2} (x) - 1 > 0 .

Using identities (1) and (2), the above inequality is equivalent to

(x^{2} + 2) L_{2 a k + 2 a} (x) + 4 L_{2 a k} (x) - (x^{2} + 6) L_{2 a k - 2 a} (x) - 4 + L_{4 a} (x) - L_{4} (x) > 0 .

(17)

Since $L_{n} (x)$ are monotone increasing for n and a fixed positive integer x, we have $L_{4 a} (x) - L_{4} (x) > 0$ for any positive integer x and even $a \geq 2$ . On the other hand, we have

\begin{aligned} (x^{2} + 2) L_{2 a k + 2 a} (x) + 4 L_{2 a k} (x) - (x^{2} + 6) L_{2 a k - 2 a} (x) - 4 \\ > (x^{2} + 6) L_{2 a k} (x) - (x^{2} + 6) L_{2 a k - 2 a} (x) - 4 > (x^{2} + 6) - 4 > 0 . \end{aligned}

Hence the numerator of the left-hand side of inequality (17) is positive, so inequality (17) holds for any positive integer x, k and even $a \geq 2$ . Hence inequality (16) is true. Using (16) repeatedly, we have

\begin{array}{rcl} \sum_{k = n}^{\infty} \frac{1}{F_{a k}^{2} (x)} & < & \sum_{k = n}^{\infty} (\frac{1}{F_{a k}^{2} (x) - F_{a k - a}^{2} (x) - 1} - \frac{1}{F_{a k + a}^{2} (x) - F_{a k}^{2} (x) - 1}) \\ = & \frac{1}{F_{a n}^{2} (x) - F_{a n - a}^{2} (x) - 1} . \end{array}

(18)

Now inequality (12) follows from (15) and (18). This proves Theorem 1(3). □

Proof of Theorem 2(1) First we consider the case that $n = 2 m \geq 2$ is even. At this time, for any odd $b \geq 1$ , Theorem 2(1) is equivalent to

\frac{1}{F_{2 m b} (x) - F_{2 m b - b} (x) + 1} < \sum_{k = 2 m}^{\infty} \frac{1}{F_{b k} (x)} \leq \frac{1}{F_{2 m b} (x) - F_{2 m b - b} (x)} .

(19)

Now we prove that for any positive integer x, k and odd $b \geq 1$ ,

\frac{1}{F_{2 b k} (x)} + \frac{1}{F_{2 b k + b} (x)} < \frac{1}{F_{2 b k} (x) - F_{2 b k - b} (x)} - \frac{1}{F_{2 b k + 2 b} (x) - F_{2 b k + b} (x)} .

(20)

Inequality (20) is equivalent to

\frac{F_{2 b k + 2 b} (x)}{F_{2 b k + b} (x) (F_{2 b k + 2 b} (x) - F_{2 b k + b} (x))} < \frac{F_{2 b k - b} (x)}{F_{2 b k} (x) (F_{2 b k} (x) - F_{2 b k - b} (x))} .

Using identities (1) and (3), the above inequality is equivalent to

(F_{2 b k + 4 b} (x) - F_{2 b k + b} (x)) + (2 F_{2 b k + 2 b} (x) - 2 F_{2 b k - b} (x)) + (F_{2 b k} (x) - F_{2 b k - 3 b} (x)) > 0 .

(21)

Since $F_{n} (x)$ is monotone increasing for n and a fixed positive integer x, we have $F_{2 b k + 4 b} (x) - F_{2 b k + b} (x) > 0$ , $2 F_{2 b k + 2 b} (x) - 2 F_{2 b k - b} (x) > 0$ , and $F_{2 b k} (x) - F_{2 b k - 3 b} (x) > 0$ for any positive integer x, k and odd $b \geq 1$ . Hence the numerator of each part in parentheses of the left-hand side of inequality (21) is positive, so inequality (21) holds for any positive integer x, k and odd $b \geq 1$ . Hence inequality (20) is true. Using (20) repeatedly, we have

\begin{aligned} \sum_{k = 2 m}^{\infty} \frac{1}{F_{b k} (x)} & = \sum_{k = m}^{\infty} (\frac{1}{F_{2 b k} (x)} + \frac{1}{F_{2 b k + b} (x)}) \\ < \sum_{k = m}^{\infty} (\frac{1}{F_{2 b k} (x) - F_{2 b k - b} (x)} - \frac{1}{F_{2 b k + 2 b} (x) - F_{2 b k + b} (x)}) \\ = \frac{1}{F_{2 b m} (x) - F_{2 b m - b} (x)} . \end{aligned}

(22)

On the other hand, we prove that for any positive integer x, k and odd $b \geq 1$ ,

\frac{1}{F_{2 b k} (x)} + \frac{1}{F_{2 b k + b} (x)} > \frac{1}{F_{2 b k} (x) - F_{2 b k - b} (x) + 1} - \frac{1}{F_{2 b k + 2 b} (x) - F_{2 b k + b} (x) + 1} .

(23)

Inequality (23) is equivalent to

\frac{F_{2 b k + 2 b} (x) + 1}{F_{2 b k + b} (x) (F_{2 b k + 2 b} (x) - F_{2 b k + b} (x) + 1)} > \frac{F_{2 b k - b} (x) - 1}{F_{2 b k} (x) (F_{2 b k} (x) - F_{2 b k - b} (x) + 1)},

\begin{aligned} F_{2 b k} (x) (F_{2 b k + 2 b} (x) + 1) (F_{2 b k} (x) - F_{2 b k - b} (x) + 1) \\ > F_{2 b k + b} (x) (F_{2 b k - b} (x) - 1) (F_{2 b k + 2 b} (x) - F_{2 b k + b} (x) + 1) . \end{aligned}

Using identities (1) and (3), the above inequality is equivalent to

\begin{aligned} L_{4 b k + 3 b} (x) - L_{4 b k - b} (x) - F_{2 b k + 4 b} (x) - 2 F_{2 b k + 2 b} (x) + F_{2 b k + b + 2} (x) \\ + 3 F_{2 b k + b} (x) - 2 L_{2 b} (x) - 4 + F_{2 b k + b - 2} (x) + F_{2 b k + 2} (x) + F_{2 b k} (x) + F_{2 b k - 2} (x) \\ + 2 F_{2 b k - b} (x) + F_{2 b k - 3 b} (x) > 0 . \end{aligned}

(24)

Since $F_{n} (x)$ and $L_{n} (x)$ are monotone increasing for n and a fixed positive integer x, using identity (4), we have

\begin{aligned} L_{4 b k + 3 b} (x) - L_{4 b k - b} (x) - F_{2 b k + 4 b} (x) - 2 F_{2 b k + 2 b} (x) \\ = F_{4 b k + 3 b + 1} (x) + F_{4 b k + 3 b - 1} (x) - F_{4 b k - b + 1} (x) - F_{4 b k - b - 1} (x) - F_{2 b k + 4 b} (x) - 2 F_{2 b k + 2 b} (x) \\ > (2 x^{2} + x + 4) F_{4 b k + 3 b - 3} (x) - 5 F_{4 b k - b + 1} (x) > 0, \end{aligned}

and

\begin{aligned} F_{2 b k + b + 2} (x) + 3 F_{2 b k + b} (x) - 2 L_{2 b} (x) - 4 \\ = x F_{2 b k + b + 1} (x) - 4 + 4 F_{2 b k + b} (x) - 2 F_{2 b + 1} (x) - 2 F_{2 b - 1} (x) > 0 . \end{aligned}

Hence the numerator of each part in parentheses of the left-hand side of inequality (24) is positive, so inequality (24) holds for any positive integer x, k and odd $b \geq 1$ . Hence inequality (23) is true. Using (23) repeatedly, we have

\begin{aligned} \sum_{k = 2 m}^{\infty} \frac{1}{F_{b k} (x)} & = \sum_{k = m}^{\infty} (\frac{1}{F_{2 b k} (x)} + \frac{1}{F_{2 b k + b} (x)}) \\ > \sum_{k = m}^{\infty} (\frac{1}{F_{2 b k} (x) - F_{2 b k - b} (x) + 1} - \frac{1}{F_{2 b k + 2 b} (x) - F_{2 b k + b} (x) + 1}) \\ = \frac{1}{F_{2 b m} (x) - F_{2 b m - b} (x) + 1} . \end{aligned}

(25)

Now inequality (19) follows from (22) and (25).

Similarly, we can consider the case that $n = 2 m + 1 \geq 1$ is odd. At this time, for any odd $b \geq 1$ , Theorem 2(1) is equivalent to the inequality

\begin{aligned} \frac{1}{F_{2 b m + b} (x) - F_{2 b m} (x)} & < \sum_{k = 2 m + 1}^{\infty} \frac{1}{F_{b k} (x)} \\ \leq \frac{1}{F_{2 b m + b} (x) - F_{2 b m} (x) - 1} . \end{aligned}

(26)

First we can prove that for any positive integer x, k and odd $b \geq 1$ ,

\frac{1}{F_{2 b k + b} (x)} + \frac{1}{F_{2 b k + 2 b} (x)} < \frac{1}{F_{2 b k + b} (x) - F_{2 b k} (x) - 1} - \frac{1}{F_{2 b k + 3 b} (x) - F_{2 b k + 2 b} (x) - 1} .

(27)

Inequality (27) is equivalent to

\frac{F_{2 b k + 3 b} (x) - 1}{F_{2 b k + 2 b} (x) (F_{2 b k + 3 b} (x) - F_{2 b k + 2 b} (x) - 1)} < \frac{F_{2 b k} (x) + 1}{F_{2 b k + b} (x) (F_{2 b k + b} (x) - F_{2 b k} (x) - 1)} .

Using identities (1) and (3), the above inequality is equivalent to

\begin{aligned} L_{4 b k + 5 b} (x) - L_{4 b k + b} (x) - F_{2 b k + 5 b} (x) - 2 F_{2 b k + 3 b} (x) + (L_{2} (x) + 3) F_{2 b k + 2 b} (x) \\ - (L_{2} (x) + 1) F_{2 b k + b} (x) + F_{2 b k} (x) + 2 F_{2 b k - 2 b} (x) + 2 L_{2 b} (x) + 4 > 0 . \end{aligned}

(28)

Since $F_{n} (x)$ and $L_{n} (x)$ are monotone increasing for n and a fixed positive integer x, using identity (4), we have

\begin{aligned} L_{4 b k + 5 b} (x) - L_{4 b k + b} (x) - F_{2 b k + 5 b} (x) - 2 F_{2 b k + 3 b} (x) \\ = F_{4 b k + 5 b + 1} (x) + F_{4 b k + 5 b - 1} (x) - F_{4 b k + b + 1} (x) - F_{4 b k + b - 1} (x) - F_{2 b k + 5 b} (x) - 2 F_{2 b k + 3 b} (x) \\ > (x^{3} + 3 x) F_{4 b k + 5 b - 2} (x) + (x^{2} + 2) F_{4 b k + 5 b - 3} (x) - 5 F_{4 b k + b + 1} (x) > 0, \end{aligned}

and

(L_{2} (x) + 3) F_{2 b k + 2 b} (x) - (L_{2} (x) + 1) F_{2 b k + b} (x) > 0 .

Hence the numerator of each part in parentheses of the left-hand side of inequality (28) is positive, so inequality (28) holds for any positive integer x, k and odd $b \geq 1$ . Hence inequality (27) is true. Using (27) repeatedly, we have

\begin{aligned} \sum_{k = 2 m + 1}^{\infty} \frac{1}{F_{b k} (x)} & = \sum_{k = m}^{\infty} (\frac{1}{F_{2 b k + b} (x)} + \frac{1}{F_{2 b k + 2 b} (x)}) \\ < \sum_{k = m}^{\infty} (\frac{1}{F_{2 b k + b} (x) - F_{2 b k} (x) - 1} - \frac{1}{F_{2 b k + 3 b} (x) - F_{2 b k + 2 b} (x) - 1}) \\ = \frac{1}{F_{2 b m + b} (x) - F_{2 b m} (x) - 1} . \end{aligned}

(29)

On the other hand, we prove that for any positive integer x, k and odd $b \geq 1$ ,

\frac{1}{F_{2 b k + b} (x)} + \frac{1}{F_{2 b k + 2 b} (x)} > \frac{1}{F_{2 b k + b} (x) - F_{2 b k} (x)} - \frac{1}{F_{2 b k + 3 b} (x) - F_{2 b k + 2 b} (x)} .

(30)

Inequality (30) is equivalent to

\frac{F_{2 b k + 3 b} (x)}{F_{2 b k + 2 b} (x) (F_{2 b k + 3 b} (x) - F_{2 b k + 2 b} (x))} > \frac{F_{2 b k} (x)}{F_{2 b k + b} (x) (F_{2 b k + b} (x) - F_{2 b k} (x))} .

Using identities (1) and (3), the above inequality is equivalent to

F_{2 b k + 5 b} (x) + 2 F_{2 b k + 3 b} (x) - F_{2 b k + 2 b} (x) - F_{2 b k + b} (x) - 2 F_{2 b k} (x) - 2 F_{2 b k - 2 b} (x) > 0 .

(31)

Since $F_{n} (x)$ is monotone increasing for n and a fixed positive integer x, using identity (4), we have

\begin{aligned} F_{2 b k + 5 b} (x) + 2 F_{2 b k + 3 b} (x) - F_{2 b k + 2 b} (x) - F_{2 b k + b} (x) - 2 F_{2 b k} (x) - 2 F_{2 b k - 2 b} (x) \\ > x F_{2 b k + 5 b - 1} (x) + F_{2 b k + 5 b - 2} (x) + 2 x F_{2 b k + 3 b - 1} (x) + 2 F_{2 b k + 3 b - 2} (x) - 6 F_{2 b k + 2 b} (x) \\ > (3 x + 3) F_{2 b k + 3 b - 2} (x) - 6 F_{2 b k + 2 b} (x) > 0 . \end{aligned}

Hence the numerator of each part in parentheses of the left-hand side of inequality (31) is positive, so inequality (31) holds for any positive integer x, k and odd $b \geq 1$ . Hence inequality (30) is true. Using (30) repeatedly, we have

\begin{aligned} \sum_{k = 2 m + 1}^{\infty} \frac{1}{F_{b k} (x)} & = \sum_{k = m}^{\infty} (\frac{1}{F_{2 b k + b} (x)} + \frac{1}{F_{2 b k + 2 b} (x)}) \\ > \sum_{k = m}^{\infty} (\frac{1}{F_{2 b k + b} (x) - F_{2 b k} (x)} - \frac{1}{F_{2 b k + 3 b} (x) - F_{2 b k + 2 b} (x)}) \\ = \frac{1}{F_{2 b m + b} (x) - F_{2 b m} (x)} . \end{aligned}

(32)

Combining (29) and (32), we deduce inequality (26). This proves Theorem 2(1). □

Proof of Theorem 2(4) First we consider the case that $n = 2 m \geq 2$ is even. At this time, for any odd $b \geq 1$ , Theorem 2(4) is equivalent to

\frac{1}{L_{2 b m}^{2} (x) - L_{2 b m - b}^{2} (x) - 2} < \sum_{k = 2 m}^{\infty} \frac{1}{L_{b k}^{2} (x)} \leq \frac{1}{L_{2 b m}^{2} (x) - L_{2 b m - b}^{2} (x) - 3} .

(33)

Now we prove that for any positive integer k, $x \geq 2$ and odd $b \geq 1$ ,

\frac{1}{L_{2 b k}^{2} (x)} + \frac{1}{L_{2 b k + b}^{2} (x)} > \frac{1}{L_{2 b k}^{2} (x) - L_{2 b k - b}^{2} (x) - 2} - \frac{1}{L_{2 b k + 2 b}^{2} (x) - L_{2 b k + b}^{2} (x) - 2} .

(34)

Inequality (34) is equivalent to

\frac{L_{2 b k + 2 b}^{2} (x) - 2}{L_{2 b k + b}^{2} (x) (L_{2 b k + 2 b}^{2} (x) - L_{2 b k + b}^{2} (x) - 2)} > \frac{L_{2 b k - b}^{2} (x) + 2}{L_{2 b k}^{2} (x) (L_{2 b k}^{2} (x) - L_{2 b k - b}^{2} (x) - 2)} .

Using identity (2), the above inequality is equivalent to

\begin{aligned} 4 L_{8 b k + 4 b} (x) - 4 L_{8 b k} (x) + 2 L_{8 b k + 2 b} (x) - L_{4 b k + 8 b} (x) + 6 L_{4 b k + 4 b} (x) \\ - 3 L_{4 b k + 2 b} (x) - L_{4 b k} (x) + 6 L_{4 b k - 2 b} (x) - L_{4 b k - 6 b} (x) > 0 . \end{aligned}

(35)

Since $L_{n} (x)$ is monotone increasing for n and a fixed positive integer x, for any positive integer k, $x \geq 2$ and odd $b \geq 1$ , we have $4 L_{8 b k + 4 b} (x) - 4 L_{8 b k} (x) > 0$ , $2 L_{8 b k + 2 b} (x) - L_{4 b k + 8 b} (x) > 0$ , $6 L_{4 b k + 4 b} (x) - 3 L_{4 b k + 2 b} (x) - L_{4 b k} (x) > 0$ , $6 L_{4 b k - 2 b} (x) - L_{4 b k - 6 b} (x) > 0$ .

Hence the numerator of the left-hand side of inequality (35) is positive, so inequality (35) holds for any positive integer k, $x \geq 2$ and odd $b \geq 1$ . Hence inequality (34) is true. Using (34) repeatedly, we have

\begin{aligned} \sum_{k = 2 m}^{\infty} \frac{1}{L_{b k}^{2} (x)} \\ = \sum_{k = m}^{\infty} (\frac{1}{L_{2 b k}^{2} (x)} + \frac{1}{L_{2 b k + b}^{2} (x)}) \\ > \sum_{k = m}^{\infty} (\frac{1}{L_{2 b k}^{2} (x) - L_{2 b k - b}^{2} (x) - 2} - \frac{1}{L_{2 b k + 2 b}^{2} (x) - L_{2 b k + b}^{2} (x) - 2}) \\ = \frac{1}{L_{2 b m}^{2} (x) - L_{2 b m - b}^{2} (x) - 2} . \end{aligned}

(36)

On the other hand, we prove that for any positive integer k, $x \geq 2$ and odd $b \geq 1$ ,

\frac{1}{L_{2 b k}^{2} (x)} + \frac{1}{L_{2 b k + b}^{2} (x)} < \frac{1}{L_{2 b k}^{2} (x) - L_{2 b k - b}^{2} (x) - 3} - \frac{1}{L_{2 b k + 2 b}^{2} (x) - L_{2 b k + b}^{2} (x) - 3} .

(37)

Inequality (37) is equivalent to

\frac{L_{2 b k + 2 b}^{2} (x) - 3}{L_{2 b k + b}^{2} (x) (L_{2 b k + 2 b}^{2} (x) - L_{2 b k + b}^{2} (x) - 3)} > \frac{L_{2 b k - b}^{2} (x) + 3}{L_{2 b k}^{2} (x) (L_{2 b k}^{2} (x) - L_{2 b k - b}^{2} (x) - 3)} .

Using identity (3), the above inequality is equivalent to

\begin{aligned} L_{8 b k + 6 b} (x) - 4 L_{8 b k + 4 b} (x) - 2 L_{8 b k + 2 b} (x) + 4 L_{8 b k} (x) - L_{8 b k - 2 b} (x) + L_{4 b k + 8 b} (x) \\ - 6 L_{4 b k + 4 b} (x) + 6 L_{4 b k + 2 b} (x) + 4 L_{4 b k} (x) - 6 L_{4 b k - 2 b} (x) + L_{4 b k - 6 b} (x) > 0 . \end{aligned}

(38)

Since $L_{n} (x)$ is monotone increasing for n and a fixed positive integer x, for any positive integer k, $x \geq 2$ and odd $b \geq 1$ , we have

\begin{aligned} L_{8 b k + 6 b} (x) - 4 L_{8 b k + 4 b} (x) - 2 L_{8 b k + 2 b} (x) \\ = (x^{2} + 1) L_{8 b k + 6 b - 1} (x) + x L_{8 b k + 6 b - 3} (x) - 4 L_{8 b k + 4 b} (x) - 2 L_{8 b k + 2 b} (x) \\ > (x^{2} - 3) L_{8 b k + 4 b} (x) + (x - 2) L_{8 b k + 2 b} (x) > 0, \end{aligned}

and

\begin{aligned} L_{4 b k + 8 b} (x) - 6 L_{4 b k + 4 b} (x) \\ = (x^{2} + 1) L_{4 b k + 8 b - 1} (x) + x L_{4 b k + 8 b - 3} (x) - 6 L_{4 b k + 4 b} (x) \\ > 7 L_{4 b k + 8 b - 3} (x) - 6 L_{4 b k + 4 b} (x) > 0, \end{aligned}

and $4 L_{8 b k} (x) - L_{8 b k - 2 b} (x) > 0$ , $4 L_{4 b k} (x) - 6 L_{4 b k - 2 b} (x) > 0$ .

Hence the numerator of the left-hand side of inequality (38) is positive, so inequality (38) holds for any positive integer k, $x \geq 2$ and even $b \geq 1$ . Hence inequality (37) is true. Using (37) repeatedly, we have

\begin{aligned} \sum_{k = 2 m}^{\infty} \frac{1}{L_{b k}^{2} (x)} & = \sum_{k = m}^{\infty} (\frac{1}{L_{2 b k}^{2} (x)} + \frac{1}{L_{2 b k + b}^{2} (x)}) \\ < \sum_{k = m}^{\infty} (\frac{1}{L_{2 b k}^{2} (x) - L_{2 b k - b}^{2} (x) - 3} - \frac{1}{L_{2 b k + 2 b}^{2} (x) - L_{2 b k + b}^{2} (x) - 3}) \\ = \frac{1}{L_{2 b m}^{2} (x) - L_{2 b m - b}^{2} (x) - 3} . \end{aligned}

(39)

Now inequality (33) follows from (36) and (39).

Similarly, we can consider the case that $n = 2 m + 1 \geq 3$ is odd. At this time, for any odd $b \geq 1$ , Theorem 2(4) is equivalent to the inequality

\frac{1}{L_{2 b m + b}^{2} (x) - L_{2 b m}^{2} (x) + 3} < \sum_{k = 2 m + 1}^{\infty} \frac{1}{L_{b k}^{2} (x)} \leq \frac{1}{L_{2 b m + b}^{2} (x) - L_{2 b m}^{2} (x) + 2} .

(40)

Now we prove that for any positive integer k, $x \geq 2$ and odd $b \geq 1$ ,

\frac{1}{L_{2 b k + b}^{2} (x)} + \frac{1}{L_{2 b k + 2 b}^{2} (x)} > \frac{1}{L_{2 b k + b}^{2} (x) - L_{2 b k}^{2} (x) + 3} - \frac{1}{L_{2 b k + 3 b}^{2} (x) - L_{2 b k + 2 b}^{2} (x) + 3} .

(41)

Inequality (41) is equivalent to

\frac{L_{2 b k + 3 b}^{2} (x) + 3}{L_{2 b k + 2 b}^{2} (x) (L_{2 b k + 3 b}^{2} (x) - L_{2 b k + 2 b}^{2} (x) + 3)} > \frac{L_{2 b k}^{2} (x) - 3}{L_{2 b k + b}^{2} (x) (L_{2 b k + b}^{2} (x) - L_{2 b k}^{2} (x) + 3)} .

Using identity (2), the above inequality is equivalent to

\begin{aligned} L_{8 b k + 10 b} (x) - 4 L_{8 b k + 8 b} (x) + 4 L_{8 b k + 4 b} (x) - L_{8 b k + 2 b} (x) - L_{4 b k + 10 b} (x) \\ + 6 L_{4 b k + 6 b} (x) - 4 L_{4 b k + 4 b} (x) - 4 L_{4 b k + 2 b} (x) + 6 L_{4 b k} (x) - L_{4 b k - 4 b} (x) > 0 . \end{aligned}

(42)

Since $L_{n} (x)$ is monotone increasing for n and a fixed positive integer x, for any positive integer k, $x \geq 2$ , and odd $b \geq 1$ , we have

\begin{aligned} L_{8 b k + 10 b} (x) - 4 L_{8 b k + 8 b} (x) & = (x^{2} + 1) L_{8 b k + 10 b - 2} (x) + x L_{8 b k + 10 b - 3} (x) - 4 L_{8 b k + 8 b} (x) \\ > 5 L_{8 b k + 8 b} (x) - 4 L_{8 b k + 8 b} (x) + x L_{8 b k + 10 b - 3} (x) > 0, \end{aligned}

and

\begin{aligned} 6 L_{4 b k + 6 b} (x) - 4 L_{4 b k + 4 b} (x) - 4 L_{4 b k + 2 b} (x) \\ = 6 x L_{4 b k + 6 b - 1} (x) + 6 L_{4 b k + 6 b - 2} (x) - 4 L_{4 b k + 4 b} (x) - 4 L_{4 b k + 2 b} (x) > 0, \end{aligned}

and $6 L_{4 b k} (x) - L_{4 b k - 4 b} (x) > 0$ , $4 L_{8 b k + 4 b} (x) - L_{8 b k + 2 b} (x) - L_{4 b k + 10 b} (x) > 0$ .

Hence the numerator of the left-hand side of inequality (42) is positive, so inequality (42) holds for any positive integer k, $x \geq 2$ and odd $b \geq 1$ . Hence inequality (41) is true. Using (41) repeatedly, we have

\begin{aligned} \sum_{k = 2 m + 1}^{\infty} \frac{1}{L_{b k}^{2} (x)} & = \sum_{k = m}^{\infty} (\frac{1}{L_{2 b k + b}^{2} (x)} + \frac{1}{L_{2 b k + 2 b}^{2} (x)}) \\ > \sum_{k = m}^{\infty} (\frac{1}{L_{2 b k + b}^{2} (x) - L_{2 b k}^{2} (x) + 3} - \frac{1}{L_{2 b k + 3 b}^{2} (x) - L_{2 b k + 2 b}^{2} (x) + 3}) \\ = \frac{1}{L_{2 b m + b}^{2} (x) - L_{2 b m}^{2} (x) + 3} . \end{aligned}

(43)

On the other hand, we prove that for any positive integer k, $x \geq 2$ and odd $b \geq 1$ ,

\frac{1}{L_{2 b k + b}^{2} (x)} + \frac{1}{L_{2 b k + 2 b}^{2} (x)} < \frac{1}{L_{2 b k + b}^{2} (x) - L_{2 b k}^{2} (x) + 2} - \frac{1}{L_{2 b k + 3 b}^{2} (x) - L_{2 b k + 2 b}^{2} (x) + 2} .

(44)

Inequality (44) is equivalent to

\frac{L_{2 b k + 3 b}^{2} (x) + 2}{L_{2 b k + 2 b}^{2} (x) (L_{2 b k + 3 b}^{2} (x) - L_{2 b k + 2 b}^{2} (x) + 2)} > \frac{L_{2 b k}^{2} (x) - 2}{L_{2 b k + b}^{2} (x) (L_{2 b k + b}^{2} (x) - L_{2 b k}^{2} (x) + 2)} .

Using identity (2), the above inequality is equivalent to

\begin{aligned} 4 L_{8 b k + 8 b} (x) - 4 L_{8 b k + 4 b} (x) + L_{4 b k + 10 b} (x) - 6 L_{4 b k + 6 b} (x) \\ + L_{4 b k + 4 b} (x) + L_{4 b k + 2 b} (x) - 6 L_{4 b k} (x) + 6 L_{4 b k - 4 b} (x) > 0 . \end{aligned}

(45)

It is clear that inequality (45) holds for any positive integer k, $x \geq 2$ and odd $b \geq 1$ . So, inequality (44) is true. Using (44) repeatedly, we have

\begin{aligned} \sum_{k = 2 m + 1}^{\infty} \frac{1}{L_{b k}^{2} (x)} & = \sum_{k = m}^{\infty} (\frac{1}{L_{2 b k + b}^{2} (x)} + \frac{1}{L_{2 b k + 2 b}^{2} (x)}) \\ < \sum_{k = m}^{\infty} (\frac{1}{L_{2 b k + b}^{2} (x) - L_{2 b k}^{2} (x) + 2} - \frac{1}{L_{2 b k + 3 b}^{2} (x) - L_{2 b k + 2 b}^{2} (x) + 2}) \\ = \frac{1}{L_{2 b m + b}^{2} (x) - L_{2 b m}^{2} (x) + 2} . \end{aligned}

(46)

Combining (43) and (46), we deduce inequality (40). This proves Theorem 2(4). □

References

Falcón S, Plaza Á: On the Fibonacci k -numbers. Chaos Solitons Fractals 2007, 32: 1615–1624. 10.1016/j.chaos.2006.09.022
Article MathSciNet Google Scholar
Ma R, Zhang W: Several identities involving the Fibonacci numbers and Lucas numbers. Fibonacci Q. 2007, 45: 164–170.
Google Scholar
Wang T, Zhang W: Some identities involving Fibonacci, Lucas polynomials and their applications. Bull. Math. Soc. Sci. Math. Roum. 2012, 55: 95–103.
Google Scholar
Yi Y, Zhang W: Some identities involving the Fibonacci polynomials. Fibonacci Q. 2002, 40: 314–318.
MathSciNet Google Scholar
Navas L: Analytic continuation of the Fibonacci Dirichlet series. Fibonacci Q. 2001, 39: 409–418.
MathSciNet Google Scholar
Elsner C, Shimomura S, Shiokawa I: Algebraic relations for reciprocal sums of odd sums of Fibonacci numbers. Acta Arith. 2011, 148(3):205–223. 10.4064/aa148-3-1
Article MathSciNet Google Scholar
Ohtsuka H, Nakamura S: On the sum of reciprocal Fibonacci numbers. Fibonacci Q. 2008/2009, 46/47: 153–159.
Google Scholar
Wu Z, Zhang W: The sums of the reciprocal of Fibonacci polynomials and Lucas polynomials. J. Inequal. Appl. 2012., 2012: Article ID 134
Google Scholar
Holliday S, Komatsu T: On the sum of reciprocal generalized Fibonacci numbers. Integers 2011, 11: 441–455.
Article MathSciNet Google Scholar
Zhang G: The infinite sum of reciprocal of the Fibonacci numbers. J. Math. Res. Exposition 2011, 31: 1030–1034.
MathSciNet Google Scholar
Zhang W, Wang T: The infinite sum of reciprocal Pell numbers. Appl. Math. Comput. 2012, 218: 6164–6167. 10.1016/j.amc.2011.11.090
Article MathSciNet Google Scholar
Komatsu T: On the nearest integer of the sum of reciprocal Fibonacci numbers. Aportaciones Matematicas Investigacion 2011, 20: 171–184.
MathSciNet Google Scholar
Komatsu T, Laohakosol V: On the sum of reciprocals of numbers satisfying a recurrence relation of orders. J. Integer Seq. 2010., 13: Article ID 10.5.8
Google Scholar
Kilic E, Arikan T: More on the infinite sum of reciprocal usual Fibonacci, Pell and higher order recurrences. Appl. Math. Comput. 2013, 219: 7783–7788. 10.1016/j.amc.2013.02.003
Article MathSciNet Google Scholar

Download references

Acknowledgements

The authors express their gratitude to the referee for very helpful and detailed comments. This work is supported by the N.S.F. (11071194, 11001218) of P.R. China and G.I.C.F. (YZZ12062) of NWU.

Author information

Authors and Affiliations

Department of Mathematics, Northwest University, Xi’an, Shaanxi, P.R. China
Zhengang Wu & Wenpeng Zhang

Authors

Zhengang Wu
View author publications
You can also search for this author in PubMed Google Scholar
Wenpeng Zhang
View author publications
You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhengang Wu.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

WZ proposed if we could obtain some generalizations of [8, 10], and [11]. ZW obtained the theorems and completed the proof. All authors read and approved the final manuscript.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Wu, Z., Zhang, W. Several identities involving the Fibonacci polynomials and Lucas polynomials. J Inequal Appl 2013, 205 (2013). https://doi.org/10.1186/1029-242X-2013-205

Download citation

Received: 16 November 2012
Accepted: 12 April 2013
Published: 25 April 2013
DOI: https://doi.org/10.1186/1029-242X-2013-205

Several identities involving the Fibonacci polynomials and Lucas polynomials

Abstract

1 Introduction

2 Proof of theorems

References

Acknowledgements

Author information

Authors and Affiliations

Corresponding author

Additional information

Competing interests

Authors’ contributions

Rights and permissions

About this article

Cite this article

Share this article

Keywords