See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/255482949

Note on Legendre symbols connecting with certain infinite series

Article · June 2013

CITATION READS

1 49

1 author:

Ramesh kumar Muthumalai

SAVEETHA ENGINEERING COLLEGE
21 PUBLICATIONS   26 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Lebesgue constant for Hermite Fejer interpolation View project

All content following this page was uploaded by Ramesh kumar Muthumalai on 21 May 2014.

The user has requested enhancement of the downloaded file.

Notes on Number Theory and Discrete Mathematics
Vol. 19, 2013, No. 2, 77–83

Note on Legendre symbols

connecting with certain infinite series
Ramesh Kumar Muthumalai
Department of Mathematics, D. G. Vaishnav College
Chennai–600106, Tamil Nadu, India
e-mail: ramjan_80@yahoo.com

Abstract: Some applications of Legendre symbols connecting with certain infinite series are
studied. In addition, some identities for Dirichlet series through Legendre symbols and Hurwitz
zeta function are given.
Keywords: Legendre symbols, Infinite series, Dirichlet series.
AMS Classification: 11A25, 40A05.

1 Introduction
In number theory, the Legendre symbol is a completely multiplicative function with values 1, -1,
0. Let p be any odd prime, if n 6≡ 0(modp) Legendre symbol (n|p) is defined as follows[1, p.179]

 +1 If nRp

(n|p) = . (1.1)

−1 If nRp


where nRp denote n is a quadratic residue mod p and nRp denote n is a quadratic nonresidue
mod p. If n ≡ 0(modp), we define (n|p) = 0. Recently, some properties and applications of
Mobius function and a new arithmetic function connecting with infinite series, infinite products
and partition of an integer are studied in Ref[2]. The purpose of this work is to study some ap-
plications of Legendre symbols connecting with infinite series of rational functions and Dirichlet
series.

77
2 Legendre symbols connecting with infinite series
Lemma 2.1. For any odd prime p and |x| < 1,
∞ p−1
X 1 X
Fp (x) = (k|p)xk = (m|p)xm . (2.1)
k=1
1 − xp m=1

Proof. The Legendre symbol (k|p) is periodic. Then

∞ p−1
∞ X
X X
k
(k|p)x = (m|p)xkp+m .
k=1 k=0 m=1

Rearranging right hand side of above equation, gives

∞ p−1 ∞
X X X
k m
(k|p)x = (m|p)x xkp .
k=1 m=1 k=0

After simplification, completes the Lemma.

Example 2.2. Let p = 3, 5 and 7 in (2.1). Then

x(1 − x)
F3 (x) = .
1 − x3

x(1 − x)(1 − x2 )
F5 (x) = .
1 − x5

x(1 − x)(1 + 2x + x2 + 2x3 + x4 )

F7 (x) = .
1 − x7
Theorem 2.3. For an odd prime p and |x| < 1,
∞
X
x= µ(k)(k|p)Fp (xk ). (2.2)
k=1

Proof. Using Lemma 2.1, that

∞
X ∞
X ∞
X
µ(k)(k|p)Fp (xk ) = µ(k)(k|p) (n|p)xkn . (2.3)
k=1 k=1 n=1

Rearranging above equation, gives

∞
X ∞
X X
k
µ(k)(k|p)Fp (x ) = xk µ(d)(d|p)(k/d|p).
k=1 k=1 d|k

Since (d|p)(k/d|p) = (k|p),

∞
X ∞
X X
k
µ(k)(k|p)Fp (x ) = xk (k|p) µ(d).
k=1 k=1 d|k
P P
Since d|1 µ(d) = 1, d|k µ(d) = 0(k ≥ 2) and (1|p) = 1, this completes the theorem.

78
 P∞
Theorem 2.4. Let p be any odd prime and c be an arithmetic function. If P (x) = k=1 c(k)xk ,
then
∞
X
P (x) = a(k)Fp (xk ). (2.4)
k=1

where
X
a(k) = µ(d)(d|p)c(k/d). (2.5)
d|k

Proof. Consider
∞
X
P (x) = c(k)xk . (2.6)
k=1

Using Theorem 2.3, that

∞
X ∞
X
P (x) = c(k) µ(m)(m|p)Fp (xmk ).
k=1 m=1

Rearranging above equation, gives

∞
X
X
P (x) = F p xk µ(d)(d|p)c(k/d).
k=1 d|k
P
Setting a(k) = µ(d)(d|p)c(k/d) in the above equation, completes the theorem.
d|k

Corollary 2.5. Let P (x) = ∞ k

P
k=1 f (k)(k|p)x and p be an odd prime. Then
∞
X
P (x) = (k|p)b(k)Fp (xk ). (2.7)
k=1

where
X
b(k) = µ(d)f (k/d). (2.8)
d|k

Proof. Let c(k) = (k|p)f (k) in Theorem 2.4. Then (2.5) becomes
X
a(k) = µ(d)(d|p)(k/d|p)f (k/d).
d|k

Since (d|p)(k/d|p) = (k|p),

X
a(k) = (k|p) µ(d)f (k/d).
d|k
P
Setting b(k) = d|k µ(d)f (k/d), then

a(k) = (k|p)b(k). (2.9)

Substituting (2.9) in (2.4), completes the proof.

79
Example 2.6. Let c(k) = 1/k s in Theorem 2.4. Then
∞
X
Φ(x, s, 1) = a(k)Fp (xk ). (2.10)
k=1

where
1 X
a(k) = s
µ(d)(d|p)ds
k
d|k

and Φ(x, s, b) is Lerch zeta function defined by

∞
X xk+1
Φ(x, s, b) = .
k=0
(k + b)s

Example 2.7. The following identities are some of examples of Corollary 2.5.

1. Let f (k) = k in Corollary 2.5, then

∞
X
P (x) = k(k|p)xk = xD [Fp (x)] .
k=1

µ(d) kd = ϕ(k), where ϕ is Euler totient function. Hence

P
Also b(k) = d|k

∞
X
xD [Fp (x)] = (k|p)ϕ(k)Fp (xk ).
k=1

where D differential operator denotes differentiation with respect to x.

For instance, if p = 3
1 − x2 1−x x(1 − x2 ) x4 (1 − x5 )
= ϕ(1) + ϕ(2) + ϕ(5) − ....
1 + x + x2 1 − x3 1 − x6 1 − x15

2. Let f (k) = 1/k, then

∞ Z ∞
X xk
P (x) = (k|p) = Fp (xe−t )dt.
k=1
k 0

Also
1X ϕ−1 (k)
b(k) = µ(d)d = ,
k k
d|k

where ϕ−1 is inverse of Euler totient function with respect to convolution. Hence
Z ∞ ∞
X ϕ−1 (k)
Fp (xe−t )dt = (k|p) Fp (xk ).
0 k=1
k

For instance,
Z ∞
xe−t (1 − xe−t ) −1 x(1 − x) ϕ−1 (2) x2 (1 − x2 )
dt = ϕ (1) + + ....
0 1 − x3 e−3t 1 − x3 2 1 − x6

80
3 Some identities for Dirichlet series
through Legendre symbols
Theorem 3.1. Let Re(s) > 1, p be any odd prime and c be an arithmetic function. Then,
∞ p−1 ∞
X c(k) 1 X X a(k)
= (m|p)ζ(s, m/p) . (3.1)
k=1
ks ps m=1 k=1
k s

P
where a(k) = d|k µ(d)(d|p)c(k/d).

Proof. For |x| < 1, let

∞
X
P (x) = c(k)xk . (3.2)
k=1

Replace x by e−t , multiply by ts−1 for Re(s) > 1 and integrating on [0, ∞), then
Z ∞ ∞
X Z ∞
−t
s−1
t P (e )dt = c(k) ts−1 e−kt dt.
0 k=1 0

R∞ Γ(s)
Since 0
ts−1 e−kt dt = ks
,
Z ∞ ∞
s−1 −t
X c(k)
t P (e )dt = Γ(s) . (3.3)
0 k=1
ks

Similarly, replace x by e−t in (2.4), multiply by ts−1 for Re(s) > 1 and integrating on [0, ∞),
then
Z ∞ X∞ Z ∞
−t
s−1
t P (e )dt = a(k) ts−1 Fp (e−kt )dt
0 k=1 0

Using (2.1). gives

∞ ∞ ∞ p−1
ts−1 X
Z X Z
−t
t s−1
P (e )dt = a(k) (m|p)e−mkt dt
0 k=1 0 1 − e−pkt m=1

Rearranging right hand side of above equation, yields

∞ ∞ p−1 ∞
ts−1
Z X X Z
−t
t s−1
P (e )dt = a(k) (m|p) e−mkt dt.
0 k=1 m=1 0 1 − e−pkt

Using solution of the integral [2, p. 349]

Z ∞ ∞ p−1
s−1 Γ(s) X a(k) X
−t
t P (e )dt = s (m|p)ζ(s, m/p). (3.4)
0 p k=1 k s m=1

Comparing (3.3) and (3.4), completes the theorem.

81
Corollary 3.2. For Re(s) > 1 and odd prime p,
∞ p−1 ∞
X f (k) 1 X X b(k)
(k|p) s = s (m|p)ζ(s, m/p) (k|p) s . (3.5)
k=1
k p m=1 k=1
k
P
where b(k) = d|k µ(d)f (k/d).

Proof. Let c(k) = (k|p)f (k), then a(k) = (k|p)b(k). This completes the corollary.

Example 3.3. Let f (k) = 1 in corollary 3.2. Then

∞ p−1
X (k|p) 1 X
= s (m|p)ζ(s, m/p). (3.6)
k=1
ks p m=1

The following Dirichlet series are obtained by taking f (k) = k, k n , 1/k in (3.5) and using the
identity (3.6), that
∞ Pp−1
ϕ(k) m=1 (m|p)ζ(s − 1, m/p)
X
(k|p) s = p P p−1 .
k=1
k m=1 (m|p)ζ(s, m/p)

∞ Pp−1
Jn (k) m=1 (m|p)ζ(s − n, m/p)
X
(k|p) s = pn p−1 .
k
P
k=1 m=1 (m|p)ζ(s, m/p)

∞ Pp−1
X ϕ−1 (k) 1 m=1 (m|p)ζ(s + 1, m/p)
(k|p) s+1 = p−1 .
k p
P
k=1 m=1 (m|p)ζ(s, m/p)

where Jn is Jordan totient function. Let f (k) = µ(k)/k α in (3.5). Then using the identity
σα−1 (k) = d|k dα µ(d)µ(k/d)
P

∞ p−1 ∞
X (k|p) 1 X X σ −1 (k)
µ(k) s+α = s (m|p)ζ(s, m/p) (k|p) αs+α .
k=1
k p m=1 k=1
k

where σα is the divisor function. Using (3.6), gives the following identity
∞ ∞ Pp−1
X σα (k) −(2s+α)
X Λ(k) (m|p)ζ 0 (s, m/p)
(k|p)µ(k) s+α = p (k|p) s = log p − Pm=1 p−1 . (3.7)
k=1
k k=1
k m=1 (m|p)ζ(s, m/p)

where Λ is van Mangoldt function and dζ(s, m/p)/ds = ζ 0 (s, m/p).

Theorem 3.4. For any odd prime p,

1 (k)
(k|p) = F (0). (3.8)
k! Zp
π 2π π 2π
Z
(k|p) = k Cp (r, θ) cos kθdθ = k Sp (r, θ) sin kθdθ. (3.9)
r 0 r 0
Where Cp (r, θ) = ∞
P k
P∞ k
k=1 (k|p)r cos kθ and Sp (r, θ) = k=1 (k|p)r sin kθ

82
 Proof. Differentiating (2.1) with respect to k and setting x = 0, gives (3.9). For |r| < 1, 0 ≤ θ ≤
2π and odd prime p, consider

Fp (reiθ ) = Cp (r, θ) + iSp (r, θ). (3.10)

Using (2.1), comparing real and imaginary parts, then

∞
X
Cp (r, θ) = (k|p)rk cos kθ. (3.11)
k=1
X∞
Sp (r, θ) = (k|p)rk sin kθ. (3.12)
k=1

Multiply (3.12) and (3.13) by cos kθ and sin kθ, integrating on (0, 2π), gives (3.10).

Remark 3.5. Squaring and adding (3.12) and (3.13) and then integrating on [0, 2π], then
Z 2π ∞
2 2 1X
(k|p)2 r2k .


Cp (r, θ) + Sp (r, θ) dθ =
0 π k=1

Since (k|p)2 = 1,
∞
X r2 r2p
(k|p)2 r2k = − .
k=1
1 − r2 1 − r2p
Then using (3.11), we obtain for odd prime p and |r| < 1,
Z 2π  2
r2p

iθ 2

1 r
|Fp re | dθ = − . (3.13)
0 π 1 − r2 1 − r2p

References
[1] Apostal, T. M. Introduction to Analytic Number Theory, Springer International Student Edi-
tion, New York, 1989.

[2] Gradshteyn, I. S., I. M. Ryzhik, Tables of Integrals, Series and Products (6th ed.), Academic
Press, USA, 2000.

[3] Muthumalai, R. K. Some properties of new arithmetic function and its applications to an-
alytic number theory, Notes on Number Theory and Discrete Mathematics, Vol. 17, 2011,
No. 3, 38–48.

83

View publication stats