Evidence for the Riemann Hypothesis
|
|
- Francis Evans
- 5 years ago
- Views:
Transcription
1 Evidence for the Riemann Hypothesis Léo Agélas September 0, 014 Abstract Riemann Hypothesis (that all non-trivial zeros of the zeta function have real part one-half) is arguably the most important unsolved problem in contemporary mathematics due to its deep relation to the fundamental building blocks of the integers, the primes. The proof of the Riemann hypothesis will immediately verify a slew of dependent theorems ([4], []). In this paper, we give another evidence in favour of Riemann Hypothesis using a probabilistic approach. Keywords Riemann hypothesis; complex function; analytic function. 1 Introduction Riemann Hypothesis has defied proof so far, and very complicated and advanced abstract mathematics is often brought to bear on it. Does it need abstract mathematics, or just a flash of elementary inspiration. The Riemann zeta function, defined ([3] p. 807) by the series, ζ(s) = n=1 1, s C, (1) ns is analytic in Re(s) > 1 (see [4]). The basic connection between complex analysis and prime numbers is the following beautiful identity of Euler (see [4],[4],[5],[]): ζ(s) = p P ( 1 1 p s ) 1, Re(s) > 1, () where P = {, 3, 5, 7, 11, 13,...} is the set of prime positive integers p. Equation () is used to shown that ([4]), ζ(s) 0 in Re(s) > 1. (3) Riemann proved (see [3], [10]), that ζ(s) has an analytic continuation to the whole complex plane except for a simple pole at s = 1. Moreover, he showed that ζ(s) satisfies the functional equation (see [5],[10],[4]), ζ(s) = s π s 1 sin( πs )Γ(1 s)ζ(1 s), (4) where Γ(s) is the complex gamma function. From (4), it can be deduced that, 1. ζ(s) is nonzero in Re(s) < 0, except for the real zeros { m} m N, Department of Mathematics, IFPEN, 1 & 4 avenue Bois Préau, 985 Rueil-Malmaison Cedex, France (leo.agelas@ifpen.fr) 1
2 . { m} m N are the only real zeros of ζ(s), 3. ζ(s) possesses infinitely many non real zeros in the strip 0 Re(s) 1, (the so-called) critical strip for ζ(s) From (4), it also follows that ζ(s) has no zeros on Re(s) = 0, whence, ζ(s) possesses infinitely many non real zeros in 0 < Re(s) < 1. (5) It is interesting to mention that, ζ(s) has infinitely many non real zero in Re(s) = 1 (Hardy [7]), ζ(s) has at least 1 3 of its zeros on Re(s) = 1 (Levinson [19]). It also follows from (4) that if ζ(s) = 0 where s is non real then, {s, 1 s, 1 s} are also zeros of ζ. In 1859, B. Riemann formulated the following conjecture, Conjecture 1.1 (Riemann Hypothesis). All non real zeros of ζ(s) lies exactly on Re(s) = 1. We know that the zeta function was introduced as an analytic tool for studying prime numbers and some of the most important applications of the zeta functions belong to prime number theory. It was shown (see [5] p. 45), independently in 1896 by Hadamard and de la Vallée-Poussin, that ζ(s) has no zeros on Re(s) = 1, which provided the first proof of the Prime Number Theorem : π(x) x log x (x + ), (6) where π(x) = { number of primes p for which p x} (where x > 0). The key point in both of their proofs was that ζ(s) 0 for any s = 1 + i t, i.e., along the line with σ = 1. Their proof comes with an explicit error estimate: they showed in fact (see for example Theorem 6.9 in [0]), ( π(x) = li(x) + O uniformly for x. Here li(x) is the logarithmic integral, li(x) = x x exp(c log x) dt log t. ), (7) Furthermore, the error estimate in (7) might be improved, indeed there exists an equivalence between the error term in the Prime Number Theorem and the real part of the zeros of ζ(s) which states as follow, π(x) = li(x) + O ( x θ+ǫ), (8) is equivalent to ζ(s) 0 for Re(s) > θ, 1 θ < 1 (see Theorem 1.3 [15]). Moreover, Von Koch proved that the Riemann hypothesis is equivalent to the best possible bound for the error of the Prime Number Theorem (see [17]), namely Riemann hypothesis is equivalent to, π(x) = li(x) + O ( xlog(x) ). (9) In this paper, we give an evidence in favour of Riemann Hypothesis using probabilistic arguments.
3 Riemann Hypothesis Let us introduce the Mobius function µ defined for all positive integers by 1 if n = 1, µ(n) = ( 1) r if n is the product of r distinct primes, 0 if n is divisible by the square of a prime. (10) The Mobius function has generating functions n=1 µ(n) n s = 1 ζ(s), for Re(s) > 1 (see [] p. 9, see also [1] p.130, [9] p , [18], [6]). It is known (see, for example, Titchmarsh [[5], p. 370]) that a necessary and sufficient condition for the truth of the Riemann hypothesis is that where M(x) = n x µ(n) for x 1. M(x) = O(x 1 +ǫ ), for all ǫ > 0, (11) As it was mentionned in [8] and [1], the condition M(x) = 0(x 1 +ǫ ) would be true if the Mobius sequence {µ(n)} were a random sequence, taking the values 1, 0, and 1, with specified probabilities, those of 1 and 1 being equal. Our proof follows this line, one argument in favour of this probabilistic approach is that the Mobius sequence {µ(n)} satisfies what we call the strong law of large numbers in probability theory, namely (see for example [0], p. 18), lim n µ(k) k=1 n Let us precise our approach. If A is a set of positive integers, we denote by A N the number of its elements among the first N integers. If the limit = 0. A N lim N N = Prob(A), exists, it is called the probability of a positive integer to be in A. For any a N, we introduce the set of positive integers divisible by a, E a = {n N, a n}. Let us show that Prob(E a ) = 1 a. Indeed, for any N N, let E N = {n N, a n and n N}, we have [ ] N card(e N ) = and therefore, we get N a a 1 < card(e N) N which yields to, a 1 a 1 N card(e N) 1 N a. card(e N ) Then, we deduce that lim = 1 N N a which give us Prob(E a) = 1, this reveals that the probability a that a positive integer to be divisible by a is 1 a. For p and q two distinct primes, let us show that the events of being divisible by p and q are independent. For this, we consider the set E p,q = {n N, p n and q n}. We notice that for any n E p,q, we have p n, q n and since p, q are two distinct primes, then (p, q) = 1, therefore we infer that pq n which implies that 3
4 n E pq, this means that E p,q E pq. Moreover, for any n E pq, we have pq n which implies p n and q n and thus n E p,q, hence we deduce that E pq E p,q. Therefore, we get E p,q = E pq, Then we deduce that, Prob(E p,q ) = Prob(E pq ) = 1 pq = Prob(E p )Prob(E q ), which reveals that the events of being divisible by p and q are independent. This holds, of course, for any number of distinct primes. For any integer n > 1, if the distinct prime factors of n are p 1,..., p r, and if p i occurs as a factor a i times, then thanks to the fundamental theorem of arithmetic (see for example Theorem 1.10 in []), we get the unique representation of n as products of powers of its prime divisors, namely, n = r i=1 p ai i. (1) Then, by introducing α p (n) the power with which the prime p appears in the (unique) representation of n as a product of powers of its prime divisors, we get, n = p p αp(n). (13) The product p is understood as the product over the infinite set of prime numbers ranked in ascending order, notice also that α p (n) can be equal to zero. A positive integer n is a square-free number if and only if in the prime factorization of n, (13), no prime number occurs more than once, another way of stating the same is that µ(n) 0. Then, by introducing the function n ρ p (n) defined on N as follows, ρ p (n) = { 1, p n 0, p n, (14) we infer that if n is a square-free number, the unique representation of n is, n = p p ρp(n). (15) We define ν(n) p ρ p (n), the number of prime divisors. Since the events of being divisible by any number of distinct primes are independent, then thanks to (15), we deduce that the functions ρ p {0, 1} are independent, this suggests that, in some sense, the distribution of values of ν(n) may be given by a ν(n) log log n normal law. Indeed, the Erdõs-Kac Theorem states that the probability distribution of log log n is the standard normal distribution { N(0, 1) (see Theorem} 7.1 in [0], [11],[16]), more precisely, for any a < b, by setting E a,b = n N ν(n) log log n ; a b, we have, log log n Prob(E a,b ) = 1 b e y / dy. π { } Moreover, by setting E g = n N ; ν(n) log log n g n where g n is a sequence approaching infinity: log log n lim g n =, we have (see [16], [11]), a Prob(E g ) = 1. 4
5 This reveals that for larger value of n that ν(n) behaves like a Gaussian random variable and is approximatively equal to log log n, we notice that for any n square-free number that µ(n) = ( 1) ν(n), then among the square free numbers, successive evaluations of µ(n) = ±1 may be independent and µ(n) behaves like a random variable, and therefore among the square-free numbers each evaluation of µ(n) may behave like an party of coin tossing. { } From (15), we notice that the set of square-free numbers, F, can be written as F = p βp, β p {0, 1}. Then, the set F is in bijection with the set of infinite binary sequences {0, 1}. This bijection reveals again the independence between square-free numbers. The set {0, 1} can be seen as a coin tossing where 0 and 1 means respectively Tails and Heads. Thus, a square-free number can be seen as an endless party of coin tossing. Therefore, the event a square-free number have an even number of prime factors matches with the event we get an even number of Heads after an endless party of coin tossing. Let us calculate the probability that a square-free number may have an even number of prime factors. Let N > 1, the probability, p N, to get an even number of Heads after a party of N coin tosses is given by ( ) N k k N,k N p N = N. (16) Furthermore, we have (see [1], p. 36), k N,k N ( N k ) = N 1. (17) Then, from (16), we deduce p N = 1. Therefore, for any N > 1, the probability to get an even number of Heads after a party of N coin tosses is 1. Then, we infer that the probability to get an even number p of Heads after an endless party of coin tossing is 1 which implies that the probability that a square-free number may have an even number of prime factors is 1. Therefore, we deduce that the probability that a square-free number may have an odd number of prime factors is also 1. For any n square-free number, n has an even number of prime factors if and only if µ(n) = 1 and n has an odd number of prime factors if and only if µ(n) = 1. Therefore, we deduce that for n square-free number, the probability that µ(n) = 1 is equal to 1 and the probability that µ(n) = 1 is also equal to 1. Thanks to the Kolmogorov s law of iterated logarithm which holds also for p random sequences (see [6]) and states that for any random walk, {S n } with the increment of zero mean and finite variance, σ, the following holds almost surely (see [13]): lim sup lim inf S n = 1, (18) σ n log log n S n = 1. (19) σ n log log n Therefore, if we can apply Kolmogorov s law of iterated logarithm to {M n } which behaves like a random walk, with the increment of zero mean and variance of one, we will obtain, lim sup M(n) n loglog n = 1, (0) 5
6 M(n) lim inf = 1. (1) n loglog n We observe for all x 1, M(x) = M([x]) and from (0), (1), we will obtain, lim sup x lim inf x M(x) xloglog x = 1, () M(x) xlog log x = 1. (3) Then, thanks to () and (3), we infer that (11) holds and therefore Riemann Hypothesis will be proved. References [1] G. E. Andrews : Number Theory, Saunders, (1971). [] T. M. Apostol : Introduction to Analytic Number Theory, Undergraduate Texts in Mathematics, Springer-Verlag, (1976). [3] M. Abramowitz and I.A. Stegun : Handbook of Mathematical Functions, Dover, (1964). [4] P. Borwien, S. Choi, B. Rooney, and A. Weirathmueller : The Riemann Hypothesis: A Resource for the Afficionado and Virtuoso Alike, Springer, (008). [5] J. B. Conrey, The Riemann Hypothesis, Notices of the American Mathematical Society, Vol. 50, pp , (003). [6] H. Davenport : Multiplicative Number Theory, nd edition, revised by H. Montgomery, Graduate Texts in Mathematics, Vol. 74, Springer-Verlag, New York, (1980). [7] G. H. Hardy : Sur les zéros de la fonction ζ(s) de Riemann, C. R. Acad. Sci. Paris 158, , (1914). [8] Denjoy, A. : L Hypothèse de Riemann sur la distribution des zéros de ζ(s), reliée à la théorie des probabilités, Comptes Rendus Acad. Sci. Paris 19, , (1931). [9] J. Derbyshire : Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics. New York: Penguin, pp , (004). [10] H.M. Edwards : Riemann s zeta function Acad. Press. New York. (1974). [11] Erdõs, P. and Kac, M.: The Gaussian Law of Errors in the Theory of Additive Number Theoretic Functions, American Journal of Mathematics 6, (1940). [1] Good, I. J.; Churchhouse, R. F.: The Riemann hypothesis and pseudorandom features of the Möbius sequence, Math. Comp., , (1968). [13] Hartman, P., Wintner, A.: On the law of the iterated logarithm, Amer. J. Math., 63, p , (1941). [14] Hardy, G. H. and Wright, E. M. : An Introduction to the Theory of Numbers. 5th ed. Oxford, England: Clarendon Press, pp and 55, (1979). [15] Ivić, A. : The Riemann zeta function. John Wiley, New York (1985). [16] Kac, M.: Statistical Independence in Probability, Analysis and Number Theory. John Wiley and Sons, Inc, (1959). 6
7 [17] Koch, H. von. : Sur la distribution des nombres premiers. Acta Math. 4, , (1901). [18] A. A. Karatsuba and S. M. Voronin : The Riemann zeta-function, Berlin - New York De Gruyter (199). [19] N. Levinson : More than one third of the zeros of Riemann s zeta-function are on σ = 1, Adv. Math. 13, , (1974). [0] H. L. Montgomery and R. C. Vaughan : Multiplicative Number Theory I: Classical Theory, Cambridge University Press (006). [1] T. Nagell : Introduction to Number Theory. New York: Wiley, p. 7, (1951). [] K. Sabbagh, The Riemann Hypothesis: The Greatest Unsolved Problem in Mathematics, Farrar, Straus, and Giroux, (00). [3] B. Riemann : Über die Anzahl der Prinzahlen unter einer gegebener Gröse. Mo-nastsber. Akad. Berlin, , (1859). [4] E. M. Stein and R. Shakarchi, Complex Analysis, Princeton Lectures in Analysis II, Princeton University Press, Princeton and Oxford, (003). [5] E. C. Titchmarsh : The Theory of the Riemann Zeta-function, nd edition (revised by D. R. Heath- Brown), Oxford University Press, Oxford, (1986). [6] Wang, Y. : Resource bounded randomness and computational complexity, Theoretical Computer Science 37, 33-55, (000). 7
Generalized Riemann Hypothesis
Generalized Riemann Hypothesis Léo Agélas To cite this version: Léo Agélas. Generalized Riemann Hypothesis. 9 pages.. HAL Id: hal-74768 https://hal.archives-ouvertes.fr/hal-74768v Submitted
More informationThe Riemann Hypothesis
The Riemann Hypothesis Matilde N. Laĺın GAME Seminar, Special Series, History of Mathematics University of Alberta mlalin@math.ualberta.ca http://www.math.ualberta.ca/~mlalin March 5, 2008 Matilde N. Laĺın
More informationRiemann s Zeta Function and the Prime Number Theorem
Riemann s Zeta Function and the Prime Number Theorem Dan Nichols nichols@math.umass.edu University of Massachusetts Dec. 7, 2016 Let s begin with the Basel problem, first posed in 1644 by Mengoli. Find
More informationarxiv: v2 [math.gm] 24 May 2016
arxiv:508.00533v [math.gm] 4 May 06 A PROOF OF THE RIEMANN HYPOTHESIS USING THE REMAINDER TERM OF THE DIRICHLET ETA FUNCTION. JEONWON KIM Abstract. The Dirichlet eta function can be divided into n-th partial
More informationA Simple Counterexample to Havil s Reformulation of the Riemann Hypothesis
A Simple Counterexample to Havil s Reformulation of the Riemann Hypothesis Jonathan Sondow 209 West 97th Street New York, NY 0025 jsondow@alumni.princeton.edu The Riemann Hypothesis (RH) is the greatest
More informationRiemann Zeta Function and Prime Number Distribution
Riemann Zeta Function and Prime Number Distribution Mingrui Xu June 2, 24 Contents Introduction 2 2 Definition of zeta function and Functional Equation 2 2. Definition and Euler Product....................
More informationThe zeros of the derivative of the Riemann zeta function near the critical line
arxiv:math/07076v [mathnt] 5 Jan 007 The zeros of the derivative of the Riemann zeta function near the critical line Haseo Ki Department of Mathematics, Yonsei University, Seoul 0 749, Korea haseoyonseiackr
More informationarxiv: v22 [math.gm] 20 Sep 2018
O RIEMA HYPOTHESIS arxiv:96.464v [math.gm] Sep 8 RUIMIG ZHAG Abstract. In this work we present a proof to the celebrated Riemann hypothesis. In it we first apply the Plancherel theorem properties of the
More informationarxiv: v2 [math.nt] 28 Feb 2010
arxiv:002.47v2 [math.nt] 28 Feb 200 Two arguments that the nontrivial zeros of the Riemann zeta function are irrational Marek Wolf e-mail:mwolf@ift.uni.wroc.pl Abstract We have used the first 2600 nontrivial
More informationA Painless Overview of the Riemann Hypothesis
A Painless Overview of the Riemann Hypothesis [Proof Omitted] Peter Lynch School of Mathematics & Statistics University College Dublin Irish Mathematical Society 40 th Anniversary Meeting 20 December 2016.
More informationChapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem
Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if
More informationRiemann s explicit formula
Garrett 09-09-20 Continuing to review the simple case (haha!) of number theor over Z: Another example of the possibl-suprising application of othe things to number theor. Riemann s explicit formula More
More informationTheorem 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.
Chapter 1 Introduction 1.1 The Prime Number Theorem In this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if lim f(/g( = 1, and denote by log the natural
More informationA Painless Overview of the Riemann Hypothesis
A Painless Overview of the Riemann Hypothesis [Proof Omitted] Peter Lynch School of Mathematics & Statistics University College Dublin Irish Mathematical Society 40 th Anniversary Meeting 20 December 2016.
More informationarxiv: v11 [math.gm] 30 Oct 2018
Noname manuscript No. will be inserted by the editor) Proof of the Riemann Hypothesis Jinzhu Han arxiv:76.99v [math.gm] 3 Oct 8 Received: date / Accepted: date Abstract In this article, we get two methods
More informationChapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem
Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f g as if lim
More informationRiemann s insight. Where it came from and where it has led. John D. Dixon, Carleton University. November 2009
Riemann s insight Where it came from and where it has led John D. Dixon, Carleton University November 2009 JDD () Riemann hypothesis November 2009 1 / 21 BERNHARD RIEMANN Ueber die Anzahl der Primzahlen
More informationGauss and Riemann versus elementary mathematics
777-855 826-866 Gauss and Riemann versus elementary mathematics Problem at the 987 International Mathematical Olympiad: Given that the polynomial [ ] f (x) = x 2 + x + p yields primes for x =,, 2,...,
More informationThe Continuing Story of Zeta
The Continuing Story of Zeta Graham Everest, Christian Röttger and Tom Ward November 3, 2006. EULER S GHOST. We can only guess at the number of careers in mathematics which have been launched by the sheer
More informationRiemann s ζ-function
Int. J. Contemp. Math. Sciences, Vol. 4, 9, no. 9, 45-44 Riemann s ζ-function R. A. Mollin Department of Mathematics and Statistics University of Calgary, Calgary, Alberta, Canada, TN N4 URL: http://www.math.ucalgary.ca/
More informationSome Arithmetic Functions Involving Exponential Divisors
2 3 47 6 23 Journal of Integer Sequences, Vol. 3 200, Article 0.3.7 Some Arithmetic Functions Involving Exponential Divisors Xiaodong Cao Department of Mathematics and Physics Beijing Institute of Petro-Chemical
More informationAn Introduction to the Riemann Hypothesis
An Introduction to the Riemann Hypothesis Theodore J. Yoder May 7, Abstract Here we discuss the most famous unsolved problem in mathematics, the Riemann hypothesis. We construct the zeta function and its
More informationThe Riemann Hypothesis
The Riemann Hypothesis Danny Allen, Kyle Bonetta-Martin, Elizabeth Codling and Simon Jefferies Project Advisor: Tom Heinzl, School of Computing, Electronics and Mathematics, Plymouth University, Drake
More informationNeedles and Numbers. The Buffon Needle Experiment
eedles and umbers This excursion into analytic number theory is intended to complement the approach of our textbook, which emphasizes the algebraic theory of numbers. At some points, our presentation lacks
More informationPrimes, queues and random matrices
Primes, queues and random matrices Peter Forrester, M&S, University of Melbourne Outline Counting primes Counting Riemann zeros Random matrices and their predictive powers Queues 1 / 25 INI Programme RMA
More informationNotes on the Riemann Zeta Function
Notes on the Riemann Zeta Function March 9, 5 The Zeta Function. Definition and Analyticity The Riemann zeta function is defined for Re(s) > as follows: ζ(s) = n n s. The fact that this function is analytic
More information1 Euler s idea: revisiting the infinitude of primes
8.785: Analytic Number Theory, MIT, spring 27 (K.S. Kedlaya) The prime number theorem Most of my handouts will come with exercises attached; see the web site for the due dates. (For example, these are
More informationPrime Number Theory and the Riemann Zeta-Function
5262589 - Recent Perspectives in Random Matrix Theory and Number Theory Prime Number Theory and the Riemann Zeta-Function D.R. Heath-Brown Primes An integer p N is said to be prime if p and there is no
More informationThe zeros of the Dirichlet Beta Function encode the odd primes and have real part 1/2
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 Type of the Paper (Article.) The zeros of the Dirichlet Beta Function encode the odd primes and have real part 1/2 Anthony Lander Birmingham Women s and
More informationINFORMATION-THEORETIC EQUIVALENT OF RIEMANN HYPOTHESIS
INFORMATION-THEORETIC EQUIVALENT OF RIEMANN HYPOTHESIS K. K. NAMBIAR ABSTRACT. Riemann Hypothesis is viewed as a statement about the capacity of a communication channel as defined by Shannon. 1. Introduction
More informationA Proof of the Riemann Hypothesis using Rouché s Theorem and an Infinite Subdivision of the Critical Strip.
A Proof of the Riemann Hypothesis using Rouché s Theorem an Infinite Subdivision of the Critical Strip. Frederick R. Allen ABSTRACT. Rouché s Theorem is applied to the critical strip to show that the only
More informationFrederick R. Allen. 16th October 2017
A Proof of the Riemann Hypothesis using a Subdivision of the Critical Strip defined by the family of curves Rl[ξ(s)] i =0 which intersect the Critical Line at the roots ρ i of ξ(s). Frederick R. Allen
More informationOn Some Mean Value Results for the Zeta-Function and a Divisor Problem
Filomat 3:8 (26), 235 2327 DOI.2298/FIL6835I Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On Some Mean Value Results for the
More informationGAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT
Journal of Prime Research in Mathematics Vol. 8 202, 28-35 GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT JORGE JIMÉNEZ URROZ, FLORIAN LUCA 2, MICHEL
More informationTHE RIEMANN HYPOTHESIS: IS TRUE!!
THE RIEMANN HYPOTHESIS: IS TRUE!! Ayman MACHHIDAN Morocco Ayman.mach@gmail.com Abstract : The Riemann s zeta function is defined by = for complex value s, this formula have sense only for >. This function
More informationFractional Derivative of the Riemann Zeta Function
E. Guariglia Fractional Derivative of the Riemann Zeta Function Abstract: Fractional derivative of the Riemann zeta function has been explicitly computed and the convergence of the real part and imaginary
More informationMath 229: Introduction to Analytic Number Theory The product formula for ξ(s) and ζ(s); vertical distribution of zeros
Math 9: Introduction to Analytic Number Theory The product formula for ξs) and ζs); vertical distribution of zeros Behavior on vertical lines. We next show that s s)ξs) is an entire function of order ;
More informationMath 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative
Math 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative This chapter is another review of standard material in complex analysis. See for instance
More informationMath 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative
Math 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative This chapter is another review of standard material in complex analysis. See for instance
More informationTwo Arguments that the Nontrivial Zeros of the Riemann Zeta Function are Irrational
CMST 244) 25-220 208) DOI:0.292/cmst.208.0000049 Two Arguments that the Nontrivial Zeros of the Riemann Zeta Function are Irrational Marek Wolf Cardinal Stefan Wyszynski University Faculty of Mathematics
More informationTwin primes (seem to be) more random than primes
Twin primes (seem to be) more random than primes Richard P. Brent Australian National University and University of Newcastle 25 October 2014 Primes and twin primes Abstract Cramér s probabilistic model
More informationDivisibility. 1.1 Foundations
1 Divisibility 1.1 Foundations The set 1, 2, 3,...of all natural numbers will be denoted by N. There is no need to enter here into philosophical questions concerning the existence of N. It will suffice
More informationThe Riemann Hypothesis and Pseudorandom Features of the Möbius Sequence
The Riemann Hypothesis and Pseudorandom Features of the Möbius Sequence By I. J. Good* and R. F. Churchhouse Abstract. A study of the cumulative sums of the Möbius function on the Atlas Computer of the
More informationDISPROOFS OF RIEMANN S HYPOTHESIS
In press at Algebras, Groups and Geometreis, Vol. 1, 004 DISPROOFS OF RIEMANN S HYPOTHESIS Chun-Xuan, Jiang P.O.Box 394, Beijing 100854, China and Institute for Basic Research P.O.Box 1577, Palm Harbor,
More information(k), is put forward and explicated.
A Note on the Zero-Free Regions of the Zeta Function N. A. Carella, October, 2012 Abstract: This note contributes a new zero-free region of the zeta function ζ(s), s = σ + it, s C. The claimed zero-free
More informationEXTENDED RECIPROCAL ZETA FUNCTION AND AN ALTERNATE FORMULATION OF THE RIEMANN HYPOTHESIS. M. Aslam Chaudhry. Received May 18, 2007
Scientiae Mathematicae Japonicae Online, e-2009, 05 05 EXTENDED RECIPROCAL ZETA FUNCTION AND AN ALTERNATE FORMULATION OF THE RIEMANN HYPOTHESIS M. Aslam Chaudhry Received May 8, 2007 Abstract. We define
More informationMATH3500 The 6th Millennium Prize Problem. The 6th Millennium Prize Problem
MATH3500 The 6th Millennium Prize Problem RH Some numbers have the special property that they cannot be expressed as the product of two smaller numbers, e.g., 2, 3, 5, 7, etc. Such numbers are called prime
More informationZeros of the Riemann Zeta-Function on the Critical Line
Zeros of the Riemann Zeta-Function on the Critical Line D.R. Heath-Brown Magdalen College, Oxford It was shown by Selberg [3] that the Riemann Zeta-function has at least c log zeros on the critical line
More informationProbabilistic Aspects of the Integer-Polynomial Analogy
Probabilistic Aspects of the Integer-Polynomial Analogy Kent E. Morrison Department of Mathematics California Polytechnic State University San Luis Obispo, CA 93407 kmorriso@calpoly.edu Zhou Dong Department
More information150 Years of Riemann Hypothesis.
150 Years of Riemann Hypothesis. Julio C. Andrade University of Bristol Department of Mathematics April 9, 2009 / IMPA Julio C. Andrade (University of Bristol Department 150 of Years Mathematics) of Riemann
More informationUNIVERSALITY OF THE RIEMANN ZETA FUNCTION: TWO REMARKS
Annales Univ. Sci. Budapest., Sect. Comp. 39 (203) 3 39 UNIVERSALITY OF THE RIEMANN ZETA FUNCTION: TWO REMARKS Jean-Loup Mauclaire (Paris, France) Dedicated to Professor Karl-Heinz Indlekofer on his seventieth
More informationLecture 1: Small Prime Gaps: From the Riemann Zeta-Function and Pair Correlation to the Circle Method. Daniel Goldston
Lecture 1: Small Prime Gaps: From the Riemann Zeta-Function and Pair Correlation to the Circle Method Daniel Goldston π(x): The number of primes x. The prime number theorem: π(x) x log x, as x. The average
More informationThe Prime Number Theorem
Chapter 3 The Prime Number Theorem This chapter gives without proof the two basic results of analytic number theory. 3.1 The Theorem Recall that if f(x), g(x) are two real-valued functions, we write to
More informationA Proof of the Riemann Hypothesis and Determination of the Relationship Between Non- Trivial Zeros of Zeta Functions and Prime Numbers
A Proof of the Riemann Hypothesis and Determination of the Relationship Between on- Trivial Zeros of Zeta Functions and Prime umbers ABSTRACT Murad Ahmed Abu Amr MSc Degree in Physics, Mutah University
More informationX-RAYS OF THE RIEMANN ZETA AND XI FUNCTIONS
X-RAYS OF THE RIEMANN ZETA AND XI FUNCTIONS by James M. Hill and Robert K. Wilson, School of Mathematics and Applied Statistics, University of Wollongong, Wollongong, NSW 2522 Australia email: jhill@uow.edu.au
More informationHarmonic sets and the harmonic prime number theorem
Harmonic sets and the harmonic prime number theorem Version: 9th September 2004 Kevin A. Broughan and Rory J. Casey University of Waikato, Hamilton, New Zealand E-mail: kab@waikato.ac.nz We restrict primes
More informationAverage Orders of Certain Arithmetical Functions
Average Orders of Certain Arithmetical Functions Kaneenika Sinha July 26, 2006 Department of Mathematics and Statistics, Queen s University, Kingston, Ontario, Canada K7L 3N6, email: skaneen@mast.queensu.ca
More informationDedekind zeta function and BDS conjecture
arxiv:1003.4813v3 [math.gm] 16 Jan 2017 Dedekind zeta function and BDS conjecture Abstract. Keywords: Dang Vu Giang Hanoi Institute of Mathematics Vietnam Academy of Science and Technology 18 Hoang Quoc
More informationPretentiousness in analytic number theory. Andrew Granville A report on joint work with K. Soundararajan, and Antal Balog
Pretentiousness in analytic number theory Andrew Granville A report on joint work with K. Soundararajan, and Antal Balog The number of primes up to x Gauss, Christmas eve 1849: As a boy of 15 or 16, I
More informationANSWER TO A QUESTION BY BURR AND ERDŐS ON RESTRICTED ADDITION, AND RELATED RESULTS Mathematics Subject Classification: 11B05, 11B13, 11P99
ANSWER TO A QUESTION BY BURR AND ERDŐS ON RESTRICTED ADDITION, AND RELATED RESULTS N. HEGYVÁRI, F. HENNECART AND A. PLAGNE Abstract. We study the gaps in the sequence of sums of h pairwise distinct elements
More informationContent. CIMPA-ICTP Research School, Nesin Mathematics Village The Riemann zeta function Michel Waldschmidt
Artin L functions, Artin primitive roots Conjecture and applications CIMPA-ICTP Research School, Nesin Mathematics Village 7 http://www.rnta.eu/nesin7/material.html The Riemann zeta function Michel Waldschmidt
More informationRiemann Paper (1859) Is False
Riemann Paper (859) I Fale Chun-Xuan Jiang P O Box94, Beijing 00854, China Jiangchunxuan@vipohucom Abtract In 859 Riemann defined the zeta function ζ () From Gamma function he derived the zeta function
More informationAN EASY GENERALIZATION OF EULER S THEOREM ON THE SERIES OF PRIME RECIPROCALS
AN EASY GENERALIZATION OF EULER S THEOREM ON THE SERIES OF PRIME RECIPROCALS PAUL POLLACK Abstract It is well-known that Euclid s argument can be adapted to prove the infinitude of primes of the form 4k
More informationA PROBLEM ON THE CONJECTURE CONCERNING THE DISTRIBUTION OF GENERALIZED FERMAT PRIME NUMBERS (A NEW METHOD FOR THE SEARCH FOR LARGE PRIMES)
A PROBLEM ON THE CONJECTURE CONCERNING THE DISTRIBUTION OF GENERALIZED FERMAT PRIME NUMBERS A NEW METHOD FOR THE SEARCH FOR LARGE PRIMES) YVES GALLOT Abstract Is it possible to improve the convergence
More informationarxiv: v1 [math.gm] 1 Jun 2018
arxiv:806.048v [math.gm] Jun 08 On Studying the Phase Behavior of the Riemann Zeta Function Along the Critical Line Henrik Stenlund June st, 08 Abstract The critical line of the Riemann zeta function is
More informationOn the Order of the Mertens Function
On the Order of the Mertens Function Tadej Kotnik and Jan van de Lune CONTENTS 1. Introduction 2. The General Behavior of q(x) 3. Exact and Approximate Computations of q(x) 4. The Search for Increasingly
More informationIMPROVING RIEMANN PRIME COUNTING
IMPROVING RIEMANN PRIME COUNTING MICHEL PLANAT AND PATRICK SOLÉ arxiv:1410.1083v1 [math.nt] 4 Oct 2014 Abstract. Prime number theorem asserts that (at large x) the prime counting function π(x) is approximately
More informationTHE LAPLACE TRANSFORM OF THE FOURTH MOMENT OF THE ZETA-FUNCTION. Aleksandar Ivić
THE LAPLACE TRANSFORM OF THE FOURTH MOMENT OF THE ZETA-FUNCTION Aleksandar Ivić Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. (2), 4 48. Abstract. The Laplace transform of ζ( 2 +ix) 4 is investigated,
More informationWhy is the Riemann Hypothesis Important?
Why is the Riemann Hypothesis Important? Keith Conrad University of Connecticut August 11, 2016 1859: Riemann s Address to the Berlin Academy of Sciences The Zeta-function For s C with Re(s) > 1, set ζ(s)
More informationIf you enter a non-trivial zero value in x, the value of the equation is zero.
Original article Riemann hypothesis seems correct Toshiro Takami mmm82889@yahoo.co.jp April 10, 2019 Abstract If you enter a non-trivial zero value in x, the value of the equation is zero. The above equation
More informationGeneralized Euler constants
Math. Proc. Camb. Phil. Soc. 2008, 45, Printed in the United Kingdom c 2008 Cambridge Philosophical Society Generalized Euler constants BY Harold G. Diamond AND Kevin Ford Department of Mathematics, University
More informationPrimes. Rational, Gaussian, Industrial Strength, etc. Robert Campbell 11/29/2010 1
Primes Rational, Gaussian, Industrial Strength, etc Robert Campbell 11/29/2010 1 Primes and Theory Number Theory to Abstract Algebra History Euclid to Wiles Computation pencil to supercomputer Practical
More informationProofs of the infinitude of primes
Proofs of the infinitude of primes Tomohiro Yamada Abstract In this document, I would like to give several proofs that there exist infinitely many primes. 0 Introduction It is well known that the number
More informationStrong Normality of Numbers
Strong Normality of Numbers Adrian Belshaw Peter Borwein... the problem of knowing whether or not the digits of a number like 2 satisfy all the laws one could state for randomly chosen digits, still seems...
More informationThe Prime Number Theorem
The Prime Number Theorem We study the distribution of primes via the function π(x) = the number of primes x 6 5 4 3 2 2 3 4 5 6 7 8 9 0 2 3 4 5 2 It s easier to draw this way: π(x) = the number of primes
More informationELECTRICAL EQUIVALENT OF RIEMANN HYPOTHESIS
ELECTRICAL EQUIVALENT OF RIEMANN HYPOTHESIS K. K. NAMBIAR ABSTRACT. Riemann Hypothesis is viewed as a statement about the power dissipated in an electrical network. 1. Introduction 2. Definitions and...
More informationEigenvalues of the Redheffer Matrix and Their Relation to the Mertens Function
Eigenvalues of the Redheffer Matrix and Their Relation to the Mertens Function Will Dana June 7, 205 Contents Introduction. Notations................................ 2 2 Number-Theoretic Background 2 2.
More informationFunctional equation in the fundamental class of functions and the type of explicit formula. Muharem Avdispahić and Lejla Smajlović
Functional equation in the fundamental class of functions and the type of explicit formula Muharem Avdispahić and Lejla Smajlović Department of mathematics, University of Sarajevo Zmaja od Bosne 35, 7000
More informationStudy of some equivalence classes of primes
Notes on Number Theory and Discrete Mathematics Print ISSN 3-532, Online ISSN 2367-8275 Vol 23, 27, No 2, 2 29 Study of some equivalence classes of primes Sadani Idir Department of Mathematics University
More informationBefore giving the detailed proof, we outline our strategy. Define the functions. for Re s > 1.
Chapter 7 The Prime number theorem for arithmetic progressions 7. The Prime number theorem We denote by π( the number of primes. We prove the Prime Number Theorem. Theorem 7.. We have π( as. log Before
More informationSOME IDENTITIES FOR THE RIEMANN ZETA-FUNCTION II. Aleksandar Ivić
FACTA UNIVERSITATIS (NIŠ Ser. Math. Inform. 2 (25, 8 SOME IDENTITIES FOR THE RIEMANN ZETA-FUNCTION II Aleksandar Ivić Abstract. Several identities for the Riemann zeta-function ζ(s are proved. For eample,
More informationArithmetic Statistics Lecture 1
Arithmetic Statistics Lecture 1 Álvaro Lozano-Robledo Department of Mathematics University of Connecticut May 28 th CTNT 2018 Connecticut Summer School in Number Theory Question What is Arithmetic Statistics?
More informationarxiv: v3 [math.nt] 8 Jan 2019
HAMILTONIANS FOR THE ZEROS OF A GENERAL FAMILY OF ZETA FUNTIONS SU HU AND MIN-SOO KIM arxiv:8.662v3 [math.nt] 8 Jan 29 Abstract. Towards the Hilbert-Pólya conjecture, in this paper, we present a general
More informationON THE SPEISER EQUIVALENT FOR THE RIEMANN HYPOTHESIS. Extended Selberg class, derivatives of zeta-functions, zeros of zeta-functions
ON THE SPEISER EQUIVALENT FOR THE RIEMANN HYPOTHESIS RAIVYDAS ŠIMĖNAS Abstract. A. Speiser showed that the Riemann hypothesis is equivalent to the absence of non-trivial zeros of the derivative of the
More informationSome unusual identities for special values. of the Riemann zeta function. by William D. Banks. 1. Introduction p s ) 1
Some unusual identities for special values of the Riemann zeta function by William D Banks Abstract: In this paper we use elementary methods to derive some new identities for special values of the Riemann
More informationVerbatim copying and redistribution of this document. are permitted in any medium provided this notice and. the copyright notice are preserved.
New Results on Primes from an Old Proof of Euler s by Charles W. Neville CWN Research 55 Maplewood Ave. West Hartford, CT 06119, U.S.A. cwneville@cwnresearch.com September 25, 2002 Revision 1, April, 2003
More informationrama.tex; 21/03/2011; 0:37; p.1
rama.tex; /03/0; 0:37; p. Multiple Gamma Function and Its Application to Computation of Series and Products V. S. Adamchik Department of Computer Science, Carnegie Mellon University, Pittsburgh, USA Abstract.
More informationMath 259: Introduction to Analytic Number Theory How small can disc(k) be for a number field K of degree n = r 1 + 2r 2?
Math 59: Introduction to Analytic Number Theory How small can disck be for a number field K of degree n = r + r? Let K be a number field of degree n = r + r, where as usual r and r are respectively the
More informationA PROBABILISTIC PROOF OF WALLIS S FORMULA FOR π. ( 1) n 2n + 1. The proof uses the fact that the derivative of arctan x is 1/(1 + x 2 ), so π/4 =
A PROBABILISTIC PROOF OF WALLIS S FORMULA FOR π STEVEN J. MILLER There are many beautiful formulas for π see for example [4]). The purpose of this note is to introduce an alternate derivation of Wallis
More informationFRACTIONAL HYPERGEOMETRIC ZETA FUNCTIONS
FRACTIONAL HYPERGEOMETRIC ZETA FUNCTIONS HUNDUMA LEGESSE GELETA, ABDULKADIR HASSEN Both authors would like to dedicate this in fond memory of Marvin Knopp. Knop was the most humble and exemplary teacher
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationAlan Turing and the Riemann hypothesis. Andrew Booker
Alan Turing and the Riemann hypothesis Andrew Booker Introduction to ζ(s) and the Riemann hypothesis The Riemann ζ-function is defined for a complex variable s with real part R(s) > 1 by ζ(s) := n=1 1
More informationThe primitive root theorem
The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under
More informationProof of Lagarias s Elementary Version of the Riemann Hypothesis.
Proof of Lagarias s Elementary Version of the Riemann Hypothesis. Stephen Marshall 27 Nov 2018 Abstract The Riemann hypothesis is a conjecture that the Riemann zeta function has its zeros only at the negative
More informationVII.8. The Riemann Zeta Function.
VII.8. The Riemann Zeta Function VII.8. The Riemann Zeta Function. Note. In this section, we define the Riemann zeta function and discuss its history. We relate this meromorphic function with a simple
More informationX-RAY OF RIEMANN S ZETA-FUNCTION 23
X-RAY OF RIEMANN S ZETA-FUNCTION 23 7. Second Theorem of Speiser. We present here Speiser s proof, and, as we have already said, his methods are between the proved and the acceptable. Everybody quotes
More informationLes chiffres des nombres premiers. (Digits of prime numbers)
Les chiffres des nombres premiers (Digits of prime numbers) Joël RIVAT Institut de Mathématiques de Marseille, UMR 7373, Université d Aix-Marseille, France. joel.rivat@univ-amu.fr soutenu par le projet
More informationOn Carmichael numbers in arithmetic progressions
On Carmichael numbers in arithmetic progressions William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bbanks@math.missouri.edu Carl Pomerance Department of Mathematics
More informationPermutations with Inversions
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 4 2001, Article 01.2.4 Permutations with Inversions Barbara H. Margolius Cleveland State University Cleveland, Ohio 44115 Email address: b.margolius@csuohio.edu
More informationTuring and the Riemann zeta function
Turing and the Riemann zeta function Andrew Odlyzko School of Mathematics University of Minnesota odlyzko@umn.edu http://www.dtc.umn.edu/ odlyzko May 11, 2012 Andrew Odlyzko ( School of Mathematics University
More information