Content. CIMPA-ICTP Research School, Nesin Mathematics Village The Riemann zeta function Michel Waldschmidt

Size: px
Start display at page:

Download "Content. CIMPA-ICTP Research School, Nesin Mathematics Village The Riemann zeta function Michel Waldschmidt"

Transcription

1 Artin L functions, Artin primitive roots Conjecture and applications CIMPA-ICTP Research School, Nesin Mathematics Village 7 The Riemann zeta function Michel Waldschmidt Université Pierre et Marie Curie (Paris 6) Institut de Mathématiques de Jussieu /74 Content The ring of arithmetic functions. Dirichlet series. Distribution of prime numbers : elementary results. Abel s Partial Summation Formula PSF. Abscissa of convergence. Euler Product. Analytic continuation of the Riemann zeta function (I). The Prime Number Theorem. Analytic continuation of the Riemann zeta function (II). Special values of the Riemann zeta function. Functional Equation. Riemann memoir. Explicit formulae. Hadamard product Expansion. The Riemann Hypothesis. Diophantine problems /74 The fundamental Theorem of arithmetic n = Y p p vp(n)!(n) =, (n) = v p (n). p n p n Divisor function (n) = (n) =d(n) =. d n Arithmetic functions f : N! C Multiplicative function : f (ab) =f (a)f (b) if gcd(a, b) =. Example : for k C, k(n) = P d n d k. Completely multiplicative function : f (ab) =f (a)f (b) for all a, b. Example : for k C, j k = p k : n 7! n k. A multiplicative function is characterised by its values at prime powers : f (n) = Y f (p vp(n) ). p A completely multiplicative function is characterised by its values at prime numbers : f (n) = Y p f (p) vp(n). 3/74 4/74

2 Dirichlet series Product of Dirichlet series D(f, s) = n f (n)n s. Main example : Euler (736), Riemann (859) (s) = n n s Convolution : D(f, s)d(g, s) =D(f? g, s). f? g(n) = ab=n f (a)g(b). Euler : () = /6, (4) = 4 /9, (n) n Q (n ), () = /, ( ) = /, ( n) =(n ), ( n ) Q (n ). 5/74 6/74 The ring A of arithmetic functions The ring of arithmetic functions is a commutative factorial ring A, the unity of which is the Kronecker delta function with ( for n =, (n) = for n >. The units are the arithmetic functions f such that f () 6=. Exercise: check that the inverse g of a unit f is defined recursively by g() = f (), g(n) = f () f (n/d)g(d) (n > ). d n,d<n Examples of arithmetic functions The constant function = j : n 7!. The Kronecker delta function. The Möbius function : µ. Euler totient function : '. The function j : j(n) =n for all n. The characteristic function of the squares : apple. The lambda function : =( ). The von Mangoldt function : ( log p if n = p m with p prime and m, (n) = if n is not a prime power. Iwaniec Chap. I 7/74 8/74

3 Exercises Examples of Dirichlet series D(f, s) = n f (n)n s. µ? =, µ? j = ', µ?apple=, µ?apple=, µ? =!, j k? = k,? =, µ? log =. Möbius inversion formula : g =? f () f = µ? g. 9/74 D(, s) = D(, s) = (s) D(j k, s) = (s k) D(apple, s) = (s) D(µ, s) = (s) D(, s) = (s) D( k, s) = (s k) (s) (s ) D(', s) = D( µ, s) = (s) (s) (s) D(, s) = (s) (s) D(!, s) = (s) (s) D(log, s) = (s) D(, s) = (s) (s) More exercises : Patterson p. exercise.3 / 74 The Prime Number Theorem. For x > let (x) be the number of prime numbers apple x : (x) = papplex. Distribution of prime numbers : elementary results. (x) = log p, (x) = log p = (n) papplex p m applex napplex () = 4, () = 5, () = 68, ( ) = 9. Conjecture of Gauss (79) and Adrien-Marie Legendre (798), proved by Hadamard and de la Vallée Poussin (896) : PNT. Forx!, (x) x log x This is equivalent to p n n log n. Better approximation of (x) : integral logarithm Li(x) = Z x dt log t M(x) = napplex µ(n). Theorem (elementary PNT) (P.L. Tchebyshev) : 86 s cf. course of Francesco Pappalardi (x) x, (x) x, (x) x for x!. log x The Prime Number Theorem (x) x/ log x is equivalent (x) x and to (x) x and to M(x) =o(x) as x!. / 74 / 74

4 Elementary results on prime numbers. For n, For n and p prime, n apple v p (n!) = m n apple 4 n. n n. p m Elementary results (continued) For apple y < x, (x) (y) apple log y ( (x) (y)). For n, Consequence : (n) (n) apple 4logn. (x) apple C x, (x) C x log x (x) log x apple (x) apple (x) log x +loglogx + x (log x) Hindry p / 74 4 / 74 Exercises von Mangoldt function Deduce and papplex p papplex log p p =logx + O() =loglogx + C + O(/ log x) where (n) = (s) (s) = (n) n s n ( log p if n = p m with p prime and m, if n is not a prime power. 5 / 74 6 / 74

5 Exercise Check lim (s) s! where is Euler constant : = s = lim N! N log N. Abel summation. n A =, A n = a m, a n = A n A n (n ) m= N N a n b n = A n (b n b n+ )+A N b N. n= n= Hint: Z N N =+ ([t] t) dt t (telescopic sum) 7 / 74 8 / 74 Abel s Partial Summation Formula PSF. Let a n be a sequence of complex numbers and A(x) = P napplex a n. Let f be a function of class C. Then y<napplex a n f (n) =A(x)f (x) Z x y A(t)f (t)dt. Hindry p. 9 3 Abel summation : an example. Take a n =for all n, so that A(t) =btc. Then N n=m+ f (n) = Take f (t) =/t. Then where N n= Z N M is Euler constant = Z f (t)dt + n =logn + Z N M (t btc)f (t)dt + O(/N) {t} dt t where {t} = t btc. 9 / 74 / 74

6 Abel summation for. Take a n = n s for all n ; assume Re(s) >. An approximation of the series is Z n n s t s dt = s It is a fact that (s ) (s)! as s! +. We will see that if we remove this singularity of at s =, the di erence (s) s becomes an entire function (analytic in C). Analytic continuation of (s) to Re(s) > ( s ) (s) = s s +3 s 4 s + +(n ) s (n) s + log( u) = u + 3 u u = log. 4 lim ( s ) (s) = log s! + lim (s ) (s) = s! + u n n / 74 P Hardy and Wright : lim s! ann s = P a nn if the series in RHS converges. / 74 Analytic continuation of (s) (continued) The function (s) /(s ) extends to an analytic function in Re(s) >. n s = s (s) =s n (s) =s Z t s n Z t s Z n Z s dt, t s dt + s dt = s Z t =[t]. n= Z t s dt = s +. [t]t s dt ([t] t)t s dt. Abscissa of convergence Let f (s) = P n a nn s be a Dirichlet series converging at s. Then for any C it converges uniformly on the sector n o s C Re(s s ), s s apple CRe(s s ) A Dirichlet series f (s) = P n a nn s has an absissa of convergence R [ {, +}, such that the series converges for Re(s) > and diverges for Re(s) <. The sum of the series is analytic in the half plane Re(s) > and its derivatives are given by f (k) (s) = n a n ( log n) k n s. Hindry p. 39 Hindry p / 74 4 / 74

7 Absolute abscissa of convergence The absolute abscissa of convergence a is defined in the same way. One can prove apple a apple +. Infinite products Definition of the convergence of a product. Remark. If z n is any sequence of complex numbers and if one at least of the z n vanishes, then the sequence For the Riemann zeta function, = a =. For the Dirichlet series converges to. (z z z z n ) n we have =and a =. ( s ) (s) = n ( ) n n s, Riemann Hypothesis : the abscissa of convergence of the Dirichlet series D(µ, s) = (s) is /. 5 / 74 Remark. lim NY N! n= =. n + Hindry p / 74 Convergent infinite products Convergent infinite products Definitions. An infinite product Q n ( + u n) is convergent (resp. absolutely convergent) ifthereexistsn such that u n < for n n and the series P n n log( + u n ) is convergent (resp. absolutely convergent). An infinite product of functions Q n ( + u n(x)) is uniformly convergent on a compact K if there exists n such that u P n (z) < for n n and all z K and such that the series n n log( + u n (z)) is uniformly convergent on K. A product Q n ( + u n) is absolutely convergent if and only if the series P n u n is convergent A convergent infinite product is zero if and only if one of the factors is zero. If the series P n log( + u n(z)) is uniformly convergent on every compact subset of an open set U, then the infinite product Q n ( + u n(z)) is holomorphic on U. 7 / 74 8 / 74

8 Euler Product (s) 6= for Re(s) > The infinite product Q p ( p s ) is uniformly convergent on any compact included in the half plane Re(s) >. It defines an analytic function in this half plane and we have (s) = Y p p s For Re(s) = >, (s) Y papple = p s n6n ( ) n s apple n> n s = n> n For >, let N ( ) be the set of positive integers, the prime factors of which are apple. Then Y papple p s = Y papple m p ms = nn ( ) n s. Hindry p. 37 log( u) = m u m m p ms log( p s )= m m! (s) =exp. mp ms p m 9 / 74 3 / 74 log (s) for Re(s) > log (s) = p (s) (s) = p m m mp ms log p p ms Recall the von Mangoldt function ( log p if n = p m with p prime and m, (n) = if n is not a prime power. and the formula (s) (s) = (n) n s n Euler products for multiplicative functions Proposition : an arithmetic function f is multiplicative (resp. completely multiplicative) if and only if D(f, s) = Y! f (p )p s, p (resp. D(f, s) = Y p = = f (p)p s! = Y p f (p)p s ) Hindry p / 74 3 / 74

9 The Prime Number Theorem Theorem. The integral is convergent. Z ( (t) Corollary : (x) x as x!. t) dt t Hindry p. 48 Laplace Transform Let h(t) be a bounded piecewise continuous function. Then the integral F (s) = Z h(u)e su du is convergent and defines a holomorphic function on the half plane Re(s) >. If this function F can be analytically continued to a holomorphic function on an open set containing the closed half plane Re(s), the the integral converges for s =and F () = Z h(u)du. Hindry p / / 74 Consequence Take h(u) = (e u )e u F (s) = Z can be written as the sum of. Then the function h(u)e su du = (s +) (s +) (s +) Z s (t) t s+ t dt and a holomorphic function on Re(s) /. The key point in the proof of the PNT is the following result of Hadamard and de la Vallée Poussin Theorem. The function (s) has no zero on the line Re(s) =. No zero of (s) on the line Re(s) = Trigonometric formula : 4cosx + cos(x)+3=(+cosx). Consequence : ( + it) 4 ( +it) ( ) 3 for and t R. Hindry p / / 74

10 Euler Gamma function Euler Gamma function The integral (s) = Z e t t s defines an analytic function on the half plane Re(s) > which satisfies the functional equation dt (s) = apple s e s t s + s Z e t t s dt = s (s +). (s +)=s (s). The Gamma function can be analytically continued to a meromorphic function in the complex plane C with a simple pole at any integer apple. The residue at s = k (k ) is ( ) k /k!. (s) = (s + n +) s(s +) (s + n) Remark. From () = we deduce (n + ) = n! for n. 37 / / 74 (/) = p Hence (/) = Z 4 (/) = e t t / dt = = = Z Z e x Z Z / apple e r = 4 Z e x dx. y dxdy e r rdrd Euler Gamma function Exercises: s (s) ( s) = sin s s + = s (s) = lim n! n s n! s(s +) (s + n) (s) = se s Y n= + s e s/n. n (s). 39 / 74 4 / 74

11 Analytic continuation of (s) (continued) For Re(s) >, (s) = (s) Z e t e t = n e nt, dt ts t, Analytic continuation Lemma. Let f C (R > ) be a fast decreasing function at infinity. Then the function defined for Re(s) > by the integral L(f, s) = Z f (t)t s dt (s) t has an analytic continuation to C. Special values : Under the assumptions of the lemma, for n we have Z e nt t s dt t = (s) n s L(f, n) =( ) n f (n) (). Colmez p. 4 Colmez p. 4 4 / 74 4 / 74 Bernoulli numbers The function f (t) = t e t satisfies the hypotheses of the Lemma. Define (B n ) n by f (t) = n B n t n n! B =, B =, B = 6, B 4 = 3, B 6 = 4, B 3 = B 5 = B 7 = =. 43 / / 74

12 (s) as an integral (s) = (s) Z t s e t dt Values at negative integers The Riemann zeta function (s) has a meromorphic continuation to C which is analytic in C \{}, with a simple pole at s =with residue. For n apositiveinteger, Poles : For (s) : s =,,,... residue ( ) n /n! at s = n. Z t s For e t dt : s =,,,,... residue B n+/(n +)! at s = n. Hence the poles cancel except for s =. ( n) =( ) n B n+ n + In particular ( n) Q for n and ( n) =for n. () =, ( ) =, ( 3) =, ( 5) =, ( 7) = / / 74 Values at positive even integers Theorem. Let n be a positive integer. Then (n) = B (i ) n n (n)! In particular (n)/ n is a rational number. Examples : () = /6 (The Basel problem). (4) = 4 /9, (6) = 6 /945, (8) = 8 /945. The Basel problem, first posed by Pietro Mengoli in 644, was solved by Leonhard Euler in 735, when he was 8 only. 47 / 74 Proof of () = /6, followingeuler The sum of the inverses of the roots of a polynomial f with f () = is f () : for +a z + a z + + a n z n =( z) ( n z) we have + + n = a. Write sin x x = x 3! + x 4 5! Set z = x. The zeroes of the function sin p z z p = z 3! + z 5! x 6 7! + z 3 7! + are, 4, 9,...hence the sum of the inverses of these numbers is n = 6 n 48 / 74

13 Remark Completing Euler s proof Let C. The functions f (z) =+a z + a z + sin x x = Y n x. n and e z f (z) =+(a + )z + sin x x = x 6 + =) n n = 6 have the same zeroes, say / i. The sum P i i cannot be at the same time a and a. problem Evaluating (). Fourteen proofs compiled by Robin Chapman. 49 / 74 5 / 74 Another proof (Calabi) Another proof (Calabi) x y = n x n y n. P. Cartier. Fonctions polylogarithmes, nombres polyzêtas et groupes pro-unipotents. Sém. Bourbaki no. 885 Astérisque 8 (), Z Z Z x n dx = n + dxdy x y = n (n +) Z Z dxdy x y = x = sin u cos v, Z y = sin v cos u, appleuapple /, applevapple /, u+vapple / dudv = 8 5 / 74 5 / 74

14 Completing Calabi s proof of () = /6 From one deduces n (n +) = 8 n = (n) + n n n n () = n (n) = 4 n n (n +) n = 4 3 (n +) = 6 n The function cotg( z) Proposition : for z C \ Z, cotg z = z + n= n= z + n +. z n z z n = (n)z n. n= cotg z = i ei z + i = i + e i z e i z = i + z n= (i z) n B n n! Colmez p / / 74 Functional equation An entire function (analytic in C) isdefinedby (s) =s(s ) s/ (s/) (s). () = () =. Non trivial zeroes Denote by Z the multiset of zeroes (counting multiplicities) of (s) in the critical strip < Re(s) < and by Z + the multiset of zeroes (counting multiplicities) of (s) in the critical strip < Re(s) < with positive imaginary part. Then Z + = Z [ { Z}. Theorem (Riemann) : (s) = ( s). Iwaniec Chap / / 74

15 Hadamard product expansion Explicit formula : s( s) s/ (s/) (s) = e Bs Y Z s e s/ Explicit formula for the logarithmic derivative with B = Z ( ) = + log(4 ) = (s) (s) = log (s/) (s/) s s + Z s We can write e Y Bs Z s e s/ = Y Z + s s. Patterson p.33-34, Iwaniec Chap / / 74 Poisson formula For f L (R) let ˆf be its Fourier transform : bf (y) = Z + f (x)e i xy dx. Assume that the function x 7! P nz f (x + n) is continuous with bounded variation on [, ] ; then f (n) = f b (m). mz nz Recall van der Corput Formula (first course by Francesco Pappalardi). Poisson formula Corollary. The theta series (u) = nz e un satisfies the functional equation, for u > : For Re(s) >, (/u) = p u (u). Z (s) =s(s ) ( (u) )u s/ du. u Colmez p / 74 6 / 74

16 The Riemann Memoir (859). On the number of primes less than a given magnitude (9p.) I The P function (s) defined by the Dirichlet series n n s has an analytic continuation to the whole complex plane where it is holomorphic except a simple pole at s =with residue. I The following functional equation holds s s/ (s/) (s) = (s )/ ( s). The Riemann Memoir (859) (continued). I The following product formula holds s(s ) s/ (s/) (s) = Y I The following prime number formula holds [ (x) = napplex [ (n) =x x log( ) s log x. I The Riemann zeta function (s) has simple zeroes at s =, 4,, 6,... which are called the trivial zeroes, and infinitely many non-trivial zeroes in the critical strip of the form = + i with apple apple and R. 6 / 74 I The Riemann Hypothesis. Every non-trivial zero of (s) is on the critical line Re(s) =/ : = + i. Iwaniec Chap. 5 6 / 74 The Riemann Hypothesis. The complex zeroes of the Riemann zeta function (s) in the critical strip < Re(s) < lie on the critical line Re(s) =/ : s C, < Re(s) < and (s) = =) Re(s) =/. Equivalent statement: as x!. Asymptotic expansion : Li(x) ' x log x (x) =Li(x)+O(x / log x) n n! (log x) n ' x log x + Riemann hypothesis for the Möbius function : M(x) =O(x /+ ) x (log x) + 63 / 74 Notes by Riemann Non trivial zeroes : = = = = / 74

17 Non trivial zeroes of (s) The asymptotic formula for N(T ) Hardy (94) : infinitely many non-trivial zeroes of (s) are on the critical line. Norman Levinson (974) : (s) are on the critical line. /3 of the non-trivial zeroes of Brian Conrey (989) improved this further to two-fifths (precisely 4.77 %) are real. The present record seems to belong to S. Feng, who proved that at least 4.8% of the zeroes of the Riemann zeta function (s) are on the critical line. Let N(T ) be the number of zeroes = + i of (s) in the rectangle < <, < apple T. Then for T. N(T )= T log T e + O(log T ) Iwaniec Chap / / 74 Zero free region for (s) De la Vallée Poussin (896) : > for an absolute constant c >. c log( + t ) (x) =x + O x exp( c p log x). Korobov and Vinogradov (957) > c(log t) /3, t (x) =x + O exp( c(log x) 3/5 (log log x) /5 ), x 3 Diophantine problem Conjecture. The numbers are algebraically independent. Apéry (978) : (3) 6 Q, (3), (5),..., (n +),... Rivoal () : infinitely many (n + )are irrational ; the numbers (n +)span a Q vector space of infinite dimension. Zudilin (4) : At least one of the 4 numbers (5), (7), (9), () is irrational. Iwaniec Chap. 67 / / 74

18 Multizeta values (MZV) (s) is a period For s integer, Z (s) = >t >t >t s> dt dt s dt s t t s t s Euler (s,...,s k )= n >n > >n k for s,...,s k positive integers with s. n s ns k k Induction Z t >t >t s> dt t dt s t s dt s t s = n t n n s 69 / 74 7 / 74 MZV are periods Proof. We have Z t Z (, ) = dt 3 t 3 = n >t >t >t 3 > t n n, and Z hence Z >t >t >t 3 > dt t dt t next dt t dt t Z t t m dt = m, dt 3 = t 3 dt 3 t 3 t n dt t = t m m, m>n m>n m n = (, ) Linear relations among MZV As a consequence, multiple zeta values satisfy a lot of independent linear relations with integer coe cients. Example Product of series : Product of integrals : Hence () = (, ) + (4) () = (, ) + 4 (3, ) (4) = 4 (3, ). 7 / 74 7 / 74

19 Conjecture Rohrlich Lang Any algebraic dependence relation among the numbers ( ) / (a) with a Q lies in the ideal generated by the standard relations : () Translation : (a +)=a (a), () Reflexion : (a) ( a) = sin( a). (3) Multiplication : for any positive integer n, we have ny a + k =( ) (n )/ n na+(/) (na). n k= (Universal odd distribution). 73 / 74 Artin L functions, Artin primitive roots Conjecture and applications CIMPA-ICTP Research School, Nesin Mathematics Village 7 The Riemann zeta function Michel Waldschmidt Université Pierre et Marie Curie (Paris 6) Institut de Mathématiques de Jussieu 74 / 74

Riemann s Zeta Function and the Prime Number Theorem

Riemann 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 information

Chapter 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 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 information

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

ζ (s) = s 1 s {u} [u] ζ (s) = s 0 u 1+sdu, {u} Note how the integral runs from 0 and not 1. Problem Sheet 3. From Theorem 3. we have ζ (s) = + s s {u} u+sdu, (45) valid for Res > 0. i) Deduce that for Res >. [u] ζ (s) = s u +sdu ote the integral contains [u] in place of {u}. ii) Deduce that for

More information

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.

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. 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 information

The Riemann Hypothesis

The 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 information

Chapter 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 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 information

Notes on the Riemann Zeta Function

Notes 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 information

1 Euler s idea: revisiting the infinitude of primes

1 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 information

Mathematics 324 Riemann Zeta Function August 5, 2005

Mathematics 324 Riemann Zeta Function August 5, 2005 Mathematics 324 Riemann Zeta Function August 5, 25 In this note we give an introduction to the Riemann zeta function, which connects the ideas of real analysis with the arithmetic of the integers. Define

More information

Abstract. Roma Tre April 18 20, th Mini Symposium of the Roman Number Theory Association (RNTA) Michel Waldschmidt

Abstract. Roma Tre April 18 20, th Mini Symposium of the Roman Number Theory Association (RNTA) Michel Waldschmidt Roma Tre April 8 0, 08 4th Mini Symposium of the Roman umber Theory Association (RTA) Representation of integers by cyclotomic binary forms Michel Waldschmidt Institut de Mathématiques de Jussieu Paris

More information

MATH3500 The 6th Millennium Prize Problem. The 6th Millennium Prize Problem

MATH3500 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 information

The Prime Number Theorem

The 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 information

The Prime Number Theorem

The 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 information

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

First, let me recall the formula I want to prove. Again, ψ is the function. ψ(x) = n<x 8.785: Analytic Number heory, MI, spring 007 (K.S. Kedlaya) von Mangoldt s formula In this unit, we derive von Mangoldt s formula estimating ψ(x) x in terms of the critical zeroes of the Riemann zeta function.

More information

TOPICS IN NUMBER THEORY - EXERCISE SHEET I. École Polytechnique Fédérale de Lausanne

TOPICS IN NUMBER THEORY - EXERCISE SHEET I. École Polytechnique Fédérale de Lausanne TOPICS IN NUMBER THEORY - EXERCISE SHEET I École Polytechnique Fédérale de Lausanne Exercise Non-vanishing of Dirichlet L-functions on the line Rs) = ) Let q and let χ be a Dirichlet character modulo q.

More information

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

18.785: Analytic Number Theory, MIT, spring 2006 (K.S. Kedlaya) Dirichlet series and arithmetic functions 18.785: Analytic Number Theory, MIT, spring 2006 (K.S. Kedlaya) Dirichlet series and arithmetic functions 1 Dirichlet series The Riemann zeta function ζ is a special example of a type of series we will

More information

GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT

GAPS 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 information

Riemann Zeta Function and Prime Number Distribution

Riemann 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 information

Analytic Number Theory

Analytic Number Theory American Mathematical Society Colloquium Publications Volume 53 Analytic Number Theory Henryk Iwaniec Emmanuel Kowalski American Mathematical Society Providence, Rhode Island Contents Preface xi Introduction

More information

Part II. Number Theory. Year

Part 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 information

NOTES ON RIEMANN S ZETA FUNCTION. Γ(z) = t z 1 e t dt

NOTES ON RIEMANN S ZETA FUNCTION. Γ(z) = t z 1 e t dt NOTES ON RIEMANN S ZETA FUNCTION DRAGAN MILIČIĆ. Gamma function.. Definition of the Gamma function. The integral Γz = t z e t dt is well-defined and defines a holomorphic function in the right half-plane

More information

Math 259: Introduction to Analytic Number Theory More about the Gamma function

Math 259: Introduction to Analytic Number Theory More about the Gamma function Math 59: Introduction to Analytic Number Theory More about the Gamma function We collect some more facts about Γs as a function of a complex variable that will figure in our treatment of ζs and Ls, χ.

More information

Introduction to Number Theory

Introduction to Number Theory INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,

More information

Irrationality exponent and rational approximations with prescribed growth

Irrationality exponent and rational approximations with prescribed growth Irrationality exponent and rational approximations with prescribed growth Stéphane Fischler and Tanguy Rivoal June 0, 2009 Introduction In 978, Apéry [2] proved the irrationality of ζ(3) by constructing

More information

Arithmetic Statistics Lecture 1

Arithmetic 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 information

Gauss and Riemann versus elementary mathematics

Gauss 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 information

Primes in arithmetic progressions

Primes in arithmetic progressions (September 26, 205) Primes in arithmetic progressions Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/mfms/notes 205-6/06 Dirichlet.pdf].

More information

Riemann s ζ-function

Riemann 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 information

Evidence for the Riemann Hypothesis

Evidence for the Riemann Hypothesis 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

More information

Chapter 2 Lambert Summability and the Prime Number Theorem

Chapter 2 Lambert Summability and the Prime Number Theorem Chapter 2 Lambert Summability and the Prime Number Theorem 2. Introduction The prime number theorem (PNT) was stated as conjecture by German mathematician Carl Friedrich Gauss (777 855) in the year 792

More information

Primes, queues and random matrices

Primes, 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 information

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

Number Theory and Algebraic Equations. Odile Marie-Thérèse Pons Number Theory and Algebraic Equations Odile Marie-Thérèse Pons Published by Science Publishing Group 548 Fashion Avenue New York, NY 10018, U.S.A. http://www.sciencepublishinggroup.com ISBN: 978-1-940366-74-6

More information

The Riemann and Hurwitz zeta functions, Apery s constant and new rational series representations involving ζ(2k)

The Riemann and Hurwitz zeta functions, Apery s constant and new rational series representations involving ζ(2k) The Riemann and Hurwitz zeta functions, Apery s constant and new rational series representations involving ζ(k) Cezar Lupu 1 1 Department of Mathematics University of Pittsburgh Pittsburgh, PA, USA Algebra,

More information

Math 229: Introduction to Analytic Number Theory The product formula for ξ(s) and ζ(s); vertical distribution of zeros

Math 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 information

A Simple Counterexample to Havil s Reformulation of the Riemann Hypothesis

A 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 information

Smol Results on the Möbius Function

Smol Results on the Möbius Function Karen Ge August 3, 207 Introduction We will address how Möbius function relates to other arithmetic functions, multiplicative number theory, the primitive complex roots of unity, and the Riemann zeta function.

More information

Convergence of Some Divergent Series!

Convergence of Some Divergent Series! Convergence of Some Divergent Series! T. Muthukumar tmk@iitk.ac.in 9 Jun 04 The topic of this article, the idea of attaching a finite value to divergent series, is no longer a purely mathematical exercise.

More information

Math 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 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 information

One of the Eight Numbers ζ(5),ζ(7),...,ζ(17),ζ(19) Is Irrational

One of the Eight Numbers ζ(5),ζ(7),...,ζ(17),ζ(19) Is Irrational Mathematical Notes, vol. 70, no. 3, 2001, pp. 426 431. Translated from Matematicheskie Zametki, vol. 70, no. 3, 2001, pp. 472 476. Original Russian Text Copyright c 2001 by V. V. Zudilin. One of the Eight

More information

VII.8. The Riemann Zeta Function.

VII.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 information

Dirichlet s Theorem. Calvin Lin Zhiwei. August 18, 2007

Dirichlet s Theorem. Calvin Lin Zhiwei. August 18, 2007 Dirichlet s Theorem Calvin Lin Zhiwei August 8, 2007 Abstract This paper provides a proof of Dirichlet s theorem, which states that when (m, a) =, there are infinitely many primes uch that p a (mod m).

More information

Dirichlet s Theorem. Martin Orr. August 21, The aim of this article is to prove Dirichlet s theorem on primes in arithmetic progressions:

Dirichlet s Theorem. Martin Orr. August 21, The aim of this article is to prove Dirichlet s theorem on primes in arithmetic progressions: Dirichlet s Theorem Martin Orr August 1, 009 1 Introduction The aim of this article is to prove Dirichlet s theorem on primes in arithmetic progressions: Theorem 1.1. If m, a N are coprime, then there

More information

150 Years of Riemann Hypothesis.

150 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 information

arxiv: v2 [math.nt] 28 Feb 2010

arxiv: 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 information

Math 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 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 information

Prime Numbers and Irrational Numbers

Prime Numbers and Irrational Numbers Chapter 4 Prime Numbers and Irrational Numbers Abstract The question of the existence of prime numbers in intervals is treated using the approximation of cardinal of the primes π(x) given by Lagrange.

More information

Why is the Riemann Hypothesis Important?

Why 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 information

Prime Number Theory and the Riemann Zeta-Function

Prime 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 information

1 The functional equation for ζ

1 The functional equation for ζ 18.785: Analytic Number Theory, MIT, spring 27 (K.S. Kedlaya) The functional equation for the Riemann zeta function In this unit, we establish the functional equation property for the Riemann zeta function,

More information

1 Review of di erential calculus

1 Review of di erential calculus Review of di erential calculus This chapter presents the main elements of di erential calculus needed in probability theory. Often, students taking a course on probability theory have problems with concepts

More information

COMPLEX ANALYSIS in NUMBER THEORY

COMPLEX ANALYSIS in NUMBER THEORY COMPLEX ANALYSIS in NUMBER THEORY Anatoly A. Karatsuba Steklov Mathematical Institute Russian Academy of Sciences Moscow, Russia CRC Press Boca Raton Ann Arbor London Tokyo Introduction 1 Chapter 1. The

More information

Riemann s Zeta Function

Riemann s Zeta Function Riemann s Zeta Function Lectures by Adam Harper Notes by Tony Feng Lent 204 Preface This document grew out of lecture notes for a course taught in Cambridge during Lent 204 by Adam Harper on the theory

More information

Les chiffres des nombres premiers. (Digits of prime numbers)

Les 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 information

Evaluating ζ(2m) via Telescoping Sums.

Evaluating ζ(2m) via Telescoping Sums. /25 Evaluating ζ(2m) via Telescoping Sums. Brian Sittinger CSU Channel Islands February 205 2/25 Outline 2 3 4 5 3/25 Basel Problem Find the exact value of n= n 2 = 2 + 2 2 + 3 2 +. 3/25 Basel Problem

More information

E.J. Barbeau. Polynomials. With 36 Illustrations. Springer

E.J. Barbeau. Polynomials. With 36 Illustrations. Springer E.J. Barbeau Polynomials With 36 Illustrations Springer Contents Preface Acknowledgment of Problem Sources vii xiii 1 Fundamentals 1 /l.l The Anatomy of a Polynomial of a Single Variable 1 1.1.5 Multiplication

More information

PRIME NUMBERS YANKI LEKILI

PRIME NUMBERS YANKI LEKILI PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume

More information

Primes in arithmetic progressions to large moduli

Primes in arithmetic progressions to large moduli CHAPTER 3 Primes in arithmetic progressions to large moduli In this section we prove the celebrated theorem of Bombieri and Vinogradov Theorem 3. (Bombieri-Vinogradov). For any A, thereeistsb = B(A) such

More information

The Continuing Story of Zeta

The 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 information

#A61 INTEGERS 14 (2014) SHORT EFFECTIVE INTERVALS CONTAINING PRIMES

#A61 INTEGERS 14 (2014) SHORT EFFECTIVE INTERVALS CONTAINING PRIMES #A6 INTEGERS 4 (24) SHORT EFFECTIVE INTERVALS CONTAINING PRIMES Habiba Kadiri Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Canada habiba.kadiri@uleth.ca Allysa

More information

Math 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 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 information

Polyexponentials. Khristo N. Boyadzhiev Ohio Northern University Departnment of Mathematics Ada, OH

Polyexponentials. Khristo N. Boyadzhiev Ohio Northern University Departnment of Mathematics Ada, OH Polyexponentials Khristo N. Boyadzhiev Ohio Northern University Departnment of Mathematics Ada, OH 45810 k-boyadzhiev@onu.edu 1. Introduction. The polylogarithmic function [15] (1.1) and the more general

More information

Riemann s explicit formula

Riemann 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 information

Analytic Aspects of the Riemann Zeta and Multiple Zeta Values

Analytic Aspects of the Riemann Zeta and Multiple Zeta Values Analytic Aspects of the Riemann Zeta and Multiple Zeta Values Cezar Lupu Department of Mathematics University of Pittsburgh Pittsburgh, PA, USA PhD Thesis Overview, October 26th, 207, Pittsburgh, PA Outline

More information

arxiv: v22 [math.gm] 20 Sep 2018

arxiv: 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 information

Some Fun with Divergent Series

Some Fun with Divergent Series Some Fun with Divergent Series 1. Preliminary Results We begin by examining the (divergent) infinite series S 1 = 1 + 2 + 3 + 4 + 5 + 6 + = k=1 k S 2 = 1 2 + 2 2 + 3 2 + 4 2 + 5 2 + 6 2 + = k=1 k 2 (i)

More information

x s 1 e x dx, for σ > 1. If we replace x by nx in the integral then we obtain x s 1 e nx dx. x s 1

x s 1 e x dx, for σ > 1. If we replace x by nx in the integral then we obtain x s 1 e nx dx. x s 1 Recall 9. The Riemann Zeta function II Γ(s) = x s e x dx, for σ >. If we replace x by nx in the integral then we obtain Now sum over n to get n s Γ(s) = x s e nx dx. x s ζ(s)γ(s) = e x dx. Note that as

More information

Analytic number theory for probabilists

Analytic number theory for probabilists Analytic number theory for probabilists E. Kowalski ETH Zürich 27 October 2008 Je crois que je l ai su tout de suite : je partirais sur le Zéta, ce serait mon navire Argo, celui qui me conduirait à la

More information

God may not play dice with the universe, but something strange is going on with the prime numbers.

God may not play dice with the universe, but something strange is going on with the prime numbers. Primes: Definitions God may not play dice with the universe, but something strange is going on with the prime numbers. P. Erdös (attributed by Carl Pomerance) Def: A prime integer is a number whose only

More information

17 The functional equation

17 The functional equation 18.785 Number theory I Fall 16 Lecture #17 11/8/16 17 The functional equation In the previous lecture we proved that the iemann zeta function ζ(s) has an Euler product and an analytic continuation to the

More information

A REMARK ON THE BOROS-MOLL SEQUENCE

A REMARK ON THE BOROS-MOLL SEQUENCE #A49 INTEGERS 11 (2011) A REMARK ON THE BOROS-MOLL SEQUENCE J.-P. Allouche CNRS, Institut de Math., Équipe Combinatoire et Optimisation Université Pierre et Marie Curie, Paris, France allouche@math.jussieu.fr

More information

On the low-lying zeros of elliptic curve L-functions

On the low-lying zeros of elliptic curve L-functions On the low-lying zeros of elliptic curve L-functions Joint Work with Stephan Baier Liangyi Zhao Nanyang Technological University Singapore The zeros of the Riemann zeta function The number of zeros ρ of

More information

MOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS

MOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS MOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS ABDUL HASSEN AND HIEU D. NGUYEN Abstract. This paper investigates a generalization the classical Hurwitz zeta function. It is shown that many of the properties

More information

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

1, for s = σ + it where σ, t R and σ > 1 DIRICHLET L-FUNCTIONS AND DEDEKIND ζ-functions FRIMPONG A. BAIDOO Abstract. We begin by introducing Dirichlet L-functions which we use to prove Dirichlet s theorem on arithmetic progressions. From there,

More information

Math 314 Course Notes: Brief description

Math 314 Course Notes: Brief description Brief description These are notes for Math 34, an introductory course in elementary number theory Students are advised to go through all sections in detail and attempt all problems These notes will be

More information

Department of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014

Department of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014 Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014 1. Please write your 1- or 2-digit exam number on

More information

FRACTIONAL HYPERGEOMETRIC ZETA FUNCTIONS

FRACTIONAL 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 information

ELEMENTARY PROOF OF DIRICHLET THEOREM

ELEMENTARY PROOF OF DIRICHLET THEOREM ELEMENTARY PROOF OF DIRICHLET THEOREM ZIJIAN WANG Abstract. In this expository paper, we present the Dirichlet Theorem on primes in arithmetic progressions along with an elementary proof. We first show

More information

Lecture 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 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 information

On combinatorial zeta functions

On combinatorial zeta functions On combinatorial zeta functions Christian Kassel Institut de Recherche Mathématique Avancée CNRS - Université de Strasbourg Strasbourg, France Colloquium Potsdam 13 May 2015 Generating functions To a sequence

More information

Summary Slides for MATH 342 June 25, 2018

Summary Slides for MATH 342 June 25, 2018 Summary Slides for MATH 342 June 25, 2018 Summary slides based on Elementary Number Theory and its applications by Kenneth Rosen and The Theory of Numbers by Ivan Niven, Herbert Zuckerman, and Hugh Montgomery.

More information

A 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) 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 information

PRIME NUMBER THEOREM

PRIME NUMBER THEOREM PRIME NUMBER THEOREM RYAN LIU Abstract. Prime numbers have always been seen as the building blocks of all integers, but their behavior and distribution are often puzzling. The prime number theorem gives

More information

THE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS. Bernd C. Kellner Göppert Weg 5, Göttingen, Germany

THE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS. Bernd C. Kellner Göppert Weg 5, Göttingen, Germany #A95 INTEGERS 18 (2018) THE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS Bernd C. Kellner Göppert Weg 5, 37077 Göttingen, Germany b@bernoulli.org Jonathan Sondow 209 West 97th Street, New Yor,

More information

We denote the space of distributions on Ω by D ( Ω) 2.

We denote the space of distributions on Ω by D ( Ω) 2. Sep. 1 0, 008 Distributions Distributions are generalized functions. Some familiarity with the theory of distributions helps understanding of various function spaces which play important roles in the study

More information

Generating Functions

Generating Functions Semester 1, 2004 Generating functions Another means of organising enumeration. Two examples we have seen already. Example 1. Binomial coefficients. Let X = {1, 2,..., n} c k = # k-element subsets of X

More information

Harmonic sets and the harmonic prime number theorem

Harmonic 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 information

THE PENNSYLVANIA STATE UNIVERSITY SCHREYER HONORS COLLEGE DEPARTMENT OF MATHEMATICS BERNOULLI POLYNOMIALS AND RIEMANN ZETA FUNCTION

THE PENNSYLVANIA STATE UNIVERSITY SCHREYER HONORS COLLEGE DEPARTMENT OF MATHEMATICS BERNOULLI POLYNOMIALS AND RIEMANN ZETA FUNCTION THE PENNSYLVANIA STATE UNIVERSITY SCHREYER HONORS COLLEGE DEPARTMENT OF MATHEMATICS BERNOULLI POLYNOMIALS AND RIEMANN ZETA FUNCTION YIXUAN SHI SPRING 203 A thesis submitted in partial fulfillment of the

More information

1. If 1, ω, ω 2, -----, ω 9 are the 10 th roots of unity, then (1 + ω) (1 + ω 2 ) (1 + ω 9 ) is A) 1 B) 1 C) 10 D) 0

1. If 1, ω, ω 2, -----, ω 9 are the 10 th roots of unity, then (1 + ω) (1 + ω 2 ) (1 + ω 9 ) is A) 1 B) 1 C) 10 D) 0 4 INUTES. If, ω, ω, -----, ω 9 are the th roots of unity, then ( + ω) ( + ω ) ----- ( + ω 9 ) is B) D) 5. i If - i = a + ib, then a =, b = B) a =, b = a =, b = D) a =, b= 3. Find the integral values for

More information

An example of generalization of the Bernoulli numbers and polynomials to any dimension

An example of generalization of the Bernoulli numbers and polynomials to any dimension An example of generalization of the Bernoulli numbers and polynomials to any dimension Olivier Bouillot, Villebon-Georges Charpak institute, France C.A.L.I.N. team seminary. Tuesday, 29 th March 26. Introduction

More information

INTEGRATION WORKSHOP 2003 COMPLEX ANALYSIS EXERCISES

INTEGRATION WORKSHOP 2003 COMPLEX ANALYSIS EXERCISES INTEGRATION WORKSHOP 23 COMPLEX ANALYSIS EXERCISES DOUGLAS ULMER 1. Meromorphic functions on the Riemann sphere It s often useful to allow functions to take the value. This exercise outlines one way to

More information

Riemann 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 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 information

Power series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) a n z n. n=0

Power series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) a n z n. n=0 Lecture 22 Power series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) Recall a few facts about power series: a n z n This series in z is centered at z 0. Here z can

More information

Some Interesting Properties of the Riemann Zeta Function

Some Interesting Properties of the Riemann Zeta Function Some Interesting Properties of the Riemann Zeta Function arxiv:822574v [mathho] 2 Dec 28 Contents Johar M Ashfaque Introduction 2 The Euler Product Formula for ζ(s) 2 3 The Bernoulli Numbers 4 3 Relationship

More information

On The Weights of Binary Irreducible Cyclic Codes

On The Weights of Binary Irreducible Cyclic Codes On The Weights of Binary Irreducible Cyclic Codes Yves Aubry and Philippe Langevin Université du Sud Toulon-Var, Laboratoire GRIM F-83270 La Garde, France, {langevin,yaubry}@univ-tln.fr, WWW home page:

More information

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

rama.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 information

José Felipe Voloch. Abstract: We discuss the problem of constructing elements of multiplicative high

José Felipe Voloch. Abstract: We discuss the problem of constructing elements of multiplicative high On the order of points on curves over finite fields José Felipe Voloch Abstract: We discuss the problem of constructing elements of multiplicative high order in finite fields of large degree over their

More information

NORMAL NUMBERS AND UNIFORM DISTRIBUTION (WEEKS 1-3) OPEN PROBLEMS IN NUMBER THEORY SPRING 2018, TEL AVIV UNIVERSITY

NORMAL NUMBERS AND UNIFORM DISTRIBUTION (WEEKS 1-3) OPEN PROBLEMS IN NUMBER THEORY SPRING 2018, TEL AVIV UNIVERSITY ORMAL UMBERS AD UIFORM DISTRIBUTIO WEEKS -3 OPE PROBLEMS I UMBER THEORY SPRIG 28, TEL AVIV UIVERSITY Contents.. ormal numbers.2. Un-natural examples 2.3. ormality and uniform distribution 2.4. Weyl s criterion

More information

Math 141: Lecture 19

Math 141: Lecture 19 Math 141: Lecture 19 Convergence of infinite series Bob Hough November 16, 2016 Bob Hough Math 141: Lecture 19 November 16, 2016 1 / 44 Series of positive terms Recall that, given a sequence {a n } n=1,

More information

We start with a simple result from Fourier analysis. Given a function f : [0, 1] C, we define the Fourier coefficients of f by

We start with a simple result from Fourier analysis. Given a function f : [0, 1] C, we define the Fourier coefficients of f by Chapter 9 The functional equation for the Riemann zeta function We will eventually deduce a functional equation, relating ζ(s to ζ( s. There are various methods to derive this functional equation, see

More information

On the digits of prime numbers

On the digits of prime numbers On the digits of prime numbers Joël RIVAT Institut de Mathématiques de Luminy, Université d Aix-Marseille, France. rivat@iml.univ-mrs.fr work in collaboration with Christian MAUDUIT (Marseille) 1 p is

More information