Fourier Analysis, Stein and Shakarchi Chapter 8 Dirichlet s Theorem

Similar documents
The multiplicative structure of finite field and a construction of LRC

Math 4400/6400 Homework #7 solutions

(I.C) THE DISTRIBUTION OF PRIMES

Seunghee Ye Ma 8: Week 5 Oct 28

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

M17 MAT25-21 HOMEWORK 5 SOLUTIONS

MATH 6101 Fall Problems. Problems 11/9/2008. Series and a Famous Unsolved Problem (2-1)(2 + 1) ( 4) 12-Nov-2008 MATH

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n

and each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.

Homework 1 Solutions. The exercises are from Foundations of Mathematical Analysis by Richard Johnsonbaugh and W.E. Pfaffenberger.

MA541 : Real Analysis. Tutorial and Practice Problems - 1 Hints and Solutions

MATH 6101 Fall 2008 Series and a Famous Unsolved Problem

Dirichlet s Theorem on Arithmetic Progressions

The structure of finite rings. The multiplicative residues. Modular exponentiation. and finite exponentiation

Math 140A Elementary Analysis Homework Questions 1

Basic Sets. Functions. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4. (e) 2 S.

Different kinds of Mathematical Induction

Complex Analysis Spring 2001 Homework I Solution

Chapter 0. Review of set theory. 0.1 Sets

The Structure of Z p when p is Prime

Proposition 2.1. There are an infinite number of primes of the form p = 4n 1. Proof. Suppose there are only a finite number of such primes, say

Solutions to Math 347 Practice Problems for the final

1 Lecture 2: Sequence, Series and power series (8/14/2012)

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

Primes in Arithmetic Progressions

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

INFINITE SEQUENCES AND SERIES

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006

DIRICHLET S THEOREM ON ARITHMETIC PROGRESSIONS

MA131 - Analysis 1. Workbook 9 Series III

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Square-Congruence Modulo n

Sketch of Dirichlet s Theorem on Arithmetic Progressions

Sequences, Series, and All That

Some p-adic congruences for p q -Catalan numbers

Complex Numbers Solutions

Sequences. A Sequence is a list of numbers written in order.

Injections, Surjections, and the Pigeonhole Principle

Read carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book.

SOLVED EXAMPLES

Unit 6: Sequences and Series

11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

Ma 530 Introduction to Power Series

Cardinality Homework Solutions

d) If the sequence of partial sums converges to a limit L, we say that the series converges and its

DIRICHLET S THEOREM ON ARITHMETIC PROGRESSIONS

Trial division, Pollard s p 1, Pollard s ρ, and Fermat s method. Christopher Koch 1. April 8, 2014

THE AVERAGE ORDER OF ELEMENTS IN THE MULTIPLICATIVE GROUP OF A FINITE FIELD. α(n) = 1

The 4-Nicol Numbers Having Five Different Prime Divisors

The minimum value and the L 1 norm of the Dirichlet kernel

ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS

Limit superior and limit inferior c Prof. Philip Pennance 1 -Draft: April 17, 2017

Chapter 6 Infinite Series

Analytic Number Theory Solutions

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?

On a Smarandache problem concerning the prime gaps

THE ZETA FUNCTION AND THE RIEMANN HYPOTHESIS. Contents 1. History 1

Solutions to Problem Sheet 4

Chapter 1. Complex Numbers. Dr. Pulak Sahoo

MDIV. Multiple divisor functions

Chapter IV Integration Theory

Bertrand s Postulate

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.

Measure and Measurable Functions

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x]

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.

2.4.2 A Theorem About Absolutely Convergent Series

JANE PROFESSOR WW Prob Lib1 Summer 2000

Fermat s Little Theorem. mod 13 = 0, = }{{} mod 13 = 0. = a a a }{{} mod 13 = a 12 mod 13 = 1, mod 13 = a 13 mod 13 = a.

Analytic Continuation

6.3 Testing Series With Positive Terms

Section 11.8: Power Series

Math 155 (Lecture 3)

Ma 530 Infinite Series I

Math 299 Supplement: Real Analysis Nov 2013

Sequences. Notation. Convergence of a Sequence

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

Beurling Integers: Part 2

Infinite Sequences and Series

Chapter 2 Elementary Prime Number Theory for

Primality Test. Rong-Jaye Chen

Notes #3 Sequences Limit Theorems Monotone and Subsequences Bolzano-WeierstraßTheorem Limsup & Liminf of Sequences Cauchy Sequences and Completeness

M A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O

MATH 312 Midterm I(Spring 2015)

Axioms of Measure Theory

Solutions to Homework 1

2.1. The Algebraic and Order Properties of R Definition. A binary operation on a set F is a function B : F F! F.

TERMWISE DERIVATIVES OF COMPLEX FUNCTIONS

CS / MCS 401 Homework 3 grader solutions

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

Bertrand s Postulate. Theorem (Bertrand s Postulate): For every positive integer n, there is a prime p satisfying n < p 2n.

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS

SCORE. Exam 2. MA 114 Exam 2 Fall 2016

Created by T. Madas SERIES. Created by T. Madas

Arkansas Tech University MATH 2924: Calculus II Dr. Marcel B. Finan

REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS

Solutions to Tutorial 3 (Week 4)

Transcription:

Fourier Aalysis, Stei ad Shakarchi Chapter 8 Dirichlet s Theorem 208.05.05 Abstract Durig the course Aalysis II i NTU 208 Sprig, this solutio file is latexed by the teachig assistat Yug-Hsiag Huag with the discussios or help from the followig cotributors: Exercise 3-5 He-qig Huag; Exercise 7- Mighty Yeh; Exercise 0-???; Exercise -???; Exercise 2-???; Exercise 4-???; Exercise 5-???; Exercise 6-???; Problem -???; Problem 2-???; Problem 3-???; Problem 4-???; Exercises. Prove that there are ifiitely may primes by observig that there were oly fiitely may p,, p N,the N /p j = This is a simple cosequece of Theorem.6. 2. I the text we showed that there are ifiitely may primes of the form 4k+3 by a modificatio of Euclid s origial argumet. Oe ca easily adapt this techique to prove the similar result for primes of the form 3k + 2, ad for those of the form 6k + 5. E-mail: d042200@tu.edu.tw

3. Usig the same map as Problem of Chapter 7 oe ca prove that if m ad are relatively prime, the Z (m Z ( is isomorphic to Z (m. For surjectivity (say, give (a, b Z (m Z (, oe has to verify k = bmx + ay Z (m where mx + y = (comes from Corollary.3. This ca be verified as follows: suppose ot, say there is a prime p k ad p m, the p a sice p y ad hece cotradicts to the fact a Z (m. 4. Let ϕ( deote the umber of positive itegers that are relatively prime to. Use the order of groups i the previous exercise, oe kows that if ad m are relatively prime, the ϕ(m = ϕ(ϕ(m. Moreover, oe ca give a formula for Euler phi-fuctio as follows: (a Calculate ϕ(p whe p is a prime by coutig the umber of elemets i Z (p. (b Give a formula for ϕ(p k whe p is a prime ad k by coutig the umber of elemets i Z (p k. (c Show that ( p i ϕ( = i where p i are the primes that divide. (a ϕ(p = p if p is a prime. (b Claim: ϕ(p k = p k p k for k. This ca be proved as follows: if p s, the s Z (p k. O the other had, if p s, sice p is a prime, s Z (p k. So ϕ(p k = p k p k, the order of Z(p k mius the umber of multiples of p that less tha p k. (c By the multiplicative property of ϕ ad (b, ϕ( = ϕ(p a p a ( p p a k k ( p k = k i= ( pi. 5. If is a positive iteger, show that p a 2 2 p a k k = ϕ(pa ϕ(p a 2 2 ϕ(p a k k = = d ϕ(d, where ϕ is the Euler phi-fuctio. [Hit: There are precisely ϕ(/d itegers m with gcd(m, = d.] Note that { i } { j } : i = d d : j d, gcd(d, j = =: d A d 2

ad {A d } d are pairwisely disjoit. So oe completes the proof by computig the cardiality of sets i both sides. 6. Write dow the characters of the groups Z (3, Z (4, Z (5, Z (6, ad Z (8. (a Which oes are real, or complex? (b Which oes are eve,or odd? otherwise. (A character is eve if χ( =, ad odd Sice Z (3, Z (4, ad Z (6 are all = Z(2 = {0, }, their characters cotai the trivial oe ad the oe χ(0 =, χ( = oly, both are real ad eve. For Z (5 = Z(4 = {0,, 2, 3}. The characters are χ j (k = e 2πi j 4 k (j, k = 0,, 2, 3. So χ 0, χ 2 are real. χ, χ 3 are complex. Oly χ 0 is eve. For Z (8 = Z(2 Z(2 = {(0, 0, (, 0, (0,, (, }. Because of (, 0 + (, 0 = (0, 0, χ((, 0 = ± for each character χ. Same for (0, ad (,. So every character is real. Note that A + B = C for {A, B, C} = {(, 0, (0,, (, }, so appears twice or ever appears i the values that each character takes at {A, B, C}. Hece the eve character are the trivial oe ad the oe χ((, = χ((0, 0 = ad χ((, 0 = χ((0, = 7. Recall that for z <, ( log = z k z k. k We have see that e log ( z = z. (a Show that if w = /( z, the z < if ad oly if Re(w > /2. (b Show that if Re(w > /2 ad w = ρe iϕ with ρ > 0, ϕ < π, the log w = log ρ + iϕ. [Hit: If e ζ = w, the the real part of ζ is uiquely determied ad its imagiary part is determied modulo 2π.] Remark. (a is the Möbius trasformatio. (a ca be proved by brutal computatios ad Arithmetic-Geometric Meas iequality. (b As hit, e log ρ+iϕ = ρe iϕ = w = z for some z < from (a. The e log ρ+iϕ = z = elog ( z = e log w. 3

8. Let ζ deote the zeta fuctio defied for s >. (a Compare ζ(s with x s dx to show that (b Prove as a cosequece that p ζ(s = s + O( as s +. ( p = log + O( as s +. s s (a Use mea-value theorem, oe has ζ(s x = s = + s x dx = s (b is a cosequece of (a ad the fact log ζ(s = p = + s x dx s s. s+ = +O( proved i Propositio.. p s 9. Let χ 0 deote the trivial Dirichlet character mod q, ad p,, p k the distict prime divisors of q. Recall that L(s, χ 0 = ( p s ( p s ζ(s, ad show as a cosequece L(s, χ 0 = ϕ(q q + O( as s + s k Note that, by Exercise 8 ad mea-value theorem to f(s = k ( p s j, L(s, χ 0 = k [ k ( p s j ζ(s = ( p s = O(s ( s + O( + ϕ(q q j k ] ( p j ζ(s + ϕ(q q s + O(. ζ(s 0. Show that if l is relatively prime to q, the p l p = ( s ϕ(q log + O( as s +. s This is a quatitative versio of Dirichlet s Theorem. 4

. Use the characters for Z (3, Z (4, Z (5, ad Z (6 to verify directly that L(, χ 0 for all o-trivial Dirichlet characters modulo q whe q = 3, 4, 5, ad 6. [Hit: Cosider i each case the appropriate alteratig series.] 2. Suppose χ is real ad o-trivial; assumig the theorem that L(, χ 0, show directly that L(, χ > 0. [Hit: Use the product formula for L(s, χ.] 3. Let {a } = be a sequece of complex umbers such that a = a m if = m mod q. Show that the series coverges if ad oly if q = a = 0. [Hit: Summatio by parts.] = a Let A j = j k= a k with covetio that A 0 = 0. Recall that N = a = N = A ( + + A N N + The periodicity implies that ([x] is the floor fuctio of x. A N = A q [ N q ] + O(. So the secod term is always bouded. A q = 0. Moreover, the first term coverges if ad oly if 4. The series F (θ = =0 e iθ, for θ < π, coverges for every θ ad is the Fourier series of the fuctio defied o [ π, π] by F (0 = 0 ad i( π θ if π θ < 0 F (θ = i(π θ if 0 < θ π, ad exteded by periodicity (period 2π to all of R (see Exercise 8 i Chapter 2. 5

Show also that if θ 0 mod 2π, the the series E(θ = = e iθ coverges, ad that E(θ = ( 2 log + i 2 2 cos θ 2 F (θ 5. To sum the series = a / with a = a m if = m mod q ad q = a = 0, proceed as follows. (a Defie A(m = q a ζ m where ζ = e 2πi/q = Note that A(q = 0. With the otatio of the previous exercise, prove that = a = q [Hit: Use Fourier iversio o Z(q.] q m= A(mE(2πm/q. (b If {a m } is odd, (a m = a m for m Z, observe that a 0 = a q = 0 ad show that A(m = <q/2 (c Still assumig that {a m } is odd, show that = a = 2q q m= a (ζ m ζ m. A(mF (2πm/q. [Hit: Defie Ã(m = q = a ζ m ad apply the Fourier iversio formula.] 6. Use the previous exercises to show that π 3 3 = 2 + 4 5 + 7 8 +, which is L(, χ for the o-trivial (odd Dirichlet character modulo 3. 6

2 Problems. Here are other series that ca be summed by the methods i (a For the otrivial Dirichlet character modulo 6, L(, χ equals π 2 3 = 5 + 7 + 3 +, (b If χ is the odd Dirichlet character modulo 8, the L(, χ equals π 2 2 = + 3 5 7 + 9 +, (c For a odd Dirichlet character modulo 7, L(, χ equals π 7 = + 2 3 + 4 5 6, (d For a eve Dirichlet character modulo 8, L(, χ equals log( + 2 2 = 3 5 + 7 + 9, (e For a eve Dirichlet character modulo 5, L(, χ equals 2 5 log ( + 5 = 2 2 3 + 4 + 6 7 8 + 9 +, 2. Let d(k deote the umber of positive divisors of k. (a Show that if k = p a p a is the prime factorizatio of k, the d(k = (a + (a +. Although Theorem 3.2 shows that o average d(k is of the order of log k, prove that the followig o the basis of (a: (b d(k = 2 for ifiitely may k. (c For ay positive iteger N, there is a costat c > 0 so that d(k c(log k N for ifiitely may k. [Hit: Let p, p N be N distict primes, ad cosider k of the form (p p 2 p N m for m =, 2,.] (a(b are easy. (c 7

3. Show that if p is relatively prime to q, the χ ( χ(p ( g, = p s p fs where g = ϕ(q/f, ad f is the order of p i Z (q (that is, the smallest for which p mod q. Here the product is take over all Dirichlet characters modulo q. 4. Prove as a cosequece of the previous problem that L(s, χ = χ where a 0, ad the product is over all Dirichlet characters modulo q. a s, 8