Some infinite series involving arithmetic functions

Similar documents
Some properties and applications of a new arithmetic function in analytic number theory

Part II. Number Theory. Year

On summation of certain infinite series and sum of powers of square root of natural numbers

Extremal Orders of Certain Functions Associated with Regular Integers (mod n)

I(n) = ( ) f g(n) = d n

Smol Results on the Möbius Function

An arithmetical equation with respect to regular convolutions

Some Arithmetic Functions Involving Exponential Divisors

On Partition Functions and Divisor Sums

THE FOURIER TRANSFORM OF FUNCTIONS OF THE GREATEST COMMON DIVISOR. Wolfgang Schramm Schulgasse 62 / 11, A-1180 Vienna, AUSTRIA

MATH 361: NUMBER THEORY THIRD LECTURE

Summary Slides for MATH 342 June 25, 2018

Math 314 Course Notes: Brief description

Mathematics 324 Riemann Zeta Function August 5, 2005

arxiv: v1 [math.nt] 2 Dec 2017

ELEMENTARY PROOF OF DIRICHLET THEOREM

arxiv: v22 [math.gm] 20 Sep 2018

Möbius Inversion Formula and Applications to Cyclotomic Polynomials

18.785: Analytic Number Theory, MIT, spring 2006 (K.S. Kedlaya) Dirichlet series and arithmetic functions

A Symbolic Operator Approach to Several Summation Formulas for Power Series

A PROBLEM ON THE CONJECTURE CONCERNING THE DISTRIBUTION OF GENERALIZED FERMAT PRIME NUMBERS (A NEW METHOD FOR THE SEARCH FOR LARGE PRIMES)

Elementary Properties of Cyclotomic Polynomials

Math 118: Advanced Number Theory. Samit Dasgupta and Gary Kirby

INFORMATION-THEORETIC EQUIVALENT OF RIEMANN HYPOTHESIS

f(n) = f(p e 1 1 )...f(p e k k ).

arxiv: v1 [math.nt] 26 Apr 2016

Average value of the Euler function on binary palindromes

Elementary Number Theory Review. Franz Luef

Computing Bernoulli Numbers Quickly

1, for s = σ + it where σ, t R and σ > 1

Zsigmondy s Theorem. Lola Thompson. August 11, Dartmouth College. Lola Thompson (Dartmouth College) Zsigmondy s Theorem August 11, / 1

Any real-valued function on the integers f:n R (or complex-valued function f:n C) is called an arithmetic function.

THE ARITHMETIC OF THE COEFFICIENTS OF HALF INTEGRAL WEIGHT EISENSTEIN SERIES. H(1, n)q n =

DIRICHLET S THEOREM ON PRIMES IN ARITHMETIC PROGRESSIONS. 1. Introduction

THE RELATION AMONG EULER S PHI FUNCTION, TAU FUNCTION, AND SIGMA FUNCTION

On a note of the Smarandache power function 1

10 Problem 1. The following assertions may be true or false, depending on the choice of the integers a, b 0. a "

arxiv: v6 [math.nt] 12 Sep 2017

E-SYMMETRIC NUMBERS (PUBLISHED: COLLOQ. MATH., 103(2005), NO. 1, )

Dirichlet s Theorem and Algebraic Number Fields. Pedro Sousa Vieira

Advanced Number Theory Note #6: Reformulation of the prime number theorem using the Möbius function 7 August 2012 at 00:43

Theorem 1.1 (Prime Number Theorem, Hadamard, de la Vallée Poussin, 1896). let π(x) denote the number of primes x. Then x as x. log x.

Asymptotic formulae for the number of repeating prime sequences less than N

ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM

Chapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem

Determinant and inverse of join matrices on two sets

Divisibility. 1.1 Foundations

Chapter 2 Arithmetic Functions and Dirichlet Series.

PartII Number Theory

On the Square-free Numbers in Shifted Primes Zerui Tan The High School Attached to The Hunan Normal University November 29, 204 Abstract For a fixed o

PARTITION-THEORETIC FORMULAS FOR ARITHMETIC DENSITIES

On Exponentially Perfect Numbers Relatively Prime to 15

A Classical Introduction to Modern Number Theory

A Concise Course in Number Theory Alan Baker, Cambridge University Press, 1983

Some multiplicative arithmetical functions

The least prime congruent to one modulo n

Chapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem

COMBINATORIAL APPLICATIONS OF MÖBIUS INVERSION

Bernoulli Numbers and their Applications

Number-Theoretic Function

rama.tex; 21/03/2011; 0:37; p.1

ELECTRICAL EQUIVALENT OF RIEMANN HYPOTHESIS

Gauss and Riemann versus elementary mathematics

arxiv: v1 [math.nt] 2 May 2011

RECURRENCE RELATION FOR COMPUTING A BIPARTITION FUNCTION

ζ (s) = s 1 s {u} [u] ζ (s) = s 0 u 1+sdu, {u} Note how the integral runs from 0 and not 1.

Properties of Arithmetical Functions

ARITHMETIC PROGRESSIONS IN THE POLYGONAL NUMBERS

EXTENDED RECIPROCAL ZETA FUNCTION AND AN ALTERNATE FORMULATION OF THE RIEMANN HYPOTHESIS. M. Aslam Chaudhry. Received May 18, 2007

A new family of character combinations of Hurwitz zeta functions that vanish to second order

Mathematics 4: Number Theory Problem Sheet 3. Workshop 26 Oct 2012

Harmonic sets and the harmonic prime number theorem

Dedekind zeta function and BDS conjecture

Concrete Mathematics: A Portfolio of Problems

Math 200 University of Connecticut

Topics in divisibility: pairwise coprimality, the GCD of shifted sets and polynomial irreducibility

On the Uniform Distribution of Certain Sequences

Divergent Series: why = 1/12. Bryden Cais

An Euler-Type Formula for ζ(2k + 1)

Number Theory and Algebraic Equations. Odile Marie-Thérèse Pons

Meet and join matrices in the poset of exponential divisors

The Euler Phi Function

AN ANALOG OF THE HARMONIC NUMBERS OVER THE SQUAREFREE INTEGERS

arxiv: v2 [math.co] 9 May 2017

1 The functional equation for ζ

PRIME NUMBERS YANKI LEKILI

Unlabeled Motzkin numbers

TAIL OF A MOEBIUS SUM WITH COPRIMALITY CONDITIONS

PRIME NUMBER THEOREM

Analytic Number Theory

SOLVING TRANSPORTATION PROBLEMS WITH MIXED CONSTRAINTS IN ROUGH ENVIRONMENT

Trifectas in geometric progression

Generalized GCD matrices

First, let me recall the formula I want to prove. Again, ψ is the function. ψ(x) = n<x

p-regular functions and congruences for Bernoulli and Euler numbers

Examples of Finite Sequences (finite terms) Examples of Infinite Sequences (infinite terms)

Applications of the course to Number Theory

Evidence for the Riemann Hypothesis

as x. Before giving the detailed proof, we outline our strategy. Define the functions for Re s > 1.

IRRATIONAL FACTORS SATISFYING THE LITTLE FERMAT THEOREM

Transcription:

Notes on Number Theory and Discrete Mathematics ISSN 131 5132 Vol. 21, 215, No. 2, 8 14 Some infinite series involving arithmetic functions Ramesh Kumar Muthumalai Department of Mathematics, Saveetha Engineering College Saveetha Nagar, Thandalam, Chennai 62 15, Tamil Nadu, India e-mail: ramjan_8@yahoo.com Abstract: Some identities for infinite series involving arithmetic functions are derived through Jacobi symbols ( 1 k) and (2 k). Using these identities, some Dirichlet series are expressed in terms of Hurwitz zeta function. Keywords: Möbius function, Arithmetic function, Jacobi symbol, Dirichlet series, Infinite series. AMS Classification: 11A25. 1 Introduction Möbius function arises in many different places in number theory. The Lambert series for Möbius function µ [1, p. 327] is given by x n µ(n) = x for x < 1. (1.1) 1 xn Euler s totient function is an another important arithmetic function that occurs in many identities, special functions or constants. Liouville proved that for x < 1 [4, p. 182] x n 1 x ϕ(n) = x n (1 x). (1.2) 2 x n 1 + x n ϕ(n) = x(1 + x2 ) (1 x 2 ) 2. (1.3) Similar identities for Jordan totient function J k (n) for k = 2 and x < 1 are given in Ref [4, p. 182] as follows 8

x n 1 x J 2(n) = x 1 + x n (1 x). (1.4) 3 x n 1 + x n J 2(n) = x(1 + 2x + 6x2 + 2 3 + x 4 ) (1 x 2 ) 3. (1.5) Cesáro generalized (1.2) for any arithmetic function f x n 1 x f(n) = x n F (n) n for x < 1, (1.6) where F (n) = d n f(d) [4, p. 182]. In the present study, infinite series involving arithemtic functions are derived through Jacobi symbols ( 1 k) and (2 k) for k N. Further, we derive some identities for Dirichlet series in terms of Hurwitz zeta function. 2 Main theorems Theorem 2.1. Let p be an arithmetic function. Let P (x) = p(k)( 1 k)xk. Then for x < 1, P (x) = ( 1 k). (2.1) 1 + x2k Also, for Re(s) > 1 where p and a are connected by the following relation p(k) ( 1 k) k s = 1 (ζ(s, 1/4) ζ(s, 3/4)), (2.2) ( 1 k) 4s k s = d k µ(d)p(k/d). (2.3) Theorem 2.2. Let q be an arithmetic function. Let Q(x) = q(k)(2 k)xk. Then for x < 1, Q(x) = (2 k)α(k) xk (1 x 2k ). (2.4) 1 + x 4k Also, for Re(s) > 1 (2 k) q(k) k s (2 k) α(k) k s = 1 8 where q and α are connected by the following relation s [ζ(s, 1/8) ζ(s, 3/8) ζ(s, 5/8) + ζ(s, 7/8)], (2.5) α(k) = d k µ(d)q(k/d). (2.6) 9

3 Applications of main theorems 3.1 Infinite series involving arithmetic functions Let p(k) = k in Theorem 2.1. Then and = d k µ(d) k d P (x) = k( 1 k) = x(1 x2 ) (1 + x 2 ) 2, = ϕ(k) [1, pp. 26], where ϕ is Euler totient function. Hence, x(1 x 2 ) (1 + x 2 ) = 2 Similarly, Theorem 2.2, gives that x(1 3x 2 3x 4 + x 6 ) (1 + x 4 ) 2 = ( 1 k)ϕ(k) 1 + x. 2k (2 k)ϕ(k) xk (1 x 2k ) (1 + x 4k ). 2 Let f(k) = [ ] z k in Theorem 2.1. Then, using the identity ϕ(z, n) = d n µ(d) [ z d], gives [ z ] ( 1 k) = ( 1 k)ϕ(x, k) k 1 + x. 2k Similiarly, using (2.5) [ z k ] (2 k) = ( 1 k)ϕ(x, k) xk (1 x 2k ). 1 + x 4k where ϕ(z, k) is Legendre totient function [4, pp. 283]. Let f(k) = 1/k in Theorem 2.1 and Theorem 2.2. Using the identity b(k) = 1 µ(d)d = ϕ 1 (k) k k [1, pp. 37], gives the following identites x tan 1 x = d k 1 t 2 1 + t dt = 4 ( 1 k)ϕ 1 (k) 1 + x. 2k (2 k)ϕ 1 (k) xk (1 x 2k ), 1 + x 4k where ϕ 1 is inverse of Euler totient function with respect to convolution. Consider the identity given in (2.1), P (x) = ( 1 k) 1 + x. 2k Dividing above equation by x and integrating on [, x], yields the following identity x P (t) dt = ( 1 k) t k tan 1 ( ). (3.1) 1

3.2 Evaluation of some Dirichlet series The following identities are obtained from (2.2) by taking f(k) = k, 1/k, log k and k m and respectively. ( 1 k) k s 1 = 1 4 [ζ(s, 1/4) ζ(s, 3/4)] ( 1 k) ϕ(k). s k s Since ( 1 k) = 1 [ζ(s 1, 1/4) ζ(s 1, 3/4)], after simplification gives k s 1 4 s 1 ( 1 k) ϕ(k) [ζ(s 1, 1/4) ζ(s 1, 3/4)] = 4. k s ζ(s, 1/4) ζ(s, 3/4) Thus ( 1 k) ϕ 1 (k) k s = ζ(s + 1, 1/4) ζ(s + 1, 3/4). 4 [ζ(s, 1/4) ζ(s, 3/4)] ( 1 k) J m(k) m [ζ(s m, 1/4) ζ(s m, 3/4)] = 4. k s ζ(s, 1/4) ζ(s, 3/4) The following identities are obtained from (2.5) by taking f(k) = k, 1/k, log k, and k m, respectively. (2 k) ϕ(k) [ζ(s 1, 1/8) ζ(s 1, 3/8) ζ(s 1, 5/8) + ζ(s 1, 7/8)] = 8. k s [ζ(s, 1/8) ζ(s, 3/8) ζ(s, 5/8) + ζ(s, 7/8)] (2 k) ϕ 1 (k) k s = [ζ(s + 1, 1/8) ζ(s + 1, 3/8) ζ(s + 1, 5/8) + ζ(s + 1, 7/8)]. 8 [ζ(s, 1/8) ζ(s, 3/8) ζ(s, 5/8) + ζ(s, 7/8)] (2 k) J m(k) m [ζ(s m, 1/8) ζ(s m, 3/8) ζ(s m, 5/8) + ζ(s m, 7/8)] = 8. k s [ζ(s, 1/8) ζ(s, 3/8) ζ(s, 5/8) + ζ(s, 7/8)] 4 Some lemmas Lemma 4.1. For x < 1, ( 1 k) = x 1 + x 2. (4.1) (2 k) = x(1 x2 ). (4.2) 1 + x 4 11

Proof. It is well known that for an odd integer k, ( 1 k) = ( 1) (k 1)/2. Then, using binomial theorem, gives (2.1). Similarly, for an odd integer k, (2 k) = ( 1) (k2 1)/8. Hence, After simplification, gives (2.2). Lemma 4.2. If x < 1, then (2 k) = x + x = x = x ( 8k x 3 x 5 + x 7 + x 9). (4.3) k=. (4.4) 1 + x2k µ(k) (2 k) xk (1 x 2k ) 1 + x 4k. (4.5) Proof. The left hand side of (2.4) can be written using (2.1) as follows Rearranging above equation, gives 1 + x = 2k m=1,2 m ( 1 m) m. 1 + x = 2k d k µ(d) ( 1 d) ( 1 k/d). Since ( 1 d)( 1 k/d) = ( 1 k), 1 + x = 2k ( 1 k) d k µ(d). Since d k µ(d) = 1 [3, p. 19] and ( 1 1) = 1, gives (2.4). Similarly, (2.5) can be easily found from (2.2). 5 Proof of main theorems 5.1 Proof of Theorem 2.1 Consider P (x) = ( 1 k)p(k). (5.1) Using (3.4), that P (x) = ( 1 k)p(k) m=1,2 m x mk µ(m)( 1 m) 1 + x. 2mk 12

Rearranging the above equation, gives P (x) = 1 + x 2k d k µ(d)( 1 d)( 1 k/d)p(k/d). Since ( 1 d)( 1 (k/d)) = ( 1 k). Setting = d k µ(d)p(k/d) in the above equation, gives (2.1). To prove equation (2.2), replace x by e t in (4.1), multiply by t s 1 for Re(s) > 1 and integrating on [, ), then t s 1 P (e t )dt = Since t s 1 e kt dt = Γ(s), gives k s p(k) t s 1 P (e t )dt = Γ(s) t s 1 e kt dt. p(k) k s. (5.2) Now, replace x by e t in (3.1), multiply by t s 1 for Re(s) > 1 and integrating on [, ), then After simplification, this gives Since ( 1) k 1 (2k 1) s t s 1 P (e t )dt = t s 1 P (e t )dt = Γ(s) t s 1 e kt dt 1 + e 2kt ( 1) k 1 (2k 1) s = 1 4 s [ζ(s, 1/4) ζ(s, 3/4)], gives t s 1 P (e t )dt = Γ(s) 4 s [ζ(s, 1/4) ζ(s, 3/4)] Comparing (4.2) and (4.3), gives (2.2). This completes the proof. k s. k s. (5.3) 5.2 Proof of Thoerem 2.2 The proof of Theorem 2.2 is similar to proof of Theorem 2.1. Consider Q(x) = (2 k)q(k). (5.4) Using (2.5) and Setting α(k) = d k µ(d)q(k/d). After simplification, this gives (2.4). Further using the identity (2 k) k s = 1 8 s [ ( ζ s, 1 ) ( ζ s, 3 ) ( ζ s, 5 ) ( + ζ s, 7 )]. (5.5) 8 8 8 8 This completes the proof. 13

References [1] Apostal, T. M. (1989) Introduction to Analytic Number Theory, Springer International Student Edition, New York. [2] Gradshteyn, I. S. & Ryzhik, I. M. (2) Tables of Integrals, Series and Products, 6 Ed, Academic Press, USA. [3] Ireland, K. & Rosen, M. (199) A Classical Introduction to Modern Number Theory, 2Ed, Springer-Verlag, New York. [4] Sándor, J. & Crstici, B. (24) Handbook of Number Theory II, Springer, Kluwer Acedemic Publishers, Netherland. 14