Fourier Analysis, Stein and Shakarchi Chapter 8 Dirichlet s Theorem

Size: px
Start display at page:

Download "Fourier Analysis, Stein and Shakarchi Chapter 8 Dirichlet s Theorem"

Transcription

1 Fourier Aalysis, Stei ad Shakarchi Chapter 8 Dirichlet s Theorem 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 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 d042200@tu.edu.tw

2 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

3 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

4 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

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

6 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 = , which is L(, χ for the o-trivial (odd Dirichlet character modulo 3. 6

7 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 = , (b If χ is the odd Dirichlet character modulo 8, the L(, χ equals π 2 2 = , (c For a odd Dirichlet character modulo 7, L(, χ equals π 7 = , (d For a eve Dirichlet character modulo 8, L(, χ equals log( = , (e For a eve Dirichlet character modulo 5, L(, χ equals 2 5 log ( + 5 = , 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

8 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

The multiplicative structure of finite field and a construction of LRC

The multiplicative structure of finite field and a construction of LRC IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio

More information

Math 4400/6400 Homework #7 solutions

Math 4400/6400 Homework #7 solutions MATH 4400 problems. Math 4400/6400 Homewor #7 solutios 1. Let p be a prime umber. Show that the order of 1 + p modulo p 2 is exactly p. Hit: Expad (1 + p) p by the biomial theorem, ad recall from MATH

More information

(I.C) THE DISTRIBUTION OF PRIMES

(I.C) THE DISTRIBUTION OF PRIMES I.C) THE DISTRIBUTION OF PRIMES I the last sectio we showed via a Euclid-ispired, algebraic argumet that there are ifiitely may primes of the form p = 4 i.e. 4 + 3). I fact, this is true for primes of

More information

Seunghee Ye Ma 8: Week 5 Oct 28

Seunghee Ye Ma 8: Week 5 Oct 28 Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value

More information

(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

(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 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

M17 MAT25-21 HOMEWORK 5 SOLUTIONS

M17 MAT25-21 HOMEWORK 5 SOLUTIONS M17 MAT5-1 HOMEWORK 5 SOLUTIONS 1. To Had I Cauchy Codesatio Test. Exercise 1: Applicatio of the Cauchy Codesatio Test Use the Cauchy Codesatio Test to prove that 1 diverges. Solutio 1. Give the series

More information

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

MATH 6101 Fall Problems. Problems 11/9/2008. Series and a Famous Unsolved Problem (2-1)(2 + 1) ( 4) 12-Nov-2008 MATH /9/008 MATH 60 Fall 008 Series ad a Famous Usolved Problem = = + + + + ( - )( + ) 3 3 5 5 7 7 9 -Nov-008 MATH 60 ( 4) = + 5 48 -Nov-008 MATH 60 3 /9/008 ( )! = + -Nov-008 MATH 60 4 3 4 5 + + + + + + +

More information

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

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 Series. Defiitios ad first properties A series is a ifiite sum a + a + a +..., deoted i short by a. The sequece of partial sums of the series a is the sequece s ) defied by s = a k = a +... + a,. k= Defiitio

More information

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

and each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime. MATH 324 Summer 200 Elemetary Number Theory Solutios to Assigmet 2 Due: Wedesday July 2, 200 Questio [p 74 #6] Show that o iteger of the form 3 + is a prime, other tha 2 = 3 + Solutio: If 3 + is a prime,

More information

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

Homework 1 Solutions. The exercises are from Foundations of Mathematical Analysis by Richard Johnsonbaugh and W.E. Pfaffenberger. Homewor 1 Solutios Math 171, Sprig 2010 Hery Adams The exercises are from Foudatios of Mathematical Aalysis by Richard Johsobaugh ad W.E. Pfaffeberger. 2.2. Let h : X Y, g : Y Z, ad f : Z W. Prove that

More information

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

MA541 : Real Analysis. Tutorial and Practice Problems - 1 Hints and Solutions MA54 : Real Aalysis Tutorial ad Practice Problems - Hits ad Solutios. Suppose that S is a oempty subset of real umbers that is bouded (i.e. bouded above as well as below). Prove that if S sup S. What ca

More information

MATH 6101 Fall 2008 Series and a Famous Unsolved Problem

MATH 6101 Fall 2008 Series and a Famous Unsolved Problem MATH 60 Fall 2008 Series ad a Famous Usolved Problem Problems = + + + + = (2- )(2+ ) 3 3 5 5 7 7 9 2-Nov-2008 MATH 60 2 Problems ( 4) = + 25 48 2-Nov-2008 MATH 60 3 Problems ( )! = + 2-Nov-2008 MATH 60

More information

Dirichlet s Theorem on Arithmetic Progressions

Dirichlet s Theorem on Arithmetic Progressions Dirichlet s Theorem o Arithmetic Progressios Athoy Várilly Harvard Uiversity, Cambridge, MA 0238 Itroductio Dirichlet s theorem o arithmetic progressios is a gem of umber theory. A great part of its beauty

More information

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

The structure of finite rings. The multiplicative residues. Modular exponentiation. and finite exponentiation The structure of fiite rigs ad fiite expoetiatio The multiplicative residues We have see that the fiite rig Z p is a field, that is, every o-zero elemet of Z p has a multiplicative iverse It is a covetio

More information

Math 140A Elementary Analysis Homework Questions 1

Math 140A Elementary Analysis Homework Questions 1 Math 14A Elemetary Aalysis Homewor Questios 1 1 Itroductio 1.1 The Set N of Natural Numbers 1 Prove that 1 2 2 2 2 1 ( 1(2 1 for all atural umbers. 2 Prove that 3 11 (8 5 4 2 for all N. 4 (a Guess a formula

More information

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.

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. Basic Sets Example 1. Let S = {1, {2, 3}, 4}. Idicate whether each statemet is true or false. (a) S = 4 (b) {1} S (c) {2, 3} S (d) {1, 4} S (e) 2 S. (f) S = {1, 4, {2, 3}} (g) S Example 2. Compute the

More information

Different kinds of Mathematical Induction

Different kinds of Mathematical Induction Differet ids of Mathematical Iductio () Mathematical Iductio Give A N, [ A (a A a A)] A N () (First) Priciple of Mathematical Iductio Let P() be a propositio (ope setece), if we put A { : N p() is true}

More information

Complex Analysis Spring 2001 Homework I Solution

Complex Analysis Spring 2001 Homework I Solution Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle

More information

Chapter 0. Review of set theory. 0.1 Sets

Chapter 0. Review of set theory. 0.1 Sets Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.

More information

The Structure of Z p when p is Prime

The Structure of Z p when p is Prime LECTURE 13 The Structure of Z p whe p is Prime Theorem 131 If p > 1 is a iteger, the the followig properties are equivalet (1) p is prime (2) For ay [0] p i Z p, the equatio X = [1] p has a solutio i Z

More information

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

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 Chater 2 Euclid s Theorem Theorem 2.. There are a ifiity of rimes. This is sometimes called Euclid s Secod Theorem, what we have called Euclid s Lemma beig kow as Euclid s First Theorem. Proof. Suose to

More information

Solutions to Math 347 Practice Problems for the final

Solutions to Math 347 Practice Problems for the final Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is

More information

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

1 Lecture 2: Sequence, Series and power series (8/14/2012) Summer Jump-Start Program for Aalysis, 202 Sog-Yig Li Lecture 2: Sequece, Series ad power series (8/4/202). More o sequeces Example.. Let {x } ad {y } be two bouded sequeces. Show lim sup (x + y ) lim

More information

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of

More information

Primes in Arithmetic Progressions

Primes in Arithmetic Progressions 2 Primes i Arithmetic Progressios I 837 Dirichlet proved by a igeious aalytic method that there are ifiitely may primes i the arithmetic progressio a, a + q, a +2q, a +3q,... i which a ad q have o commo

More information

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

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial. Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable

More information

INFINITE SEQUENCES AND SERIES

INFINITE SEQUENCES AND SERIES 11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES 11.4 The Compariso Tests I this sectio, we will lear: How to fid the value of a series by comparig it with a kow series. COMPARISON TESTS

More information

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

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play. Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers

More information

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

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006 MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the

More information

DIRICHLET S THEOREM ON ARITHMETIC PROGRESSIONS

DIRICHLET S THEOREM ON ARITHMETIC PROGRESSIONS DIRICHLET S THEOREM ON ARITHMETIC PROGRESSIONS 1. Itroductio Questio: Let a, N be itegers with 0 a < N ad gcd(a, N) = 1. Does the arithmetic progressio cotai ifiitely may primes? {a, a + N, a + 2N, a +

More information

MA131 - Analysis 1. Workbook 9 Series III

MA131 - Analysis 1. Workbook 9 Series III MA3 - Aalysis Workbook 9 Series III Autum 004 Cotets 4.4 Series with Positive ad Negative Terms.............. 4.5 Alteratig Series.......................... 4.6 Geeral Series.............................

More information

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

Convergence of random variables. (telegram style notes) P.J.C. Spreij Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space

More information

Square-Congruence Modulo n

Square-Congruence Modulo n Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet

More information

Sketch of Dirichlet s Theorem on Arithmetic Progressions

Sketch of Dirichlet s Theorem on Arithmetic Progressions Itroductio ad Defiitios Sketch of o Arithmetic Progressios Tom Cuchta 24 February 2012 / Aalysis Semiar, Missouri S&T Outlie Itroductio ad Defiitios 1 Itroductio ad Defiitios 2 3 Itroductio ad Defiitios

More information

Sequences, Series, and All That

Sequences, Series, and All That Chapter Te Sequeces, Series, ad All That. Itroductio Suppose we wat to compute a approximatio of the umber e by usig the Taylor polyomial p for f ( x) = e x at a =. This polyomial is easily see to be 3

More information

Some p-adic congruences for p q -Catalan numbers

Some p-adic congruences for p q -Catalan numbers Some p-adic cogrueces for p q -Catala umbers Floria Luca Istituto de Matemáticas Uiversidad Nacioal Autóoma de México C.P. 58089, Morelia, Michoacá, México fluca@matmor.uam.mx Paul Thomas Youg Departmet

More information

Complex Numbers Solutions

Complex Numbers Solutions Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i

More information

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

Sequences. A Sequence is a list of numbers written in order. Sequeces A Sequece is a list of umbers writte i order. {a, a 2, a 3,... } The sequece may be ifiite. The th term of the sequece is the th umber o the list. O the list above a = st term, a 2 = 2 d term,

More information

Injections, Surjections, and the Pigeonhole Principle

Injections, Surjections, and the Pigeonhole Principle Ijectios, Surjectios, ad the Pigeohole Priciple 1 (10 poits Here we will come up with a sloppy boud o the umber of parethesisestigs (a (5 poits Describe a ijectio from the set of possible ways to est pairs

More information

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

Read carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book. THE UNIVERSITY OF WARWICK FIRST YEAR EXAMINATION: Jauary 2009 Aalysis I Time Allowed:.5 hours Read carefully the istructios o the aswer book ad make sure that the particulars required are etered o each

More information

SOLVED EXAMPLES

SOLVED EXAMPLES Prelimiaries Chapter PELIMINAIES Cocept of Divisibility: A o-zero iteger t is said to be a divisor of a iteger s if there is a iteger u such that s tu I this case we write t s (i) 6 as ca be writte as

More information

Unit 6: Sequences and Series

Unit 6: Sequences and Series AMHS Hoors Algebra 2 - Uit 6 Uit 6: Sequeces ad Series 26 Sequeces Defiitio: A sequece is a ordered list of umbers ad is formally defied as a fuctio whose domai is the set of positive itegers. It is commo

More information

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

11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4. 11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although

More information

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 +

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 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

Ma 530 Introduction to Power Series

Ma 530 Introduction to Power Series Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power

More information

Cardinality Homework Solutions

Cardinality Homework Solutions Cardiality Homework Solutios April 16, 014 Problem 1. I the followig problems, fid a bijectio from A to B (you eed ot prove that the fuctio you list is a bijectio): (a) A = ( 3, 3), B = (7, 1). (b) A =

More information

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

d) If the sequence of partial sums converges to a limit L, we say that the series converges and its Ifiite Series. Defiitios & covergece Defiitio... Let {a } be a sequece of real umbers. a) A expressio of the form a + a +... + a +... is called a ifiite series. b) The umber a is called as the th term

More information

DIRICHLET S THEOREM ON ARITHMETIC PROGRESSIONS

DIRICHLET S THEOREM ON ARITHMETIC PROGRESSIONS DIRICHLET S THEOREM ON ARITHMETIC PROGRESSIONS 1. Itroductio Questio: Let a, N be itegers with 0 a < N ad gcd(a, N) = 1. Does the arithmetic progressio cotai ifiitely may primes? {a, a + N, a + 2N, a +

More information

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

Trial division, Pollard s p 1, Pollard s ρ, and Fermat s method. Christopher Koch 1. April 8, 2014 Iteger Divisio Algorithm ad Cogruece Iteger Trial divisio,,, ad with itegers mod Iverses mod Multiplicatio ad GCD Iteger Christopher Koch 1 1 Departmet of Computer Sciece ad Egieerig CSE489/589 Algorithms

More information

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

THE AVERAGE ORDER OF ELEMENTS IN THE MULTIPLICATIVE GROUP OF A FINITE FIELD. α(n) = 1 THE AVERAGE ORDER OF ELEMENTS IN THE MULTIPLICATIVE GROUP OF A FINITE FIELD YILAN HU AND CARL POMERANCE ABSTRACT. We cosider the average multiplicative order of a ozero elemet i a fiite field ad compute

More information

The 4-Nicol Numbers Having Five Different Prime Divisors

The 4-Nicol Numbers Having Five Different Prime Divisors 1 2 3 47 6 23 11 Joural of Iteger Sequeces, Vol. 14 (2011), Article 11.7.2 The 4-Nicol Numbers Havig Five Differet Prime Divisors Qiao-Xiao Ji ad Mi Tag 1 Departmet of Mathematics Ahui Normal Uiversity

More information

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

The minimum value and the L 1 norm of the Dirichlet kernel The miimum value ad the L orm of the Dirichlet kerel For each positive iteger, defie the fuctio D (θ + ( cos θ + cos θ + + cos θ e iθ + + e iθ + e iθ + e + e iθ + e iθ + + e iθ which we call the (th Dirichlet

More information

ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS

ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS NORBERT KAIBLINGER Abstract. Results of Lid o Lehmer s problem iclude the value of the Lehmer costat of the fiite cyclic group Z/Z, for 5 ad all odd. By complemetary

More information

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

Limit superior and limit inferior c Prof. Philip Pennance 1 -Draft: April 17, 2017 Limit erior ad limit iferior c Prof. Philip Peace -Draft: April 7, 207. Defiitio. The limit erior of a sequece a is the exteded real umber defied by lim a = lim a k k Similarly, the limit iferior of a

More information

Chapter 6 Infinite Series

Chapter 6 Infinite Series Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat

More information

Analytic Number Theory Solutions

Analytic Number Theory Solutions Aalytic Number Theory Solutios Sea Li Corell Uiversity sl6@corell.eu Ja. 03 Itrouctio This ocumet is a work-i-progress solutio maual for Tom Apostol s Itrouctio to Aalytic Number Theory. The solutios were

More information

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?

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? 2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a

More information

On a Smarandache problem concerning the prime gaps

On a Smarandache problem concerning the prime gaps O a Smaradache problem cocerig the prime gaps Felice Russo Via A. Ifate 7 6705 Avezzao (Aq) Italy felice.russo@katamail.com Abstract I this paper, a problem posed i [] by Smaradache cocerig the prime gaps

More information

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

THE ZETA FUNCTION AND THE RIEMANN HYPOTHESIS. Contents 1. History 1 THE ZETA FUNCTION AND THE RIEMANN HYPOTHESIS VIKTOR MOROS Abstract. The zeta fuctio has bee studied for ceturies but mathematicias are still learig about it. I this paper, I will discuss some of the zeta

More information

Solutions to Problem Sheet 4

Solutions to Problem Sheet 4 Solutios to Problem Sheet 4. a Evaluate. b By Partial Summatio deduce = ζ2 2 x2 +Oxlogx. Hit Fid f such that / = d f d. Solutio a Recall σ = j. The defiitio of covolutio ca be give i more tha oe way, so

More information

Chapter 1. Complex Numbers. Dr. Pulak Sahoo

Chapter 1. Complex Numbers. Dr. Pulak Sahoo Chapter 1 Complex Numbers BY Dr. Pulak Sahoo Assistat Professor Departmet of Mathematics Uiversity Of Kalyai West Begal, Idia E-mail : sahoopulak1@gmail.com 1 Module-2: Stereographic Projectio 1 Euler

More information

MDIV. Multiple divisor functions

MDIV. Multiple divisor functions MDIV. Multiple divisor fuctios The fuctios τ k For k, defie τ k ( to be the umber of (ordered factorisatios of ito k factors, i other words, the umber of ordered k-tuples (j, j 2,..., j k with j j 2...

More information

Chapter IV Integration Theory

Chapter IV Integration Theory Chapter IV Itegratio Theory Lectures 32-33 1. Costructio of the itegral I this sectio we costruct the abstract itegral. As a matter of termiology, we defie a measure space as beig a triple (, A, µ), where

More information

Bertrand s Postulate

Bertrand s Postulate Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a

More information

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.

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. 4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad

More information

Measure and Measurable Functions

Measure and Measurable Functions 3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies

More information

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

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function. MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied

More information

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

[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x] [ 47 ] Number System 1. Itroductio Pricile : Let { T ( ) : N} be a set of statemets, oe for each atural umber. If (i), T ( a ) is true for some a N ad (ii) T ( k ) is true imlies T ( k 1) is true for all

More information

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

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1. Math 7 Sprig 06 PROBLEM SET 5 SOLUTIONS Notatios. Give a real umber x, we will defie sequeces (a k ), (x k ), (p k ), (q k ) as i lecture.. (a) (5 pts) Fid the simple cotiued fractio represetatios of 6

More information

2.4.2 A Theorem About Absolutely Convergent Series

2.4.2 A Theorem About Absolutely Convergent Series 0 Versio of August 27, 200 CHAPTER 2. INFINITE SERIES Add these two series: + 3 2 + 5 + 7 4 + 9 + 6 +... = 3 l 2. (2.20) 2 Sice the reciprocal of each iteger occurs exactly oce i the last series, we would

More information

JANE PROFESSOR WW Prob Lib1 Summer 2000

JANE PROFESSOR WW Prob Lib1 Summer 2000 JANE PROFESSOR WW Prob Lib Summer 000 Sample WeBWorK problems. WeBWorK assigmet Series6CompTests due /6/06 at :00 AM..( pt) Test each of the followig series for covergece by either the Compariso Test or

More information

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.

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. Departmet of Mathematical Scieces Istructor: Daiva Puciskaite Discrete Mathematics Fermat s Little Theorem 43.. For all a Z 3, calculate a 2 ad a 3. Case a = 0. 0 0 2-times Case a 0. 0 0 3-times a a 2-times

More information

Analytic Continuation

Analytic Continuation Aalytic Cotiuatio The stadard example of this is give by Example Let h (z) = 1 + z + z 2 + z 3 +... kow to coverge oly for z < 1. I fact h (z) = 1/ (1 z) for such z. Yet H (z) = 1/ (1 z) is defied for

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

Section 11.8: Power Series

Section 11.8: Power Series Sectio 11.8: Power Series 1. Power Series I this sectio, we cosider geeralizig the cocept of a series. Recall that a series is a ifiite sum of umbers a. We ca talk about whether or ot it coverges ad i

More information

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information

Ma 530 Infinite Series I

Ma 530 Infinite Series I Ma 50 Ifiite Series I Please ote that i additio to the material below this lecture icorporated material from the Visual Calculus web site. The material o sequeces is at Visual Sequeces. (To use this li

More information

Math 299 Supplement: Real Analysis Nov 2013

Math 299 Supplement: Real Analysis Nov 2013 Math 299 Supplemet: Real Aalysis Nov 203 Algebra Axioms. I Real Aalysis, we work withi the axiomatic system of real umbers: the set R alog with the additio ad multiplicatio operatios +,, ad the iequality

More information

Sequences. Notation. Convergence of a Sequence

Sequences. Notation. Convergence of a Sequence Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it

More information

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,

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, 3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [

More information

Beurling Integers: Part 2

Beurling Integers: Part 2 Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

Chapter 2 Elementary Prime Number Theory for

Chapter 2 Elementary Prime Number Theory for Chapter 2 Elemetary Prime Number Theory for 207-8 [5 lectures] I keepig with the elemetary theme of the title I will attempt to keep away from complex variables. Recall that i Chapter we proved the ifiitude

More information

Primality Test. Rong-Jaye Chen

Primality Test. Rong-Jaye Chen Primality Test Rog-Jaye Che OUTLINE [1] Modular Arithmetic Algorithms [2] Quadratic Residues [3] Primality Testig p2. [1] Modular Arithmetic Algorithms 1. The itegers a divides b a b a{ 1, b} If b has

More information

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

Notes #3 Sequences Limit Theorems Monotone and Subsequences Bolzano-WeierstraßTheorem Limsup & Liminf of Sequences Cauchy Sequences and Completeness Notes #3 Sequeces Limit Theorems Mootoe ad Subsequeces Bolzao-WeierstraßTheorem Limsup & Limif of Sequeces Cauchy Sequeces ad Completeess This sectio of otes focuses o some of the basics of sequeces of

More information

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

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 M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #4 CORRECTION Algebra I 1 4 / 1 0 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O P r o f e s s o r : D r o r B a r - N a t a Correctio Homework Assigmet

More information

MATH 312 Midterm I(Spring 2015)

MATH 312 Midterm I(Spring 2015) MATH 3 Midterm I(Sprig 05) Istructor: Xiaowei Wag Feb 3rd, :30pm-3:50pm, 05 Problem (0 poits). Test for covergece:.. 3.. p, p 0. (coverges for p < ad diverges for p by ratio test.). ( coverges, sice (log

More information

Axioms of Measure Theory

Axioms of Measure Theory MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that

More information

Solutions to Homework 1

Solutions to Homework 1 Solutios to Homework MATH 36. Describe geometrically the sets of poits z i the complex plae defied by the followig relatios /z = z () Re(az + b) >, where a, b (2) Im(z) = c, with c (3) () = = z z = z 2.

More information

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

2.1. The Algebraic and Order Properties of R Definition. A binary operation on a set F is a function B : F F! F. CHAPTER 2 The Real Numbers 2.. The Algebraic ad Order Properties of R Defiitio. A biary operatio o a set F is a fuctio B : F F! F. For the biary operatios of + ad, we replace B(a, b) by a + b ad a b, respectively.

More information

TERMWISE DERIVATIVES OF COMPLEX FUNCTIONS

TERMWISE DERIVATIVES OF COMPLEX FUNCTIONS TERMWISE DERIVATIVES OF COMPLEX FUNCTIONS This writeup proves a result that has as oe cosequece that ay complex power series ca be differetiated term-by-term withi its disk of covergece The result has

More information

CS / MCS 401 Homework 3 grader solutions

CS / MCS 401 Homework 3 grader solutions CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of

More information

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

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018 CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical

More information

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

Bertrand s Postulate. Theorem (Bertrand s Postulate): For every positive integer n, there is a prime p satisfying n < p 2n. Bertrad s Postulate Our goal is to prove the followig Theorem Bertrad s Postulate: For every positive iteger, there is a prime p satisfyig < p We remark that Bertrad s Postulate is true by ispectio for,,

More information

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS VERNER E. HOGGATT, JR. Sa Jose State Uiversity, Sa Jose, Califoria 95192 ad CALVIN T. LONG Washigto State Uiversity, Pullma, Washigto 99163

More information

SCORE. Exam 2. MA 114 Exam 2 Fall 2016

SCORE. Exam 2. MA 114 Exam 2 Fall 2016 MA 4 Exam Fall 06 Exam Name: Sectio ad/or TA: Do ot remove this aswer page you will retur the whole exam. You will be allowed two hours to complete this test. No books or otes may be used. You may use

More information

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

Created by T. Madas SERIES. Created by T. Madas SERIES SUMMATIONS BY STANDARD RESULTS Questio (**) Use stadard results o summatios to fid the value of 48 ( r )( 3r ). 36 FP-B, 66638 Questio (**+) Fid, i fully simplified factorized form, a expressio

More information

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

Arkansas Tech University MATH 2924: Calculus II Dr. Marcel B. Finan Arkasas Tech Uiversity MATH 94: Calculus II Dr Marcel B Fia 85 Power Series Let {a } =0 be a sequece of umbers The a power series about x = a is a series of the form a (x a) = a 0 + a (x a) + a (x a) +

More information

REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS

REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS 18th Feb, 016 Defiitio (Lipschitz fuctio). A fuctio f : R R is said to be Lipschitz if there exists a positive real umber c such that for ay x, y i the domai

More information

Solutions to Tutorial 3 (Week 4)

Solutions to Tutorial 3 (Week 4) The Uiversity of Sydey School of Mathematics ad Statistics Solutios to Tutorial Week 4 MATH2962: Real ad Complex Aalysis Advaced Semester 1, 2017 Web Page: http://www.maths.usyd.edu.au/u/ug/im/math2962/

More information