Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 20 November 2020 doi:10.20944/preprints202011.0539.

v1

Fibonacci-Zeta infinite series associated with the

polygamma functions
Kunle Adegoke
adegoke00@gmail.com

Department of Physics and Engineering Physics,

Obafemi Awolowo University, 220005 Ile-Ife, Nigeria

2010 Mathematics Subject Classification: Primary 11B39; Secondary 11B37.

Keywords: Fibonacci number, Lucas number, summation identity, series, digamma func-
tion, polygamma function, zeta function.

Abstract
We derive new infinite series involving Fibonacci numbers and Riemann zeta num-
bers. The calculations are facilitated by evaluating linear combinations of polygamma
functions of the same order at certain arguments.

1 Introduction
The Fibonacci numbers, Fn , and the Lucas numbers, Ln , are defined, for all integers n by
the Binet formulas:
αn − β n
Fn = , Ln = α n + β n , (1.1)
α−β
where α and β are the zeros of the characteristic polynomial,√x2 − x − 1, of the Fibonacci
sequence. Thus α +√β = 1 and αβ = −1; so that α = (1 + 5)/2 (the golden ratio) and
β = −1/α = (1 − 5)/2. Koshy [8] and Vajda [10] have written excellent books dealing
with Fibonacci and Lucas numbers.
Our purpose in writing this paper is to employ the properties of the polygamma functions
to derive infinite series identities involving Fibonacci numbers, Lucas numbers and the
Riemann zeta numbers. We will obtain sums such as
∞
à √ ! à √ !
X (j + 1)(j + 2) 2π 3 π 5 π 5
2
j
ζ(j + 3)F2j = √ tan sec ,
j=1
3 5 6 6

and à √ !
∞
X
j−1 2 2π 5
(−1) jζ(j + 1)Lj−1 = π sec − 3,
j=1
2

and, in fact, more general series. Here ζ(n) is the Riemann zeta function.

© 2020 by the author(s). Distributed under a Creative Commons CC BY license.

Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 20 November 2020 doi:10.20944/preprints202011.0539.v1

The digamma function, ψ(z), is the logarithmic derivative of the Gamma function:
d Γ0 (z)
ψ(z) = log Γ(z) = ,
dz Γ(z)
where the Gamma function is defined for <(z) > 0 by
Z ∞ Z ∞
Γ(z) = −t z−1
e t dt = (log(1/t))z−1 dt ,
0 0

and is extended to the rest of the complex plane, excluding the non-positive integers,
by analytic continuation. The Gamma function has a simple pole at each of the points
z = · · · , −3, −2, −1, 0. The Gamma function extends the classical factorial function to the
complex plane: Γ(z) = (z − 1)!
The nth polygamma function ψ (n) (z) is the nth derivative of the digamma function:

dn+1 dn (n)
ψ (n) (z) = log Γ(z) = ψ (z), ψ (0) (z) = ψ(z) .
dz n+1 dz n
The polygamma functions satisfy the recurrence relation,
m!
ψ (m) (z + 1) = ψ (m) (z) + (−1)m , (1.2)
z m+1
and the reflection relation,
dm
(−1)m ψ (m) (1 − z) − ψ (m) (z) = π cot(πz) . (1.3)
dz m
The Taylor series for the polygamma functions is
∞
X (m + j)!
(−1)m+j+1 ζ(m + j + 1)z j = ψ (m) (z + 1), m ≥ 1, (1.4)
j=0
j!

∞
X
−γ+ (−1)j+1 ζ(j + 1)z j = ψ(z + 1) , (1.5)
j=1

where γ is the Euler-Mascheroni constant and ζ(n), n ∈ C, is the Riemann zeta function,
defined by
X ∞
1
ζ(n) = n
, <(n) > 1 ,
j=1
j

and analytically continued to all n ∈ C with <(n) > 0, n 6= 1 through

X∞
1 (−1)j+1
ζ(n) = .
1 − 21−n j=1 jn

Further information on the polygamma functions can be found in the books by Erdé-
lyi et al. [3, §1.16] and Srivastava and Choi [9, p. 33]. The book by Edwards [2] is a good
treatise on the Riemann zeta function.
Infinite series involving Fibonacci numbers and Riemann zeta numbers were also derived
by Frontczak [4, 5, 6], Frontczak and Goy [7] and Adegoke [1].

2
Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 20 November 2020 doi:10.20944/preprints202011.0539.v1

2 Preliminary results
Here we derive more functional equations for the polygamma functions. We also evaluate
required linear combinations of the polygamma function at appropriate arguments.

2.1 Functional equations

Writing −z for z in the recurrence relation (1.2) and making use of the reflection rela-
tion (1.3), we obtain the duplication formula
dm m!
ψ (m) (−z) − (−1)m ψ (m) (z) = (−1)m π m
cot(πz) + m+1 , (2.1)
dz z
and consequently,
m! m!
ψ (m) (−x) − ψ (m) (−y) = ψ (m) (x) − ψ (m) (y) + m+1 − m+1
x y
¯ ¯ (2.2)
dm ¯ d m ¯
+ π m cot(πz)¯¯ − π m cot(πz)¯¯ , m even ,
dz z=x dz z=y

m! m!
ψ (m) (−x) + ψ (m) (−y) = −(ψ (m) (x) + ψ (m) (y)) + m+1 + m+1
x y
¯ ¯ (2.3)
dm ¯ dm ¯
− π m cot(πz)¯¯ − π m cot(πz)¯¯ , m odd .
dz z=x dz z=y

In particular, if x + y = 1, then,
¯
d m ¯ m! m!
ψ (m) (−x) − ψ (m) (−y) = −π m cot(πz)¯¯ + m+1 − m+1 , m even , (2.4)
dz z=y x y
¯
dm ¯ m! m!
ψ (m)
(−x) + ψ (m)
(−y) = −π m cot(πz)¯¯ + m+1 + m+1 , m odd . (2.5)
dz z=y x y
Writing 1/2 − z for z in (1.3) gives
µ ¶ µ ¶ ¯
1 1 dm ¯
m (m)
(−1) ψ +z −ψ (m)
− z = π m cot(πx)¯¯ . (2.6)
2 2 dx x=1/2−z

Eliminating ψ (m) (z) between (1.2) and (1.3) gives

dm (−1)m m!
ψ (m) (1 + z) − (−1)m ψ (m) (1 − z) = −π cot(πz) + . (2.7)
dz m z m+1
If x − y = 1, then the recurrence relation gives
(−1)m m!
ψ (m) (x) − ψ (m) (y) = , (2.8)
y m+1
while if x + y = 1, the reflection relation gives
¯
dm ¯
ψ (m) m
(x) − (−1) ψ (m)
(y) = −π m cot(πz)¯¯ . (2.9)
dz z=x

3
Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 20 November 2020 doi:10.20944/preprints202011.0539.v1

The recurrence relation has the following consequences:

ψ (m) (x + 1) − ψ (m) (y + 1) = ψ (m) (x) − ψ (m) (y)

xm+1 − y m+1 (2.10)
− (−1)m m! ,
(xy)m+1

ψ (m) (x + 1) + ψ (m) (y + 1) = ψ (m) (x) + ψ (m) (y)

xm+1 + y m+1 (2.11)
+ (−1)m m! .
(xy)m+1

For any x and y such that 1 − x ∈ / Z− , 1 − y ∈

/ Z− and x 6= 1, y 6= 1, relation (2.7) implies
¡ ¢
ψ (m) (1 + x) − ψ (m) (1 + y) = (−1)m ψ (m) (1 − x) − ψ (m) (1 − y)
dm dm
− π m cot(πx) + π m cot(πy)
dx dy (2.12)
m m
(−1) m! (−1) m!
+ − ,
xm+1 y m+1

¡ ¢
ψ (m) (1 + x) + ψ (m) (1 + y) = (−1)m ψ (m) (1 − x) + ψ (m) (1 − y)
dm dm
− π m cot(πx) − π m cot(πy)
dx dy (2.13)
(−1) m! (−1)m m!
m
+ + .
xm+1 y m+1

From the functional equation (2.12), it follows that if m is even and x + y = 1, then,
¯
dm ¯ m! m!
ψ (1 + x) − ψ (1 + y) = π m cot(πz)¯¯
(m) (m)
+ m+1 − m+1 . (2.14)
dz z=y x y

From the functional equation (2.13), it follows that if m is odd and x + y = 1, then,
¯
dm ¯ m! m!
ψ (1 + x) + ψ (1 + y) = π m cot(πz)¯¯
(m) (m)
− m+1 − m+1 . (2.15)
dz z=y x y

If m is an even number and x + y = 2, equation (2.12) gives

¯
dm ¯ m! m! m!
ψ (1 + x) − ψ (1 + y) = −π m cot(πz)¯¯
(m) (m)
+ + − , (2.16)
dz z=x (1 − y)m+1 xm+1 y m+1

while if m is an odd number and x + y = 2, equation (2.13) gives

¯
dm ¯ m! m! m!
ψ (1 + x) + ψ (1 + y) = −π m cot(πz)¯¯
(m) (m)
− m+1
− m+1 − m+1 . (2.17)
dz z=x (1 − y) x y

Note that we used

¯ ¯
dm ¯ d m ¯
π m cot(πz)¯¯ + π m cot(πz)¯¯ = 0, m even ,
dz z=y dz z=1−y

4
Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 20 November 2020 doi:10.20944/preprints202011.0539.v1

and ¯ ¯
dm ¯ d m ¯
−π m cot(πz)¯¯ + π m cot(πz)¯¯ = 0, m odd
dz z=y dz z=1−y

From (2.6) we have

µ µ ¶ µ ¶¶ µ ¶ µ ¶
m (m) 1 (m) 1 (m) 1 (m) 1
(−1) ψ +x −ψ +y =ψ −x −ψ −y
2 2 2 2
¯ ¯
dm ¯ dm ¯
¯
+ π m cot(πz)¯ − π m cot(πz)¯¯ ,
dz z=1/2−x dz z=1/2−y
(2.18)

µ µ ¶ µ ¶¶ µ ¶ µ ¶
m (m) 1 (m) 1 (m) 1 (m) 1
(−1) ψ +x +ψ +y = −ψ −x −ψ −y
2 2 2 2
¯ ¯
dm ¯ dm ¯
+ π m cot(πz)¯¯ + π m cot(πz)¯¯ .
dz z=1/2−x dz z=1/2−y
(2.19)

Thus, if m is even and x + y = 1, then from (2.18) and the duplication formula, we have
µ ¶ µ ¶ ¯
1 1 dm ¯ m!
ψ (m)
+x −ψ (m)
+ y = −π m cot(πz)¯¯ + , (2.20)
2 2 dz z=1/2−y (x − 1/2)m+1

and if m is odd and x + y = 1, then from (2.19) and the duplication formula, we have
µ ¶ µ ¶ ¯
1 1 dm ¯ m!
ψ (m)
+x +ψ (m)
+ y = −π m cot(πz)¯¯ − . (2.21)
2 2 dz z=1/2−y (x − 1/2)m+1

2.2 Evaluation at various arguments

Lemma 1. We have
¯
dm ¯
ψ (α) − ψ (β) = −π m cot(πz)¯¯
(m) (m)
, m even , (2.22)
dz z=α
¯
dm ¯
ψ (α) + ψ (β) = −π m cot(πz)¯¯
(m) (m)
, m odd , (2.23)
dz z=α
¯
dm ¯ √
ψ (α ) − ψ (β ) = π m cot(πz)¯¯
(m) 2 (m) 2
+ m!Fm+1 5, m even , (2.24)
dz z=β
¯
d m ¯
ψ (α ) + ψ (β ) = −π m cot(πz)¯¯
(m) 2 (m) 2
− m!Lm+1 , m odd , (2.25)
dz z=β

¯
dm ¯ m! m! √
ψ (m) 3
(α ) − ψ (m)
(β ) = π m cot(πz)¯¯
3
+ √ + m+1 Fm+1 5, m even , (2.26)
dz z=2β ( 5)m+1 2

¯
d m ¯ m! m!
ψ (m) (α3 ) + ψ (m) (β 3 ) = −π m cot(πz)¯¯ − √ − m+1 Lm+1 , m odd , (2.27)
dz z=2β ( 5)m+1 2

5
Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 20 November 2020 doi:10.20944/preprints202011.0539.v1

¯
± ± dm ¯ m!2m+1
ψ (α 2) − ψ (β 2) = −π m cot(πz)¯¯ √ + √
(m) 3 (m) 3
, m even , (2.28)
dz z= 5/2 ( 5)m+1
¯
± ± dm ¯ m!2m+1
ψ (α 2) + ψ (β 2) = −π m cot(πz)¯¯ √ − √
(m) 3 (m) 3
, m odd , (2.29)
dz z= 5/2 ( 5)m+1
¯
dm ¯
ψ (α /Lr ) − ψ (β /Lr ) = −π m cot(πz)¯¯
(m) r (m) r
, m even , (2.30)
dz z=αr /Lr
¯
dm ¯
ψ (α /Lr ) + ψ (β /Lr ) = −π m cot(πz)¯¯
(m) r (m) r
, m odd , (2.31)
dz z=αr /Lr
µ r ¶ µ r ¶
(m) α (m) β √
ψ √ −ψ √ = (−1)rm+r+m m!Frm+1 (αr 5)m+1 , (2.32)
Fr 5 Fr 5

ψ (m) (1 + 2αr /Lr ) − ψ (m) (1 + 2β r /Lr )

¯ √
dm ¯ m!Lm+1 (−1)r
m!Lm+1
F r(m+1) 5
= −π m cot(πz)¯¯ + √r − r
m+1
, m even ,
dz r
z=2α /Lr(F 5)m+1
r 2
(2.33)

ψ (m) (1 + 2αr /Lr ) + ψ (m) (1 + 2β r /Lr )

¯
dm ¯ m!Lm+1 m!Lm+1 Lr(m+1) (2.34)
= −π m cot(πz)¯¯ − √r − r
m+1
, m odd ,
dz z=2αr /Lr (Fr 5)m+1 2

ψ (m) (−αr /Lr ) − ψ (m) (−β r /Lr )

¯
dm ¯ √ (2.35)
= −π m cot(πz)¯¯ − m!Lm+1
r (−1)r Fr(m+1) 5, m even ,
dz z=β r /Lr

ψ (m) (−αr /Lr ) + ψ (m) (−β r /Lr )

¯
dm ¯ (2.36)
= −π m cot(πz)¯¯ + m!Lm+1
r Lr(m+1) , m odd .
dz z=β r /Lr

Proof. To prove (2.22) and (2.23), set x = α, y = β in (2.9). To prove (2.24) and (2.25),
set x = α, y = β in (2.14) and (2.15). Setting x = 2α, y = 2β in (2.16) and (2.17)
gives (2.26) and (2.27). To prove (2.28) and (2.29) set x = α, y = β in (2.20) and (2.21).
Use of x = αr /Lr and y = β √
r
/Lr in (2.9) gives√(2.30) and (2.31). Identity (2.32) is
obtained by setting x = α /(Fr 5) and y = β r /(Fr 5) in (2.8). Identities (2.33) and (2.34)
r

follow from (2.16) and (2.17), upon setting x = 2αr /Lr and y = 2β r /Lr . Identities (2.35)
and (2.36) are obtained from (2.4) and (2.5), with x = αr /Lr and y = β r /Lr .

6
Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 20 November 2020 doi:10.20944/preprints202011.0539.v1

3 Main results
Theorem. If r is an integer, then,
∞
X (m + j)!
(−1)j+1 ζ(m + j + 1)Frj z j
j!
j=1 (F)
1 © ª
= √ ψ (m) (1 + αr z) − ψ (m) (1 + β r z) , m even, m ≥ 0 ,
5
∞
X (m + j)!
(−1)j ζ(m + j + 1)Lrj z j
j=0
j! (L)
(m) r (m) r
=ψ (1 + α z) + ψ (1 + β z), m odd, m ≥ 1 .
Proof. Writing αr z for z in the Taylor series (1.4), we obtain
∞
X (m + j)!
(−1)m+j+1 ζ(m + j + 1)αrj z j = ψ (m) (αr z + 1) . (3.1)
j=0
j!

Similarly,
∞
X (m + j)!
(−1)m+j+1 ζ(m + j + 1)β rj z j = ψ (m) (β r z + 1) . (3.2)
j=0
j!
If m is even, then subtraction of (3.2) from (3.1) gives (F) while if m is odd, their addition
produces (L), on account of the Binet formulas.
Note that, in view of identities (2.10) and (2.11), the right hand side of (F) and (L) can be
expressed as:
1 © ª
√ ψ (m) (αr z + 1) − ψ (m) (β r z + 1)
5
(3.3)
1 © (m) r (m) r
ª (−1)r m!
= √ ψ (α z) − ψ (β z) − Fr(m+1) , m even ,
5 z m+1

ψ (m) (αr z + 1) + ψ (m) (β r z + 1)

m! (3.4)
= ψ (m) (αr z) + ψ (m) (β r z) − Lr(m+1) , m odd .
z m+1
Corollary 1. We have
∞
X (m + j)! ζ(m + j + 1)
(−1)j+1 F3j
j=1
j! 2j
à ¯ ! (3.5)
1 dm ¯ m! 2 m+1
= −√ π m cot(πz)¯¯ √ − √ + m! 2m+1 F3m+3 , m even ,
5 dz z= 5/2 ( 5) m+1

∞
X (m + j)! ζ(m + j + 1)
(−1)j L3j
j=0
j! 2j
¯ (3.6)
dm ¯ m! 2m+1
= − π m cot(πz)¯¯ √ − √ − m! 2m+1 L3m+3 , m odd .
dz z= 5/2 ( 5) m+1

7
Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 20 November 2020 doi:10.20944/preprints202011.0539.v1

Proof. Set r = 3, z = 1/2 in (F) and (L), noting (3.3) and (3.4) and using (2.28) and (2.29).

Example 1. We have
∞
X (j + 1)(j + 2)
(−1)j+1 ζ(j + 3)F3j
j=1
2j
à √ ! à √ ! (3.7)
2π 3 π 5 π 5 13616
= − √ cot csc2 + ,
5 2 2 25

∞
à √ !
X (j + 1) π 5 364
(−1)j j
ζ(j + 2)L3j = π 2 csc2 − . (3.8)
j=0
2 2 5

Proof. To prove (3.7), set m = 2 in (3.5), while m = 1 in (3.6) proves (3.8).

Corollary 2. If r is an integer, then,

∞
X (m + j)!
(−1)j+1 ζ(m + j + 1)Frj
j=1
j! Ljr
¯ (3.9)
π dm ¯
=√ cot(πz)¯ − (−1)r m!Lm+1 Fr(m+1) , m even ,
5 dz m ¯ r
z=β r /Lr

∞
X (m + j)!
(−1)j ζ(m + j + 1)Lrj
j=0
j! Ljr
¯ (3.10)
dm ¯
= −π m cot(πz)¯¯ − m!Lm+1
r Lr(m+1) , m odd .
dz r
z=β /Lr

Proof. Set z = 1/Lr in (F) and (L), noting (3.3) and (3.4) and using (2.30) and (2.31).

Example 2. We have
∞
X (j + 1)(j + 2)
(−1)j+1 ζ(j + 3)F2j
j=1
3j
à √ ! à √ ! (3.11)
2π 3 π 5 π 5
= √ tan sec2 − 432 ,
5 6 6

∞
à √ !
X π 5
(−1)j−1 jζ(j + 1)Lj−1 = π 2 sec2 − 3. (3.12)
j=1
2

Proof. Set m = 2, r = 2 in (3.9) to prove (3.11) and m = 1, r = 1 in (3.10) to prove (3.12).

8
Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 20 November 2020 doi:10.20944/preprints202011.0539.v1

Corollary 3. If r is an integer with |r| > 1, then,

∞
X (m + j)! j
(−1)j+1 2 ζ(m + j + 1)Frj
j=1
j! Ljr
( ¯ )
1 dm ¯ m!L m+1 m!Lm+1 Fr(m+1)
= −√ π m cot(πz)¯¯ − √r − (−1)r r
m+1
, m even ,
5 dz z=2αr /Lr (Fr 5)m+1 2
(3.13)

∞
X (m + j)! j
(−1)j 2 ζ(m + j + 1)Lrj
j=0
j!Ljr
¯ (3.14)
dm ¯ m!Lm+1 m!Lm+1 Lr(m+1)
= − π m cot(πz)¯¯ − √r − r
m+1
, m odd .
dz z=2αr /Lr (Fr 5)m+1 2
Proof. Set z = 2/Lr in (F) and (L) and use (2.33) and (2.34).
Example 3. We have
∞
X (j + 1)(j + 2)
(−1)j+1 ζ(j + 3)F3j
j=1
2j
à √ ! à √ ! (3.15)
13616 2π 3 π 5 π 5
= − √ cot csc2 ,
25 5 2 2
∞
à √ !
X (j + 1) π 5 364
(−1)j j
ζ(j + 2)L3j = π 2 csc2 − . (3.16)
j=0
2 2 5

Proof. Set m = 2, r = 3 in (3.13) to prove (3.15) and m = 1, r = 3 in (3.14) to prove (3.16).

Corollary 4. If r is an integer with |r| > 1, then,

∞
X ¯
(m + j)! π dm ¯
ζ(m + j + 1)Frj = √ cot(πz) ¯
j! Ljr 5 dz m ¯ r , m even , (3.17)
j=1 z=β /Lr

∞ ¯
X (m + j)! dm ¯
ζ(m + j + 1)Lrj = −π m cot(πz)¯¯ , m odd . (3.18)
j=0
j! Ljr dz z=β r /Lr

Proof. Set z = −1/Lr in (F) and (L) and use (2.35) and (2.36).
Example 4. We have
∞
à √ ! à √ !
X (j + 1)(j + 2) 2π 3 π 5 π 5
ζ(j + 3)F2j = √ tan sec2 , (3.19)
j=1
3j 5 6 6

∞
à √ !
X (j + 1) 3π 5
ζ(j + 2)L4j = π 2 sec2 . (3.20)
j=0
7j 14

Proof. To prove (3.19), set m = 2, r = 2 in (3.17). To prove (3.20), set m = 1, r = 4

in (3.18).

9
Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 20 November 2020 doi:10.20944/preprints202011.0539.v1

References
[1] K. Adegoke, Fibonacci series from power series, manuscript,
doi: 10.20944/preprints202011.0463.v1 (2020).

[2] H. M. Edwards, Riemann’s Zeta Function, Academic Press, (1974).

[3] A. Erdélyi, W. Magnus, F. Oberhettinger and F. G. Tricomi, Higher transcendental

functions, vol. 1, Bateman manuscript project, (1981).

[4] R. Frontczak, Infinite series involving fibonacci numbers and the Riemann zeta func-
tion, Notes on Number Theory and Discrete Mathematics 26:2 (2020), 159–166.

[5] R. Frontczak, Problem B-1267, The Fibonacci Quarterly 58:2 (2020), to appear.

[6] R. Frontczak, Problem H-xxx, The Fibonacci Quarterly 58:2 (2020), to appear.

[7] R. Frontczak and T. Goy, General infinite series evaluations involving Fibonacci num-
bers and the Riemann zeta function, arXiv:2007.14618v1 [math.NT], (2020).

[8] T. Koshy, Fibonacci and Lucas Numbers with Applications, Wiley-Interscience, (2001).

[9] H. M. Srivastava and J. Choi, Zeta and q-Zeta Functions and Associated Series and
Integrals, Elsevier Inc., (2012).

[10] S. Vajda, Fibonacci and Lucas Numbers, and the Golden Section: Theory and Appli-
cations, Dover Press, (2008).

10