DOCSLIB.ORG

Long and Short Sums of a Twisted Divisor Function

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Long and Short Sums of a Twisted Divisor Function 1 2 Journal of Integer Sequences, Vol. 20 (2017), 3 Article 17.7.1 47 6 23 11 Long and Short Sums of a Twisted Divisor Function Olivier Bordell`es 2, all´ee de la Combe 43000 Aiguilhe France [email protected] Abstract τ Let q > 2 be a prime number and define λq := q where τ(n) is the number of divisors of n and q· is the Legendre symbol. When τ(n) is a quadratic residue modulo q, then the convolution (λq ⋆ 1)(n) could be close to the number of divisors of n. The aim of this work is to compare the mean value of the function λq ⋆ 1 to the well known average order of τ. A bound for short sums in the case q = 5 is also given, using profound results from the theory of integer points close to certain smooth curves. 1 Introduction and main result If Ω(n) stands for the number of total prime factors of n and λ = ( 1)Ω is the Liouville function, then − ζ(2s) L(s,λ)= (σ > 1) . ζ(s) This implies the convolution identity (λ⋆ 1)(n)= x1/2 , n6x X where, as usual, F ⋆G is the Dirichlet convolution product of the arithmetic functions F and G given by (F ⋆G)(n) := F (d)G(n/d). d n X| 1 τ Define λ3 := 3 where τ(n) is the number of divisors of n and 3· is the Legendre symbol. Then from Proposition 3 below ζ(3s) L(s,λ )= (σ > 1) , 3 ζ(s) implying the convolution identity 1/3 (λ3 ⋆ 1)(n)= x . n6x X τ Now let q > 2 be a prime number and define λq := q where q· is the Legendre symbol. Our main aim is to investigate the sum (λq ⋆ 1)(n). n6x X When τ(n) is a quadratic residue modulo q, one may wonder if (λq ⋆ 1)(n) has a high prob- ability to be equal to the number of divisors of n. Note that this function is multiplicative, 2 and, for any prime p, (λq ⋆ 1)(p)=1+ q . Consequently, when 2 is a quadratic residue modulo q, then (λq ⋆ 1)(n)= τ(n) for all squarefree numbers n. On the other hand, when 2 is a quadratic nonresidue modulo q, then (λq ⋆ 1)(n) = 0 unless n =1 or n is squarefull, so 1/2 that n6x (λq ⋆ 1)(n) x in this case. It then could be interesting to compare this sum to the average order of≪ the function τ, i.e., P τ(n)= x (log x +2γ 1) + O xθ+ε , (1) − n6x X where 1 6 6 131 4 θ 416 , (2) the left-hand side being established by Hardy [5], the right-hand side being the best estimate to date due to Huxley [6]. To state our first main result, some specific notation are needed. For any prime q > 3, let c , respectively d , be least positive integer m 1,...,q 2 for which m = m+1 , q q ∈ { − } q 6 q respectively m = m+1 . Note that c and d are well-defined, since it is known from q 6 − q q q [3, p. 75-76] that the number of m for which m = m+1 and m = m+1 are q q q − q respectively 1 (q 3) and 1 (q 1). Hence there is at least 1 (q 3) integers mfor which 2 − 2 − 2 − m = m+1 . For convenience, set d = 3. q 6 ± q 3 As usual in number theory, we adopt Riemann’s notation s = σ + it C and ζ is the Riemann zeta function, and define the Euler products ∈ q 1 − m +1 m 1 1 Pq(s) := 1+ σ > , q − q pms cq p m=c Y Xq 2 and q 1 − m +1 m 1 R (s) := 1+ + σ > 1 . q q q pms 3 p m=3 ! Y X Theorem 1. Let q > 3 be a prime number. (a) If q 1 (mod8) ≡± ζ′ P ′ (λ ⋆ 1)(n)= xζ(q)P (1) log x +2γ 1+ q (q)+ q (1) +O xmax(1/cq,θ)+ε , q q − ζ P q,ε n6x q X where θ is defined in (1) and (2). (b) If q 11 (mod24) ≡± 1/2 q 1 1/3+ε (λq ⋆ 1)(n)= x ζ 2 Rq 2 + Oq,ε x . n6x X (c) If q 5 (mod24), there exists c> 0 such that ≡± 3/5 −1/5 1/2 c log x1/4 log log x1/4 (λ ⋆ 1)(n) x e− ( ) ( ) . q ≪q n6x X Furthermore, if the Riemann hypothesis is true, then for x sufficiently large 1 2 / 5/2+ε (λ ⋆ 1)(n) x1/4e(log √x) (log log √x) . q ≪q,ε n6x X Example 2. 1/2+ε (λ7 ⋆ 1)(n) =0.454 x (log x +2γ +0.784) + Oε x . n6x X . (λ ⋆ 1)(n) =0.899 x (log x +2γ 0.678) + O x131/416+ε . 23 − ε n6x X . 1/2 1/3+ε (λ13 ⋆ 1)(n) =1.969 x + Oε x . n6x X 3/5 −1/5 1/2 c log x1/4 log log x1/4 (λ ⋆ 1)(n) x e− ( ) ( ) . 5 ≪ n6x X 3 2 Notation In what follows, x > e4 is a large real number, ε 0, 1 is a small real number which does ∈ 4 not need to be the same at each occurrence, q always denotes an odd prime number, q· is the Legendre symbol and τ λ := , q q where τ(n) := d n 1. Also, 1 is the constant arithmetic function equal to 1. | 1 For any arithmeticP functions F and G, L(s,F ) is the Dirichlet series of F , and F − is the Dirichlet convolution inverse of F . If r Z> , then ∈ 2 1, if n = mr; ar(n) := (0, otherwise. For some c> 0, set c(log x)3/5(log log x)−1/5 (log x)1/2(log log x)5/2+ε δc(x) := e− and ω(x) := e . Finally, let M(x) and L(x) be respectively the Mertens function and the summatory function of the Liouville function, i.e. M(x) := µ(n) and L(x) := λ(n). n6x n6x X X 3 The Dirichlet series of λq Proposition 3. Let q > 3 be a prime number. For any s C such that σ > 1 ∈ ⊲ If q 1 (mod8) ≡± q 1 − m +1 m 1 L (s,λ )= ζ(qs)ζ(s) 1+ . q q − q pms p m=c Y Xq ⊲ If q 3 (mod8) ≡± q 1 ζ(qs)ζ(2s) − m +1 m 1 L (s,λ )= 1+ + . q ζ(s) q q pms p Y mX=dq 4 Proof. Set χq := q· for convenience. From [8, Lemma 2.1], we have ∞ χ (α + 1) ∞ χ (α) L (s,λ ) = 1+ q = 1+ ps q q psα psα p α=1 ! p α=2 ! Y X Y X 1 q 1 − s 1 − m 1 s = 1+ p 1 p− − pqs q pms − p m=1 !! Y X 1 q 1 1 − − m 1 = 1 − pqs q p(m 1)s p m=1 − ! Y X q 1 − m 1 = ζ(qs) 1+ . q p(m 1)s p m=2 − ! Y X If q 1 (mod8), then 2 = 1 and ≡± q q 1 1 1 − m 1 L (s,λ )= ζ(qs)ζ(s) 1 + 1 , q − ps − ps q p(m 1)s p m=2 − ! Y X where q 1 q 1 1 − m 1 − m 1 1 1 = − ps q p(m 1)s q p(m 1)s − pms m=2 − m=2 − X Xq 2 q 1 − m +1 1 − m 1 = q pms − q pms m=1 m=2 X q 1 X 2 1 − m +1 m 1 q 1 = + q ps q − q pms − q p(q 1)s m=2 − q 1 X − m +1 m 1 1 = + . q − q pms ps m=2 X Similarly, if q 3 (mod8), then 2 = 1 and ≡± q − q 1 ζ(qs)ζ(2s) 1 1 − m 1 L (s,λ )= 1+ + 1+ , q ζ(s) ps ps q p(m 1)s p m=2 − ! Y X 5 where q 1 q 1 1 − m 1 − m 1 1 1+ = + ps q p(m 1)s q p(m 1)s pms m=2 − m=2 − X Xq 2 q 1 − m +1 1 − m 1 = + q pms q pms m=1 m=2 X q 1 X 2 1 − m +1 m 1 q 1 = + + q ps q q pms − q p(q 1)s m=2 − q 1 X − m +1 m 1 1 = + . q q pms − ps m=2 X We achieve the proof noting that, if q 1 (mod24), then 3 2 = 4 3 = 0 ≡ ± q − q q − q and, similarly, if q 11 (mod24), then 3 + 2 = 0 whereas 4 + 3 = 2. ≡± q q q q 4 Proof of Theorem 1 4.1 The case q 1 (mod 8) ≡± For σ > 1, we set q 1 − m +1 m 1 ∞ g (n) G (s)= ζ(qs) 1+ = ζ(qs)P (s) := q . q q − q pms q ns p m=c n=1 Y Xq X This Dirichlet series is absolutely convergent in the half-plane σ > 1 , so that cq g (n) x1/cq+ε. | q | ≪q,ε n6x X By partial summation, we infer gq(n) 1+1/cq+ε = ζ(q)P (1) + O x− , n q n6x X gq(n) x 1+1/cq+ε log = ζ(q)P (1) log x + qP (1)ζ′(q)+ P ′(1)ζ(q)+ O x− .
Load more

Recommended publications
  • Two Elementary Formulae and Some Complicated Properties for Mertens Function3
    TWO ELEMENTARY FORMULAE AND SOME COMPLICATED PROPERTIES FOR MERTENS FUNCTION RONG QIANG WEI Abstract. Two elementary formulae for Mertens function M(n) are obtained. With these formulae, M(n) can be calculated directly and simply, which can be easily imple- mented by computer. M(1) ∼ M(2 × 107) are calculated one by one. Based on these 2 × 107 samples, some of the complicated properties for Mertens function M(n), its 16479 zeros, the 10043 local maximum/minimum between two neighbor zeros, and the rela- tion with the cumulative sum of the squarefree integers, are understood numerically and empirically. Keywords: Mertens function Elementary formula Zeros Local maximum/minimum squarefree integers 1. Introduction The Mertens function M(n) is important in number theory, especially the calculation of this function when its argument is large. M(n) is defined as the cumulative sum of the M¨obius function µ(k) for all positive integers n, n (1) M(n)= µ(k) Xk=1 where the M¨obius function µ(k) is defined for a positive integer k by 1 k = 1 (2) µ(k)= 0 if k is divisible by a prime square ( 1)m if k is the product of m distinct primes − Sometimes the above definition can be extended to real numbers as follows: arXiv:1612.01394v2 [math.NT] 15 Dec 2016 (3) M(x)= µ(k) 1≤Xk≤x Furthermore, Mertens function has other representations. They are mainly shown in formula (4-7): 1 c+i∞ xs (4) M(x)= ds 2πi Zc−i∞ sζ(s) 1 2 RONG QIANG WEI where ζ(s) is the the Riemann zeta function, s is complex, and c> 1 (5) M(n)= exp(2πia) aX∈Fn where Fn is the Farey sequence of order n.
    [Show full text]
  • Bounds of the Mertens Functions
    Advances in Dynamical Systems and Applications. ISSN 0973-5321, Volume 16, Number 1, (2021) pp. 35-44 © Research India Publications https://dx.doi.org/10.37622/ADSA/16.1.2021.35-44 Bounds of the Mertens Functions Darrell Coxa, Sourangshu Ghoshb, Eldar Sultanowc aGrayson County College, Denison, TX 75020, USA bDepartment of Civil Engineering , Indian Institute of Technology Kharagpur, West Bengal, India cPotsdam University, 14482 Potsdam, Germany Abstract In this paper we derive new properties of Mertens function and discuss about a likely upper bound of the absolute value of the Mertens function √log(푥!) > |푀(푥)| when 푥 > 1. Using this likely bound we show that we have a sufficient condition to prove the Riemann Hypothesis. 1. INTRODUCTION We define the Mobius Function 휇(푘). Depending on the factorization of n into prime factors the function can take various values in {−1, 0, 1} 휇(푛) = 1 if n has even number of prime factors and it is also square- free(divisible by no perfect square other than 1) 휇(푛) = −1 if n has odd number of prime factors and it is also square-free 휇(푛) = 0 if n is divisible by a perfect square. 푛 Mertens function is defined as 푀(푛) = ∑푘=1 휇(푘) where 휇(푘) is the Mobius function. It can be restated as the difference in the number of square-free integers up to 푥 that have even number of prime factors and the number of square-free integers up to 푥 that have odd number of prime factors. The Mertens function rather grows very slowly since the Mobius function takes only the value 0, ±1 in both the positive and 36 Darrell Cox, Sourangshu Ghosh, Eldar Sultanow negative directions and keeps oscillating in a chaotic manner.
    [Show full text]
  • A Matrix Inequality for Möbius Functions
    Volume 10 (2009), Issue 3, Article 62, 9 pp. A MATRIX INEQUALITY FOR MÖBIUS FUNCTIONS OLIVIER BORDELLÈS AND BENOIT CLOITRE 2 ALLÉE DE LA COMBE 43000 AIGUILHE (FRANCE) [email protected] 19 RUE LOUISE MICHEL 92300 LEVALLOIS-PERRET (FRANCE) [email protected] Received 24 November, 2008; accepted 27 March, 2009 Communicated by L. Tóth ABSTRACT. The aim of this note is the study of an integer matrix whose determinant is related to the Möbius function. We derive a number-theoretic inequality involving sums of a certain class of Möbius functions and obtain a sufficient condition for the Riemann hypothesis depending on an integer triangular matrix. We also provide an alternative proof of Redheffer’s theorem based upon a LU decomposition of the Redheffer’s matrix. Key words and phrases: Determinants, Dirichlet convolution, Möbius functions, Singular values. 2000 Mathematics Subject Classification. 15A15, 11A25, 15A18, 11C20. 1. INTRODUCTION In what follows, [t] is the integer part of t and, for integers i, j > 1, we set mod(j, i) := j − i[j/i]. 1.1. Arithmetic motivation. In 1977, Redheffer [5] introduced the matrix Rn = (rij) ∈ Mn({0, 1}) defined by ( 1, if i | j or j = 1; rij = 0, otherwise and has shown that (see appendix) n X det Rn = M(n) := µ(k), k=1 where µ is the Möbius function and M is the Mertens function. This determinant is clearly related to two of the most famous problems in number theory, the Prime Number Theorem (PNT) and the Riemann Hypothesis (RH). Indeed, it is well-known that 1/2+ε PNT ⇐⇒ M(n) = o(n) and RH ⇐⇒ M(n) = Oε n 317-08 2 OLIVIER BORDELLÈS AND BENOIT CLOITRE (for any ε > 0).
    [Show full text]
  • A Note on P´Olya's Observation Concerning
    A NOTE ON POLYA'S´ OBSERVATION CONCERNING LIOUVILLE'S FUNCTION RICHARD P. BRENT AND JAN VAN DE LUNE Dedicated to Herman J. J. te Riele on the occasion of his retirement from the CWI in January 2012 Abstract. We show that a certain weighted mean of the Liou- ville function λ(n) is negative. In this sense, we can say that the Liouville function is negative \on average". 1. Introduction Q ep(n) For n 2 N let n = pjn p be the canonical prime factorization P of n and let Ω(n) := pjn ep(n). Here (as always in this paper) p is prime. Thus, Ω(n) is the total number of prime factors of n, counting multiplicities. For example: Ω(1) = 0, Ω(2) = 1, Ω(4) = 2, Ω(6) = 2, Ω(8) = 3, Ω(16) = 4, Ω(60) = 4, etc. Define Liouville's multiplicative function λ(n) = (−1)Ω(n). For ex- ample λ(1) = 1, λ(2) = −1, λ(4) = 1, etc. The M¨obiusfunction µ(n) may be defined to be λ(n) if n is square-free, and 0 otherwise. It is well-known, and follows easily from the Euler product for the Riemann zeta-function ζ(s), that λ(n) has the Dirichlet generating function 1 X λ(n) ζ(2s) = ns ζ(s) n=1 for Re (s) > 1. This provides an alternative definition of λ(n). Let L(n) := P λ(k) be the summatory function of the Liouville k≤n P function; similarly M(n) := k≤n µ(k) for the M¨obiusfunction.
    [Show full text]
  • The Mertens Conjecture
    The Mertens conjecture Herman J.J. te Riele∗ Title of c Higher Education Press This book April 8, 2015 and International Press ALM ??, pp. ?–? Beijing-Boston Abstract The Mertens conjecture states that |M(x)|x−1/2 < 1 for x > 1, where M(x) = P1≤n≤x µ(n) and where µ(n) is the M¨obius function defined by: µ(1) = 1, µ(n) = (−1)k if n is the product of k distinct primes, and µ(n)=0 if n is divisible by a square > 1. The truth of the Mertens conjecture implies the truth of the Riemann hypothesis and the simplicity of the complex zeros of the Riemann zeta function. This paper gives a concise survey of the history and state-of-affairs concerning the Mertens conjecture. Serious doubts concerning this conjecture were raised by Ingham in 1942 [12]. In 1985, the Mertens conjecture was disproved by Odlyzko and Te Riele [23] by making use of the lattice basis reduction algorithm of Lenstra, Lenstra and Lov´asz [19]. The best known results today are that |M(x)|x−1/2 ≥ 1.6383 and there exists an x< exp(1.004 × 1033) for which |M(x)|x−1/2 > 1.0088. 2000 Mathematics Subject Classification: Primary 11-04, 11A15, 11M26, 11Y11, 11Y35 Keywords and Phrases: Mertens conjecture, Riemann hypothesis, zeros of the Riemann zeta function 1 Introduction Let µ(n) be the M¨obius function with values µ(1) = 1, µ(n) = ( 1)k if n is the product of k distinct primes, and µ(n) = 0 if n is divisible by a square− > 1.
    [Show full text]
  • Package 'Numbers'
    Package ‘numbers’ May 14, 2021 Type Package Title Number-Theoretic Functions Version 0.8-2 Date 2021-05-13 Author Hans Werner Borchers Maintainer Hans W. Borchers <[email protected]> Depends R (>= 3.1.0) Suggests gmp (>= 0.5-1) Description Provides number-theoretic functions for factorization, prime numbers, twin primes, primitive roots, modular logarithm and inverses, extended GCD, Farey series and continuous fractions. Includes Legendre and Jacobi symbols, some divisor functions, Euler's Phi function, etc. License GPL (>= 3) NeedsCompilation no Repository CRAN Date/Publication 2021-05-14 18:40:06 UTC R topics documented: numbers-package . .3 agm .............................................5 bell .............................................7 Bernoulli numbers . .7 Carmichael numbers . .9 catalan . 10 cf2num . 11 chinese remainder theorem . 12 collatz . 13 contFrac . 14 coprime . 15 div.............................................. 16 1 2 R topics documented: divisors . 17 dropletPi . 18 egyptian_complete . 19 egyptian_methods . 20 eulersPhi . 21 extGCD . 22 Farey Numbers . 23 fibonacci . 24 GCD, LCM . 25 Hermite normal form . 27 iNthroot . 28 isIntpower . 29 isNatural . 30 isPrime . 31 isPrimroot . 32 legendre_sym . 32 mersenne . 33 miller_rabin . 34 mod............................................. 35 modinv, modsqrt . 37 modlin . 38 modlog . 38 modpower . 39 moebius . 41 necklace . 42 nextPrime . 43 omega............................................ 44 ordpn . 45 Pascal triangle . 45 previousPrime . 46 primeFactors . 47 Primes
    [Show full text]
  • Bounds of the Mertens Functions
    Bounds of the Mertens Functions Darrell Coxa ,Sourangshu Ghoshb, Eldar Sultanowc aGrayson County College Denison, TX 75020 USA [email protected] bDepartment of Civil Engineering , Indian Institute of Technology Kharagpur, West Bengal, India [email protected] cPotsdam University, 14482 Potsdam, Germany [email protected] ABSTRACT In this paper we derive new properties of Mertens function and discuss about a likely upper bound of the absolute value of the Mertens function √log(푥!) > |푀(푥)| when 푥 > 1. Using this likely bound we show that we have a sufficient condition to prove the Riemann Hypothesis. 1. Introduction We define the Mobius Function 휇(푘). Depending on the factorization of n into prime factors the function can take various values in {−1, 0, 1} • 휇(푛) = 1 if n has even number of prime factors and it is also square-free(divisible by no perfect square other than 1) • 휇(푛) = −1 if n has odd number of prime factors and it is also square-free • 휇(푛) = 0 if n is divisible by a perfect square. 푛 Mertens function is defined as 푀(푛) = ∑푘=1 휇(푘) where 휇(푘) is the Mobius function. It can be restated as the difference in the number of square-free integers up to 푥 that have even number of prime factors and the number of square-free integers up to 푥 that have odd number of prime factors. The Mertens function rather grows very slowly since the Mobius function takes only the value 0, ±1 in both the positive and negative directions and keeps oscillating in a chaotic manner.
    [Show full text]
  • A Painless Overview of the Riemann Hypothesis [Proof Omitted]
    A Painless Overview of the Riemann Hypothesis [Proof Omitted] Peter Lynch School of Mathematics & Statistics University College Dublin Irish Mathematical Society 40th Anniversary Meeting 20 December 2016. Outline Introduction Bernhard Riemann Popular Books about RH Prime Numbers Über die Anzahl der Primzahlen . The Prime Number Theorem Advances following PNT RH and Quantum Physics True or False? So What? References Intro Riemann Sources Primes 1859 PNT After PNT Quantum T/F Finis Refs Outline Introduction Bernhard Riemann Popular Books about RH Prime Numbers Über die Anzahl der Primzahlen . The Prime Number Theorem Advances following PNT RH and Quantum Physics True or False? So What? References Intro Riemann Sources Primes 1859 PNT After PNT Quantum T/F Finis Refs Tossing a Coin Everyone knows that if we toss a fair coin, the chances are equal for Heads and Tails. Let us give scores to Heads and Tails: ( +1 for Heads κ = −1 for Tails PN Now if we toss many times, the sum SN = 1 κn is a random walk in one dimension. The expected distance from zero after N tosses is r 2N 1 E(jS j) = ∼ N 2 N π Intro Riemann Sources Primes 1859 PNT After PNT Quantum T/F Finis Refs Prime Factors Every natural number n can be uniquely factored into a product of primes. e1 e2 ek n = p1 p2 ::: pk Let us count multiplicities, so that 15 has two prime factors, while 18 has three: 15 = 3 × 5 18 = 2 × 3 × 3 | {z } | {z } 2 3 You might expect equal chances for a number to have an even or odd number of prime factors.
    [Show full text]
  • The Mertens Function and the Proof of the Riemann's Hypothesis
    International Journal of Engineering and Advanced Technology (IJEAT) ISSN: 2249 – 8958, Volume-7 Issue-2, December 2017 The Mertens Function and The Proof of The Riemann's Hypothesis M. Sghiar 1/ 2+ϵ This conjecture is passed for real for a long time. But in Abstract : I will prove that M (n)= O(n ) where M is the Mertens function, and I deduce a new proof of the Riemann's 1984, Andrew Odlyzko and Hermante Riele [1] show that hypothesis. there is a number greater than 10 30 which invalidates it Keywords: Prime Number, number theory, distribution of prime (See also [3] and [4]) However it has been shown that the numbers, the law of prime numbers, the Riemann hypothesis, the Riemann's hypothesis [2] is equivalent to the following Riemann zeta function, the Mertens function. conjecture: M (n)= O(n1/ 2+ϵ) I. INTRODUCTION, RECALL, NOTATIONS AND Conjecture : DEFINITIONS The purpose of this paper is to prove this conjecture and to The Riemann's function ζ (see [2]) is a complex analytic deduce a new proof of Riemann's hypothesis. function that has appeared essentially in the theory of prime Recall also that in [7] it has been shown that prime numbers numbers. The position of its complex zeros is related to the are defined by a function Φ, follow a law in their distribution of prime numbers and is at the crossroads of appearance and their distribution is not a coincidence. many other theories. The Riemannn's hypothesis (see [5] and [6]) conjectured II. THE PROOF OF THE CONJECTURE 1 ζ x= 1/ 2+ϵ that all nontrivial zeros of are in the line 2 .
    [Show full text]
  • Sign Changes in Sums of the Liouville Function
    MATHEMATICS OF COMPUTATION Volume 77, Number 263, July 2008, Pages 1681–1694 S 0025-5718(08)02036-X Article electronically published on January 25, 2008 SIGN CHANGES IN SUMS OF THE LIOUVILLE FUNCTION PETER BORWEIN, RON FERGUSON, AND MICHAEL J. MOSSINGHOFF Abstract. The Liouville function λ(n) is the completely multiplicative func- − tion whose value is 1 at each prime. We develop some algorithms for com- n puting the sum T (n)= k=1 λ(k)/k, and use these methods to determine the smallest positive integer n where T (n) < 0. This answers a question originat- ing in some work of Tur´an, who linked the behavior of T (n) to questions about the Riemann zeta function. We also study the problem of evaluating P´olya’s n sum L(n)= k=1 λ(k), and we determine some new local extrema for this function, including some new positive values. 1. Introduction The Liouville function λ(n) is the completely multiplicative function defined by λ(p)=−1foreachprimep.Letζ(s) denote the Riemann zeta function, defined for complex s with (s) > 1by − 1 1 1 ζ(s)= = 1 − . ns ps n≥1 p It follows then that − ζ(2s) 1 1 λ(n) (1) = 1+ = ζ(s) ps ns p n≥1 for (s) > 1. Let L(n) denote the sum of the values of the Liouville function up to n, n L(n):= λ(k), k=1 so that L(n) records the difference between the number of positive integers up to n with an even number of prime factors and those with an odd number (counting multiplicity).
    [Show full text]
  • An Annotated Bibliography for Comparative Prime Number Theory
    AN ANNOTATED BIBLIOGRAPHY FOR COMPARATIVE PRIME NUMBER THEORY GREG MARTIN, JUSTIN SCARFY, ARAM BAHRINI, PRAJEET BAJPAI, JENNA DOWNEY, AMIR HOSSEIN PARVARDI, REGINALD SIMPSON, AND ETHAN WHITE LAST MODIFIED: APRIL 16, 2019 Abstract. ... 1. Introduction [basically a longer version of the abstract, together with notes on the organization of this article] 2. Notation [gathering together notation and other information that will be useful for the entire an- notated bibliography] The letter p will always denote a prime. 2.1. Elementary functions. Euler φ-function. ! and Ω and µ and Λ. λ(n) = (−1)Ω(n) is Liouville's function. 2 Also cq(a) = #fb (mod q): b ≡ a (mod q)g. Shorthand: cq = cq(1), which is also the × ×2 number of real characters (mod q), or equivalently the index (Z=qZ) : (Z=qZ) . It is easy to see, for (a; q) = 1, that cq(a) equals cq if a is a square (mod q) and 0 otherwise. Logarithmic integrals: Z 1−" dt Z x dt li(x) = lim + "!0+ 0 log t 1+" log t Z x dt Li(x) = = li(x) − li(2) 2 log t These functions have asymptotic expansions, one example of which is x x 2x 6x x li(x) = + + + + O : log x log2 x log3 x log4 x log5 x 2010 Mathematics Subject Classification. 11N13 (11Y35). 1 2 MARTIN, SCARFY, BAHRINI, BAJPAI, DOWNEY, PARVARDI, SIMPSON, AND WHITE 2.2. Prime counting functions. Prime counting functions: X π(x) = #fp ≤ xg = 1 p≤x 1 X Λ(n) X 1 X 1 Π(x) = = = π(x1=k) log n k k n≤x pk≤x k=1 1 X X Π∗(x) = 1 = π(x1=k) pk≤x k=1 X θ(x) = log p p≤x 1 X X X log x X 1 (x) = Λ(n) = log p = log p = θ(x1=k) log p k n≤x pk≤x p≤x k=1 2.3.
    [Show full text]
  • The Mertens Function and the Proof of the Riemann's
    THE MERTENS FUNCTION AND THE PROOF OF THE RIEMANN’S HYPOTHESIS Mohamed Sghiar To cite this version: Mohamed Sghiar. THE MERTENS FUNCTION AND THE PROOF OF THE RIEMANN’S HY- POTHESIS . International Journal of Engineering and Advanced Technology, Blue Eyes Intelligence Engineering & Sciences Publication Pvt. Ltd., 2017, Volume 7 (Issue 2). hal-01667383 HAL Id: hal-01667383 https://hal.archives-ouvertes.fr/hal-01667383 Submitted on 25 Apr 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. M. Sghiar. International Journal of Engineering and Advanced Technology (IJEAT) ISNN:2249-8958, Volume- 7 Issue-2, December 2017 THE MERTENS FUNCTION AND THE PROOF OF THE RIEMANN’S HYPOTHESIS Version of March 28, 2018 Deposited in the hal : <hal-01667383> version 4 M. SGHIAR [email protected] 9 Allée capitaine J. B Bossu, 21240, Talant, France Tel : 0033669753590 1 +) Abstract : I will prove that M(n) = O(n 2 where M is the Mertens function, and I deduce a new proof of the Riemann’s hypothesis. Keywords : Prime Number, number theory , distribution of prime num- bers, the law of prime numbers, the Riemann hypothesis, the Riemann zeta function, the Mertens function.
    [Show full text]