Dirichlet s Theorem on Arithmetic Progressions

Size: px
Start display at page:

Download "Dirichlet s Theorem on Arithmetic Progressions"

Transcription

1 Dirichlet s Theorem o Arithmetic Progressios The ifiitude of rimes Prime umbers are the buildig blocs of all coutig umbers: the fudametal theorem of arithmetic states that every ositive iteger ca be writte as a uique roduct of rime umbers, u to the order of the rime factors. Thus rime umbers are of great imortace, esecially i umber theory, ad for cetury after cetury, mathematicias have wored to uderstad rime umbers better. Oe of the questios that occurred to early mathematicias was: how may rimes are there? There are ifiitely may of them, as first show by Euclid i his boo of Elemets. This roof is usually foud i boos i a form restated i the moder laguage of mathematics; I assume that the reader has see the roof i that form. I Euclid s time, umbers were thought of as legths of lie segmets, so I shall state the roof i the laguage closer to Euclid s origial oe. Theorem.. The umber of rime umbers is more tha ay assiged multitude of rime umbers. A B C E D F Euclid s argumet. Say a umber i.e. a lie segmet of legth X is measured by aother umber Y if X is roortioal to Y. Let A, B, ad C be the assiged rime umbers. Tae the least umber DE measured by A, B, ad C. Add the uit legth segmet DF to DE. The EF is either rime or ot rime. If it is rime, the there are ow the rime umbers A, B, C ad EF, more i umber tha the assiged umber three, that is, A, B ad C. If it is ot rime, the it is measured by some rime umber. Let it be measured by the rime umber G. Sice A, B ad C measure DE, G also measures DE. But it also measures EF, so G measures the remaiig segmet, the uit-legth DF, which is absurd. So G is ot oe of the

2 umbers A,B or C. Sice G is rime, we ow have the rime umbers A, B, C ad G, agai more i umber tha the assiged umber three. We ca aly this to ay umber, ot just three, so there are more rime umbers tha ay assiged multitude of rime umbers. Whe mathematicias became more familiar with the otio of ifiity, they the bega to as: how ifiite is this ifiite umber of rimes? For examle, they would cosider a ifiite sequece of ositive itegers X x 0, x, x,... as, iome sese, bigger more dese i distributio, for examle tha aother ifiite sequece of ositive itegers Y y 0, y, y,... if i x i diverges but i y i coverges. Whe Euler gave aother roof that there are ifiitely may rimes, he also showed us that there are ideed quite a lot of rimes: Theorem.. The sum of the recirocals of the rimes diverges, i.e. diverges. We shall defer the roof util later. After establishig that there is a ifiite umber of rimes, eole bega to as about the ifiitude of rimes i aother way: If we are give ay arithmetic sequece, do we also have a ifiite umber of rimes i the sequece? Euler first stated that if the first term of a arithmetic sequece is, the the sequece cotais a ifiite umber of rimes. Now cosider a geeral arithmetic sequece. If the first term ad the commo differece have a commo factor that is ot equal to, the clearly every umber i the sequece would be divisible by, so this must be excluded for the questio to have a chace of a aswer i the affirmative. With this case excluded, the statemet i the questio was first cojectured to be true by Gauss. It turs out that if this case is excluded, the ideed there is a ifiite umber of rimes i the sequece. This was first roved by Dirichlet i 835, ad is ow ow as Dirichlet s theorem o arithmetic rogressios: Theorem.3. If a is corime to d, the the arithmetic rogressio a, a + d, a + d,... cotais a ifiite umber of rimes. Put aother way, we may say that if two umbers a ad b are corime, the there are a ifiite umber of rimes of the form a + b, where > 0. There is o simle elemetary argumet ow that roves this theorem i full geerality. However, for a few simle cases, we may mimic Euclid s roof for the ifiitude of rimes i order to write out a roof for these cases. Theorem.4. There exist a ifiite umber of rimes of the form Proof. Suose that there are fiitely may rimes of the form Call them,,...,. Let N : The N 5 mod 6. Sice for ay m ad we have 6 + 6m + mod 6

3 6 + 6m mod 6 ad m mod 6, N must have at least oe rime factor q such that q 5 mod 6.,,...,, as otherwise q N ad q 6..., But q caot be oe of which imlies that q 6... N, i.e. q, which is imossible. So we foud aother rime of the form 6 + 5, a cotradictio. Hece there are ifiitely may rimes of the form Utilisig the Legedre symbol ad / or quadratic recirocity, we ca also rove some of the other cases of the theorem, still mimicig Euclid s idea. We shall demostrate with oe usig the roerties of Legedre symbol aloe, ad aother that also uses quadratic recirocity. Theorem.5. There exist a ifiite umber of rimes of the form 8. Proof. Suose that there are fiitely may rimes of the form 8. Call them,,...,. Let N : Sice N/ is odd, N must be divisible by some odd rime q, so 4... mod q. Hece we have q. Sice for a odd rime we have /8, we ca coclude that q mod 8 or q 7 mod 8. Sice N/ is odd, N/ is the roduct of all the odd rime factors of N. But N/ mod 8, so there must be at least oe such factor of the form 8, as otherwise N/ mod 8. Let this factor be r. But r caot be oe of,,...,, as otherwise r N ad r 4..., which imlies that r, which is imossible as r is odd. So we foud aother rime of the form 8, a cotradictio. Hece there are ifiitely may rimes of the form 8. Theorem.6. There exist a ifiite umber of rimes of the form 6 +. Proof. Suose that there are fiitely may rimes of the form 6 +. Call them,,...,. Let N : The N mod 6. Suose q is a rime factor dividig N. Theice N :... +, rovided that q 3 we have a solutio to the cogruece i.e. 3x 3 mod, givig we fid that 3 3 3x + 0 mod,. Usig / ad quadratic recirocity, 3 / so i fact 3. This meas that mod 3. But is odd, so mod 6. As before, caot be oe of,,...,, so we have our cotradictio. 3

4 However, there is o ow elemetary roof similar to the above oes for the geeral case. To rove the geeral theorem, istead of followig Euclid s idea, Dirichlet followed ad we shall follow Euler s idea, that is, by rovig that the sum of the recirocals of such sequeces diverges. For the remaider of this essay, the mai focus will be to rove Dirichlet s theorem, ad we shall develo ideas to the extet that they are eeded i achievig our goal. To reare ourselves for ivestigatio ito the qualitative roerties of the ifiitude of rimes, we first cosider arithmetic fuctios. Arithmetic fuctios Defiitio.. A arithmetic fuctio or a umber-theoretic fuctio is a fuctio f from the ositive itegers to the comlex umbers. That is, it is a sequece of comlex umbers. Defiitio.. A arithmetic fuctio is called multilicative if fm fmf for all airs of corime m,. A fuctio is called comletely multilicative if fm fmf for all m,. We first cosider two imortat arithmetic fuctios: the Möbius fuctio ad the Euler totiet fuctio. Recall that a square-free iteger is oe ot divisible by ay erfect square other tha. Defiitio.3. The Möbius fuctio is the fuctio µ : Z + {, 0, } defied by if or if is square-free with a eve umber of distict rime factors; µ : if is square-free with a odd umber of distict rime factors; 0 if is ot square-free. Notice that the Möbius fuctio is multilicative. Theorem.4. Suose. The µd d { if 0 if >. That is, µd d. Proof. This is clearly true for. Now assume that >. Write α α... α. µd is zero if d has a square i its factors, so the sum is comrised of terms where d ad where d is a divisor of that is a roduct of distict rimes. So we have µd µ + µ + + µ + µ + + µ + + µ... d

5 Defiitio.5. The Euler totiet fuctio is the fuctio ϕ : Z + Z + defied as the umber of ositive itegers ot exceedig that are corime to. Theorem.6. Let. The ϕd. d Proof. Defie S : {,,..., }, Ad { : gcd, d, 0 < }. S is thus a disjoit uio of Ad, so Ad. d Now gcd, d gcd/d, /d, ad 0 < 0 < /d /d. So if we let q /d, the q satisfies gcdq, /d, 0 < q /d. There are ϕ/d umbers q satisfyig this, ad sice the two coditios corresod exactly to that for the sets Ad, ϕ. d Sice d d ϕ ϕ, the result follows. d d We ow establish a li betwee the Möbius fuctio ad the Euler totiet fuctio: Theorem.7. Let. The ϕ d µd d. Proof. ϕ gcd, d gcd, µd by.4 µd d d d /d µd q where agai q /d d µd d. Theorem.8. With the emty roduct equal to, we have ϕ. 5

6 Proof. Write α α... α. Alyig the revious theorem, ϕ d µd d d α...α µd d µd d d... + i i µ i i i + i,j. sice µd 0 if d is ot square-free + i,j µ i j + µ... i j... i j Euler s argumet for the ifiitude of rimes I this sectio, we shall first wor towards rovig Theorem.. Recall that Theorem. states that the sum of the recirocals of all the rimes diverges. Defiitio 3.. For s >, we defie the Riema zeta fuctio to be ζs. The variable is covetioally deoted s i deferece to Riema s 859 aer that fouded the study of this fuctio as a comlex fuctio, ow famous for the Riema Hyothesis stated i it. The itegral test quicly establishes the covergece of the series for s > ad divergece otherwise. Far before Riema s time, however, this fuctio was studied by Euler as a real fuctio. Euler was the first to comute exact values of ζs for s, as well as umerous other eve-umber values of s. He also deduced a roduct formula for ζs, the geeralised versio of which ow bears his ame. Theorem 3. Euler Product. If f is multilicative, the f + f + f +. rime Proof. Exad artial roducts o the right had side, ad aly the fudametal theorem of arithmetic: + f + f + f f f t t <y 6 t

7 ,,..., t f f,,..., t f : P <y t f ft t t where,,..., t are the rimes less tha y ad P is the largest rime factor of. Every ositive iteger less tha y has o factors more tha y, so f f f. : P <y The right had side teds to zero as y, so the result follows. Corollary 3.3. If f is comletely multilicative, the y f rime f. Proof. Sice f is comletely multilicative, f f. Hece by the revious theorem, f rime rime rime + f + f + + f + f + f. Corollary 3.4. For s >, ζs rime s. Proof. Aly the above corollary to the fuctio f : s, which is obviously comletely multilicative. We ca ow rove Theorem., which we restate here: Theorem 3.5. The sum of the recirocals of the rimes diverges, i.e. diverges. Euler himself wrote this argumet: 7

8 Euler s argumet. Euler maiulated the harmoic series formally. Usig the Euler roduct formula, log log log < < C for some costat C, fiite because is fiite. Sice made the coclusio that log log+. is asymtotic to log, Euler This is ot rigorous by modertadards, but ca be modified to be so. Oe obvious way to iterret the last equatio is to treat it as meaig that the artial sum of the recirocals of rimes is asymtotic to log log. This is ideed the case. We build o Euler s idea to costruct a roof that also gives a estimate for the sum: Proof of 3.5. Firstly, every ositive iteger i ca be writte as a roduct of a squarefree iteger ad a square. Suose i a i b i, where a i i is squarefree, ad b i i. The i i i a i b i a i i + 8 sice a i are squarefree.

9 Secodly, by the itegral defiitio of the atural logarithm, Thirdly, for all x > 0, Ad the sum log < i i. + x < + x + x! + ζ x! ex. is fiite. Combiig everythig above, log < i + < ζ e / ζ ex, i ad the taig logarithm of both sides, log log log ζ < So the artial sum grows at least lie log log. Remar 3.6. The Meissel-Mertes costat, or just Mertes costat, M, is defied to be the limit of the differece betwee the sum of rime recirocals ad log log : M : lim log log γ + [ log + ]. Ad so we have roved that the sum of the recirocals of all the rimes diverges. To adat the roof to ay arithmetic rogressio with corime leadig term ad commo differece, Dirichlet itroduced Dirichlet characters ad Dirichlet series.. 4 Characters ad their roerties We shall use fuctios called Dirichlet characters, which are comletely multilicative fuctios to which Theorem 3.3 ca be alied. Before we loo ito Dirichlet characters, we first cosider characters ad character grous. Defiitio 4.. Let G be a grou. A character of G is a fuctio f : G C satisfyig fg g fg fg for all g, g G. That is, f is a grou homomorhism. This is ow a secial case of the grou of reresetatios of a grou, for the case where the reresetatios are oe-dimesioal. Such characters cosidered by Dirichlet are oe of the acestors of grou reresetatio ad character theory. We ow derive some roerties of characters of fiite grous. So from ow o, let the grous cocered be fiite grous. 9

10 Proositio 4.. Let G be a grou with idetity e. The fe. Proof. whece fe. fe fe fe, Corollary 4.3. Let G be a grou of order. The for each g G, fg is a -th root of uity. Proof. fg fg fe. Proositio 4.4. If G is a abelia grou of order, the there are characters. Proof. Sice G is abelia, usig the structure theorem, we may write G as G C e C e C e where each i is rime, ad C r is a cyclic grou of order r. If g G, the g g α gα... gα, where g i geerates C e i ad the roduct of the orders of each g i is. Thus i fg i fg i α i. The characters deed o the value of each geerator g i, ad sice the geerators orders multily to, there are at most differet characters. Now suose we are give w, w,..., w such that w e i i i for each i. We ca theet fg i w i, ad costruct a character by defiig fg i fg i α i. It ca be routiely checed that each such costructio is a character ad is distict from all the others, so there are at least differet characters. Thus there are i fact recisely differet characters for G. So suose that the set of characters of G is {f, f,..., f }. Defiitio 4.5. The ricial character, f, is the character such that f g for all g G. Theorem 4.6. The characters of a grou G form a abelia grou, with the grou oeratio defied by f i f j g f i gf j g for all g G, with idetity elemet f ad iverse of f beig f, where deotes comlex cojugatio i.e. the iverse, sice fg is a root of uity. Proof. This routie checig will be sied. Defiitio 4.7. The grou of characters i Theorem 4.6 is called the character grou of G. We shall deote this grou by Ĝ. I algebra laguage, this is the dual grou of the abelia grou G. 0

11 Theorem 4.8 Orthogoality relatios. This is a air of similar assertios. i For a fixed character f Ĝ, ii For a fixed elemet g G, fg g G fg f Ĝ { if f f 0 otherwise. { if g e 0 otherwise. Proof. i If f f the fg. g G g G Otherwise, there must exist h G such that fh. The fh fg fhg fg. g G g G g G Sice fh, g G fg 0. ii If g e the f Ĝ fg f Ĝ. Otherwise, there must exist a character f 0 such that f 0 g. If g g α... gα, theice g e, for some j we have α j 0 mod e j. Theet χg j e πi/e j, χg i for all other i. The as i i, we have f 0 g f Ĝ fg f Ĝ f 0 fg f Ĝ fg. Sice f 0 g, f Ĝ fg 0. Remar 4.9. Theorem 4.8 is called the orthogoality relatios, because if oe relaced f i i by f i f j ad g i ii by g g, we obtai i ii G f i gf j g g G { if f i f j 0 otherwise. { if g g fg fg G 0 otherwise. f Ĝ They are the first ad secod orthogoality relatios for grou characters.

12 Now let be the residue class modulo of a iteger, i.e. the set of all itegers cogruet to modulo. I other terms, + Z Z/Z. The set of reduced residue classes modulo is,,..., ϕ, where each i is corime to ad ϕ is the Euler totiet fuctio. Theorem 4.0. The set of reduced residue classes modulo forms a abelia grou of order ϕ, with the grou oeratio defied by m m. The idetity of the grou is ad the iverse of a elemet m is where atisfies m mod. We deote this grou by Z. Defiitio 4.. A Dirichlet character modulo is a fuctio χ : Z + C defied to be { f if, are corime i.e. Z χ : 0 otherwise, where f is a character of the grou Z. The ricial Dirichlet character modulo, χ, is where f f above, i.e. { if, are corime i.e. Z χ : 0 otherwise. Theorem 4.. A Dirichlet character is a comletely multilicative fuctio. Proof. Suose, m Z +. Case i If ad m are both corime to, the χχm ffm f m fm χm. Case ii If is ot corime to, the m is also ot corime to, so χχm 0 χm 0 χm. I both cases, we have χχm χm, so χ is comletely multilicative. For comleteess, we state this agai i the list of roerties of Dirichlet characters below. Theorem 4.3 Proerties of Dirichlet characters. Dirichlet characters modulo have the followig roerties: i χ + m for all ositive itegers m; ii χ is a ϕ-th root of uity if gcd, ; iii χχm χm for all ositive itegers, m; iv There are recisely ϕ Dirichlet characters modulo ; v For a fixed Dirichlet character χ, vi For a fixed ositive iteger, χ χ χ { ϕ if χ χ 0 otherwise; { ϕ if 0 otherwise. Proof. These roerties directly follow from the defiitio of a Dirichlet character ad the roerties of a grou character.

13 5 Dirichlet series We ow cosider Dirichlet series, the aalogue of the sum of the recirocals of rimes i Euler s roof for the ifiitude of rimes. Dirichlet series have umerous roerties aalogous to those for ower series. We shall first defie a Dirichlet series ad ivestigate its roerties. Defiitio 5.. Let s σ + it C. A Dirichlet series is a series of the form fs. Observe that if σ σ 0, the σ 0, so σ. 0 By the comariso test, we see that if the series coverges absolutely for s 0 σ 0 + it 0, the it coverges absolutely for all s σ + it with σ σ 0. Usig this observatio, we have the followig: Theorem 5. Absolute covergece of Dirichlet series. Suose that the series s does ot coverge or diverge for all s. The there exists a real umber σ a, the abscissa of absolute covergece, such that s coverges absolutely for σ > σ a ad does ot coverge absolutely for σ < σ a. Proof. Let L be the subset of real umbers such that if σ L, the s diverges. By assumtio, the series does ot coverge for all s, so L. The series also does ot diverge for all s, ad by our revious observatio, L must be bouded above. Sice L is a subset of the real umbers, L has a least uer boud. Set σ a to be this least uer boud. Suose σ < σ a. The σ L, because otherwise σ would be a uer boud smaller tha the least uer boud, σ a. Suose σ > σ a. The σ / L, because σ is a uer boud for L. We shall also eed to ow where the series coverges, ot just absolutely. First we eed a lemma, which we the aly to the situatio we eed to obtai the corollary that follows. Lemma 5.3. Let x ad let φx be cotiuously differetiable o [,. Let Sx x C, C C. The Cφ Sxφx x x Stφ tdt. Proof. First otice that if x is such that x < + for some iteger, the Sx S. This will also be subsequetly used to ut the sum iside a itegral with itegratio limits beig two cosecutive itegers. Let us set the emty sum S0 to be 0. Startig from the left had side, x Cφ Cφ 3

14 S S φ Sφ S φ Sφ Sφ + Sφ φ + + Sφ Sφ φ + + Sφ φx + Sφx S + Sxφx Sxφx Sxφx x φ tdt S + x Stφ tdt Stφ tdt Stφ tdt. x φ tdt + Sxφx x Stφ tdt Stφ tdt Corollary 5.4. Let x, y ad for some fixed s, s 0 C, s s 0, let φx : x s s 0. The x< y 0 φ x< y φy 0 Sice φ x s s 0 x s s 0, equivaletly we write x< y x< y 0 y s s 0 + s s 0 y x y x x< t x< t φ tdt. 0 0 t s s 0+ dt. Proof. Alyig Lemma 5.3 with Sx x 0 ad φx x s s 0, we obtai x< y y x y 0 s 0 x 0 s 0 4

15 Sy y s s + s s 0 0 y Sx x s s s s 0 0 Sy Sx y s s 0 St t s s 0+ dt x + Sx Sy Sx y s s s s 0 0 Sy Sx y s s + s s 0 0 x< y 0 y s s 0 + s s 0 St t s s 0+ dt y s s 0 y x y x y x x s s 0 y + s s 0 x Sx t s s 0+ dt + s s 0 St Sx t s s 0+ dt x< t 0 t s s 0+ dt. St t s s 0+ dt y x St t s s 0+ dt Theorem 5.5 Coditioal covergece of Dirichlet series. For each Dirichlet series, there is a abscissa of coditioal covergece σ c [, ] such that the series coverges coditioally for all s with σ > σ c, ad diverges for all s with σ < σ c. Proof. Suose fs coverges for s s 0. We wish to show that fs the coverges for all s with σ > σ 0. We use the fact that over the real umbers, a sequece is a Cauchy sequece if ad oly if it coverges. Let each term i our sequece be defied by a m : m s 0. Thus our assumtio that fs 0 coverges meas that for every ɛ > 0 there is a umber x 0 such that a x a y < ɛ for all x, y > x 0, that is, 0 < ɛ for all x, y > x 0. x< y Now suose ɛ > 0 is give, ad cosider the sequece defied by b m : m s. Alyig 5.4, we have b x b y x< y < ɛ ɛ y σ σ 0 + ɛ s s 0 y σ σ 0 + ɛ s s 0 σ σ 0 y x t σ σ 0+ dt x σ σ 0 ɛ s s 0 σ σ 0 y σ σ 0 + ɛ s s 0 σ σ 0 ɛ s s 0 σ σ 0 x σ σ 0 y σ σ 0 x σ σ 0 y σ σ 0 sice s s 0 σ σ 0 5

16 ɛ s s 0 σ σ 0. Sice ɛ was arbitrary, the series coverges. We set σ c : if{re s : coverges}. Theorem 5.6. Suose that fs s coverges at s s 0. The for every δ > 0, the series coverges uiformly i the sector U : {s : arg s s 0 < π δ}. Proof. Let s be i U. By elemetary trigoometry, hece by we have s s 0 σ σ 0 σ σ 0/ cos arg s s 0 σ σ 0 < cosπ/ δ si δ, sice s U ad cosie decreases o [0, π/ x< y < ɛ si δ, ideedet of s, ad thus covergece is uiform for each s U. Theorem 5.7. A Dirichlet series fs with abscissa of covergece σ c is aalytic i the half-lae {s : Re s > σ c }. Proof. Sice each term i the series is aalytic ad the series coverges uiformly i each U for each give δ with s 0 σ c + it 0 secified above, by Weierstrass Theorem, fs is aalytic i U. The regio U is U {s : arg s s 0 < π δ} {s σ + it : σ > σ c}, so fs is aalytic i the required half-lae. For a ower series, there is a sigularity o its circle of covergece. For a Dirichlet series, the aalogue oly holds if each coefficiet is o-egative. Theorem 5.8 Ladau s theorem. Suose that fs is a Dirichlet series with 0 for each, ad that the abscissa of covergece σ c is fiite. The fs has a sigularity at s σ c. 6

17 Proof. Suose that, i fact, fs is aalytic at s σ c. The there exists a δ > 0 such that fs is aalytic i D : {s : s σ c < δ}. Now let σ 0 be a oit o the real axis such that σ 0 > σ c ad such that D : {s : s σ 0 < ɛ} for some ɛ > 0 is totally cotaied i D, with some oits i D o the real axis less tha σ c. Hece fs is aalytic i D ad we may exad fs about σ 0 to get f σ 0 fs s σ 0.! We also have 0 fs ad sice this is uiformly coverget i the regio cocered, we may differetiate term by term ad obtai f log σ 0 σ, 0 ad substitutig ito the ower series exasio, we get fs σ 0 s 0! log σ. 0 Now tae s real, σ 0 ɛ < s σ < σ 0, so that σ 0 s σ 0 σ > 0: fσ σ 0 σ 0 σ 0! log σ 0 σ 0 σ log 0! chagig order of summatioice every term is ositive σ 0 exσ 0 σ log σ 0 σ. σ σ 0 Hece fs coverges for all σ o the secified iterval. But for some σ i the secified iterval, σ < σ c. This cotradicts the fact that σ c was the abscissa of covergece. Theorem 5.9. Give a Dirichlet series fs s, set S a. If S O β for some β > 0, the the abscissa of covergece σ c for fs is less tha or equal to β. 7

18 Proof. Suose M > N. We the have s M M N M N M N M N M N M N N S S S M N S S SN + s N s + SM M + s + SN S s dx xs+ N s + SM M + s + M+ s N Sx SN dx xs+ N s + SM M + s sice Sx S for x [, + Sx SN dx xs+ N s + SM M + s + O M+ O s dx N xσ+ β N σ β + O M σ β O s M + β σ N β σ + ON β σ + OM β σ σ β which, if σ > β, aroaches zero as N, as required. sice by assumtio S O β Lemma 5.0 Euler-Maclauri formula. Suose fx is a fuctio that is cotiuous ad differetiable for x m, where, m are ositive itegers. The Proof. m m m f f x x x dx + f + fm f x x dx + m fx dx + m f x x x dx. 8

19 [ m [ m m + xf x dx ] m + f + f f + m f m f m m m + m f x dx + fx dx fm f fx dx fx dx f fm f fx dx fm + f, m ] + m f x dx f + f fm f where at we have used itegratio by arts o the exressio iquare bracets. We reviously defied the Riema zeta fuctio for real s > as ζs By Theorem 5., we ow ow that the series for ζs coverges absolutely for all s σ + it with σ >. Theorem 5.. The Riema zeta fuctio, as defied above for σ >, ca be exteded aalytically to a aalytic fuctio i the half lae σ > 0, excet for a simle ole at s with residue. Proof. We aly the Euler-Maclauri formula above with fx x s where s. We get m s s + m s + m x s dx s. m x s x x dx. Sice x x <, the last itegral above gives m x s x x m dx O O σ O σ σ x σ dx σ, m σ so if σ > 0, this coverges absolutely ad uiformly as m. So let m i to obtai s s + x s dx s 9 x s x x dx

20 Lettig, we get ζs s s s s + s s x s x x dx. x s x x dx. Sice the last itegral coverges uiformly, by Weierstrass theorem it is a aalytic fuctio for σ > 0. Thus we have exteded ζs to σ > 0, ad it is clear that ζs, so exteded, has a simle ole at s with residue. To fiish this sectio, we shall rove a theorem for the multilicatio of two Dirichlet series, which will be eeded for our fial roof of the Dirichlet s theorem. Theorem 5. Multilicatio theorem for Dirichlet series. Give two Dirichlet series b fs gs that coverge absolutely for σ > σ 0, the we have for σ > σ 0, c fsgs where c j ajb j ab. Proof. For σ > σ 0, by assumtio the two series fs ad gs coverge absolutely. Hece multilyig the series ad rearragig the terms, aj b ajb fsgs j s s j s. Lettig j, 6 Dirichlet L-series fsgs j ajb j Defiitio 6.. The Dirichlet L-series is defied to be χ Ls, χ. Sice χ, for real σ, χ σ σ, so by Theorem 5., the series coverges absolutely for s with σ >. Firstly, we cosider the series for o-ricial characters. 0 c.

21 Theorem 6.. If χ χ, the the series for Ls, χ has abscissa of covergece σ c 0. Proof. Sice χ χ, by the roerties of Dirichlet characters Theorem 4.3, we have χ 0. Hece y χ for ay ositive iteger y. So the differece of artial sums yields y χ y x s χ x x x σ which goes to 0 as x if σ > 0. So the series has abscissa of covergece at most 0 by Theorem 5.5. But if σ < 0, each term i the series does ot ted to 0, so the series diverges for σ < 0. By Theorem 5.5 agai, the abscissa of covergece is recisely 0. Recall that the Dirichlet characters are comletely multilicative fuctios. So for σ >, we may aly Corollary 3.3 the Euler Product to write the Dirichlet L-series as Ls, χ χ s. rime Let us ow tur our attetio to the L-series for the ricial character χ : Theorem 6.3. Ls, χ is a aalytic fuctio for σ > 0, excet for a simle ole at s with residue ϕ/. Proof. Recallig that χ if gcd, ad χ 0 otherwise, Ls, χ χ s rime χ s s χ s s s ζs s. The secod factor above has fiitely may terms ad each term is aalytic, so the whole factor is aalytic. By Theorem 5., ζs has a simle ole at s with residue, so Ls, χ has a simle ole at s with residue, which is equal to ϕ by Theorem.8.

22 We are ow ready to rove the Dirichlet theorem. We follow Euler s idea for the divergece of the sum of the recirocals of rimes see roof of 3.5. For us, this ivolves the logarithm of the L-series, which is comlex-valued i geeral. We choose the brach such that for s real ad σ >, log Ls, χ is real. For σ >, usig the Euler roduct for Ls, χ, log Ls, χ log χ s log χ s χ s sice χ s < χ s + Rs where Rs χ. Now s Rs sice ζσ is bouded at σ. σ σ σ σ σ σ ζσ < as s + σ We retur to cosiderig the first sum i. We isolate the terms i the first sum where a mod. Sice a ad are corime, we ca fid b such that ab mod. Now multily by χb ad sum over all characters to get χb log Ls, χ χ χ χb χ s + χ s χb + R s χ : b mod ϕ : amod χbrs s ϕ + R s s + R s where R s : χ χbrs I the above, R s is bouded as s + sice Rs is. Each summad where χ χ o the left is bouded as s +, sice by Theorem 6., Ls, χ is aalytic as s +. The summad where χ χ goes to ifiity as s + by Theorem 6.3. Thus if each of L, χ 0 for χ χ, we would ot have a situatio o the left had side The the left had side would go to ifiity as

23 s +, so also would the right had side. Sice R s would remai bouded, we would obtai as s +, i.e. the series : amod : amod s diverges. This would show that there are ifiitely may rimes such that a mod, i.e. there are ifiitely may rimes i the arithmetic rogressio a, a +, a +,.... So let us show that L, χ 0 for χ χ : we show that this is the case searately for comlex ad real characters. Theorem 6.4. L, χ 0 for comlex characters χ χ. Proof. Let the characters cosidered be modulo. Cosider P σ χ Lσ, χ, which for σ > gives log P σ χ χ log Lσ, χ log χ σ usig the Euler roduct for Ls, χ χ 0, χ σ σ χ mod χ ϕ σ by 4.3 vi so lim if σ P σ. Suose that there is a χ such that L, χ 0. The L, χ L, χ 0, where χ is the cojugate character χχ χ, ot equal to χ sice χ χ. Also, Ls, χ has a ole at s by 6.3. So the roduct P of all the characters at s is zero, sice the oe sigle ole does ot cacel the two zeroes or ay other ossible zeroes. This cotradicts. Hece L, χ 0. Theorem 6.5. L, χ 0 for real characters χ χ. 3

24 Proof. Let the characters cosidered be modulo. Cosider the fuctio f d χd, which is multilicative as it is the Dirichlet covolutio of two multilicative fuctios, χ ad. Write α... α ad cosider the values of the fuctio at owers of these rimes. Set If i, the If i ad α i is odd, the If i ad α i is eve, the ψi α i m0 χ m i. ψi + χ i + χ i + + χ i α i α i ψi l+ 0 ψi l Thus f 0 for all. If m is a square, the each α i is eve, so fm. Thus F σ : f σ m ζσ mσ so F σ diverges at σ /. Hece the abscissa of covergece σ c /. Sice f 0 we may aly Ladau s theorem Theorem 5.8 to coclude that F s must have a sigularity at s σ c /. But for σ >, Ls, χ ad ζs coverge absolutely, so by Theorem 5., we have Ls, χζs m χm m s χd F s. Both Ls, χ ad ζs are aalytic for σ > 0 excet for the simle ole at s for ζs. If L, χ 0, the F s would be aalytic for σ > 0, ad thus caot have a sigularity at s σ c /. This is a cotradictio, so L, χ 0. f Havig established that L, χ 0 for χ χ, we have ow roved Dirichlet s theorem. d 4

25 7 Fial words After Dirichlet s theorem, more geeralisatios about rimes i arithmetic rogressios were made. We state some results obtaied by later mathematicias: Theorem 7. Lii 944. Suose that a ad d are corime, ad that a < d. Let a, d be the smallest rime i the arithmetic rogressio a + d. The there exist ositive costats c ad L such that a, d < cd L. Aother atural questio to as is: if each such arithmetic rogressio cotais ifiitely may rimes, what about cosecutive terms i the rogressio? How may cosecutive oes ca be rime? As a examle, it was foud that is rime for 0,,...,. It has aaretly bee roved i 004 by Gree ad Tao that there ca be arbitrarily cosecutively may, which has widely bee believed to be true for a log time. Theorem 7. Gree & Tao 004. The rime umbers cotai ifiitely may arithmetic rogressios of legth for all. A eve more rigid tye is cosecutive rimes i a arithmetic rogressio, that is, every umber i betwee the rimes is comosite. For examle, is such a sequece, for 0,,..., These geeralisatios show that eve though the umber of rimes thi out as the umbers grow larger, rime umbers are quite dese i the itegers. The famous rime umber theorem, roved i 896, describes the aroximate asymtotic distributio of rime umbers. It states that πx x log x, where πx is the umber of rimes ot exceedig x, ad ax bx meas lim x ax/bx. 5

Notes on the prime number theorem

Notes on the prime number theorem Notes o the rime umber theorem Keji Kozai May 2, 24 Statemet We begi with a defiitio. Defiitio.. We say that f(x) ad g(x) are asymtotic as x, writte f g, if lim x f(x) g(x) =. The rime umber theorem tells

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

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

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

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

PRIME RECIPROCALS AND PRIMES IN ARITHMETIC PROGRESSION

PRIME RECIPROCALS AND PRIMES IN ARITHMETIC PROGRESSION PRIME RECIPROCALS AND PRIMES IN ARITHMETIC PROGRESSION DANIEL LITT Abstract. This aer is a exository accout of some (very elemetary) argumets o sums of rime recirocals; though the statemets i Proositios

More information

Solutions to Problem Sheet 1

Solutions to Problem Sheet 1 Solutios to Problem Sheet ) Use Theorem. to rove that loglog for all real 3. This is a versio of Theorem. with the iteger N relaced by the real. Hit Give 3 let N = [], the largest iteger. The, imortatly,

More information

Final Solutions. 1. (25pts) Define the following terms. Be as precise as you can.

Final Solutions. 1. (25pts) Define the following terms. Be as precise as you can. Mathematics H104 A. Ogus Fall, 004 Fial Solutios 1. (5ts) Defie the followig terms. Be as recise as you ca. (a) (3ts) A ucoutable set. A ucoutable set is a set which ca ot be ut ito bijectio with a fiite

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

DIRICHLET CHARACTERS AND PRIMES IN ARITHMETIC PROGRESSIONS

DIRICHLET CHARACTERS AND PRIMES IN ARITHMETIC PROGRESSIONS DIRICHLET CHARACTERS AND PRIMES IN ARITHMETIC PROGRESSIONS We la to rove the followig Theore (Dirichlet s Theore) Let (a, k) = The the arithetic rogressio cotais ifiitely ay ries a + k : = 0,, 2, } = :

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

PERIODS OF FIBONACCI SEQUENCES MODULO m. 1. Preliminaries Definition 1. A generalized Fibonacci sequence is an infinite complex sequence (g n ) n Z

PERIODS OF FIBONACCI SEQUENCES MODULO m. 1. Preliminaries Definition 1. A generalized Fibonacci sequence is an infinite complex sequence (g n ) n Z PERIODS OF FIBONACCI SEQUENCES MODULO m ARUDRA BURRA Abstract. We show that the Fiboacci sequece modulo m eriodic for all m, ad study the eriod i terms of the modulus.. Prelimiaries Defiitio. A geeralized

More information

PROBLEM SET 5 SOLUTIONS. Solution. We prove that the given congruence equation has no solutions. Suppose for contradiction that. (x 2) 2 1 (mod 7).

PROBLEM SET 5 SOLUTIONS. Solution. We prove that the given congruence equation has no solutions. Suppose for contradiction that. (x 2) 2 1 (mod 7). PROBLEM SET 5 SOLUTIONS 1 Fid every iteger solutio to x 17x 5 0 mod 45 Solutio We rove that the give cogruece equatio has o solutios Suose for cotradictio that the equatio x 17x 5 0 mod 45 has a solutio

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

Solutions to Problem Set 7

Solutions to Problem Set 7 8.78 Solutios to Problem Set 7. If the umber is i S, we re doe sice it s relatively rime to everythig. So suose S. Break u the remaiig elemets ito airs {, }, {4, 5},..., {, + }. By the Pigeohole Pricile,

More information

THE INTEGRAL TEST AND ESTIMATES OF SUMS

THE INTEGRAL TEST AND ESTIMATES OF SUMS THE INTEGRAL TEST AND ESTIMATES OF SUMS. Itroductio Determiig the exact sum of a series is i geeral ot a easy task. I the case of the geometric series ad the telescoig series it was ossible to fid a simle

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

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

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

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

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

ON SUPERSINGULAR ELLIPTIC CURVES AND HYPERGEOMETRIC FUNCTIONS

ON SUPERSINGULAR ELLIPTIC CURVES AND HYPERGEOMETRIC FUNCTIONS ON SUPERSINGULAR ELLIPTIC CURVES AND HYPERGEOMETRIC FUNCTIONS KEENAN MONKS Abstract The Legedre Family of ellitic curves has the remarkable roerty that both its eriods ad its suersigular locus have descritios

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

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

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

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

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

lim za n n = z lim a n n.

lim za n n = z lim a n n. Lecture 6 Sequeces ad Series Defiitio 1 By a sequece i a set A, we mea a mappig f : N A. It is customary to deote a sequece f by {s } where, s := f(). A sequece {z } of (complex) umbers is said to be coverget

More information

Weil Conjecture I. Yichao Tian. Morningside Center of Mathematics, AMSS, CAS

Weil Conjecture I. Yichao Tian. Morningside Center of Mathematics, AMSS, CAS Weil Cojecture I Yichao Tia Morigside Ceter of Mathematics, AMSS, CAS [This is the sketch of otes of the lecture Weil Cojecture I give by Yichao Tia at MSC, Tsighua Uiversity, o August 4th, 20. Yuaqig

More information

A Note on Bilharz s Example Regarding Nonexistence of Natural Density

A Note on Bilharz s Example Regarding Nonexistence of Natural Density Iteratioal Mathematical Forum, Vol. 7, 0, o. 38, 877-884 A Note o Bilharz s Examle Regardig Noexistece of Natural Desity Cherg-tiao Perg Deartmet of Mathematics Norfolk State Uiversity 700 Park Aveue,

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

Almost all hyperharmonic numbers are not integers

Almost all hyperharmonic numbers are not integers Joural of Number Theory 7 (207) 495 526 Cotets lists available at ScieceDirect Joural of Number Theory www.elsevier.com/locate/jt Almost all hyerharmoic umbers are ot itegers Haydar Göral a, Doğa Ca Sertbaş

More information

Chapter 2. Finite Fields (Chapter 3 in the text)

Chapter 2. Finite Fields (Chapter 3 in the text) Chater 2. Fiite Fields (Chater 3 i the tet 1. Grou Structures 2. Costructios of Fiite Fields GF(2 ad GF( 3. Basic Theory of Fiite Fields 4. The Miimal Polyomials 5. Trace Fuctios 6. Subfields 1. Grou Structures

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

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

7 Sequences of real numbers

7 Sequences of real numbers 40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are

More information

Sequences and Series of Functions

Sequences and Series of Functions Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges

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

1. C only. 3. none of them. 4. B only. 5. B and C. 6. all of them. 7. A and C. 8. A and B correct

1. C only. 3. none of them. 4. B only. 5. B and C. 6. all of them. 7. A and C. 8. A and B correct M408D (54690/54695/54700), Midterm # Solutios Note: Solutios to the multile-choice questios for each sectio are listed below. Due to radomizatio betwee sectios, exlaatios to a versio of each of the multile-choice

More information

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f

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

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014. Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the

More information

LECTURES 5 AND 6: CONVERGENCE TESTS

LECTURES 5 AND 6: CONVERGENCE TESTS LECTURES 5 AND 6: CONVERGENCE TESTS I the previous lecture we saw a very basic test for covergece - the compariso test. Here we develop slightly more sophisticated machiery for determiig the covergece

More information

Math 341 Lecture #31 6.5: Power Series

Math 341 Lecture #31 6.5: Power Series Math 341 Lecture #31 6.5: Power Series We ow tur our attetio to a particular kid of series of fuctios, amely, power series, f(x = a x = a 0 + a 1 x + a 2 x 2 + where a R for all N. I terms of a series

More information

MATH 304: MIDTERM EXAM SOLUTIONS

MATH 304: MIDTERM EXAM SOLUTIONS MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest

More information

Chapter 8. Euler s Gamma function

Chapter 8. Euler s Gamma function Chapter 8 Euler s Gamma fuctio The Gamma fuctio plays a importat role i the fuctioal equatio for ζ(s) that we will derive i the ext chapter. I the preset chapter we have collected some properties of the

More information

Math 113, Calculus II Winter 2007 Final Exam Solutions

Math 113, Calculus II Winter 2007 Final Exam Solutions Math, Calculus II Witer 7 Fial Exam Solutios (5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute x x + dx The check your aswer usig the Evaluatio Theorem Solutio: I this

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 8. Euler s Gamma function

Chapter 8. Euler s Gamma function Chapter 8 Euler s Gamma fuctio The Gamma fuctio plays a importat role i the fuctioal equatio for ζ(s that we will derive i the ext chapter. I the preset chapter we have collected some properties of the

More information

Chapter 6 Overview: Sequences and Numerical Series. For the purposes of AP, this topic is broken into four basic subtopics:

Chapter 6 Overview: Sequences and Numerical Series. For the purposes of AP, this topic is broken into four basic subtopics: Chapter 6 Overview: Sequeces ad Numerical Series I most texts, the topic of sequeces ad series appears, at first, to be a side topic. There are almost o derivatives or itegrals (which is what most studets

More information

PRELIM PROBLEM SOLUTIONS

PRELIM PROBLEM SOLUTIONS PRELIM PROBLEM SOLUTIONS THE GRAD STUDENTS + KEN Cotets. Complex Aalysis Practice Problems 2. 2. Real Aalysis Practice Problems 2. 4 3. Algebra Practice Problems 2. 8. Complex Aalysis Practice Problems

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

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

f(x)g(x) dx is an inner product on D.

f(x)g(x) dx is an inner product on D. Ark9: Exercises for MAT2400 Fourier series The exercises o this sheet cover the sectios 4.9 to 4.13. They are iteded for the groups o Thursday, April 12 ad Friday, March 30 ad April 13. NB: No group o

More information

ECE534, Spring 2018: Final Exam

ECE534, Spring 2018: Final Exam ECE534, Srig 2018: Fial Exam Problem 1 Let X N (0, 1) ad Y N (0, 1) be ideedet radom variables. variables V = X + Y ad W = X 2Y. Defie the radom (a) Are V, W joitly Gaussia? Justify your aswer. (b) Comute

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

Chapter 7: Numerical Series

Chapter 7: Numerical Series Chapter 7: Numerical Series Chapter 7 Overview: Sequeces ad Numerical Series I most texts, the topic of sequeces ad series appears, at first, to be a side topic. There are almost o derivatives or itegrals

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

The Riemann Zeta Function

The Riemann Zeta Function Physics 6A Witer 6 The Riema Zeta Fuctio I this ote, I will sketch some of the mai properties of the Riema zeta fuctio, ζ(x). For x >, we defie ζ(x) =, x >. () x = For x, this sum diverges. However, we

More information

PAPER : IIT-JAM 2010

PAPER : IIT-JAM 2010 MATHEMATICS-MA (CODE A) Q.-Q.5: Oly oe optio is correct for each questio. Each questio carries (+6) marks for correct aswer ad ( ) marks for icorrect aswer.. Which of the followig coditios does NOT esure

More information

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer. 6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio

More information

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at

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

Putnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers)

Putnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers) Putam Traiig Exercise Coutig, Probability, Pigeohole Pricile (Aswers) November 24th, 2015 1. Fid the umber of iteger o-egative solutios to the followig Diohatie equatio: x 1 + x 2 + x 3 + x 4 + x 5 = 17.

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

Chapter 4. Fourier Series

Chapter 4. Fourier Series Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,

More information

Archimedes - numbers for counting, otherwise lengths, areas, etc. Kepler - geometry for planetary motion

Archimedes - numbers for counting, otherwise lengths, areas, etc. Kepler - geometry for planetary motion Topics i Aalysis 3460:589 Summer 007 Itroductio Ree descartes - aalysis (breaig dow) ad sythesis Sciece as models of ature : explaatory, parsimoious, predictive Most predictios require umerical values,

More information

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n = 60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece

More information

Mathematical Methods for Physics and Engineering

Mathematical Methods for Physics and Engineering Mathematical Methods for Physics ad Egieerig Lecture otes Sergei V. Shabaov Departmet of Mathematics, Uiversity of Florida, Gaiesville, FL 326 USA CHAPTER The theory of covergece. Numerical sequeces..

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

Math 181, Solutions to Review for Exam #2 Question 1: True/False. Determine whether the following statements about a series are True or False.

Math 181, Solutions to Review for Exam #2 Question 1: True/False. Determine whether the following statements about a series are True or False. Math 8, Solutios to Review for Exam #2 Questio : True/False. Determie whether the followig statemets about a series are True or False. X. The series a diverges if lim s 5.! False: The series coverges to

More information

Classification of DT signals

Classification of DT signals Comlex exoetial A discrete time sigal may be comlex valued I digital commuicatios comlex sigals arise aturally A comlex sigal may be rereseted i two forms: jarg { z( ) } { } z ( ) = Re { z ( )} + jim {

More information

A Reformulation of Dirichlet s Primes in Arithmetic Progression

A Reformulation of Dirichlet s Primes in Arithmetic Progression A Reformulatio of Dirichlet s Primes i Arithmetic Progressio Mireille Schitzer Setemer, 2005 Astract This aer resets a reformulatio of Dirichlet s theorem o Primes i Arithmetic Progressios, which states

More information

Fourier Analysis, Stein and Shakarchi Chapter 8 Dirichlet s Theorem

Fourier Analysis, Stein and Shakarchi Chapter 8 Dirichlet s Theorem 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

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

Advanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology

Advanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology Advaced Aalysis Mi Ya Departmet of Mathematics Hog Kog Uiversity of Sciece ad Techology September 3, 009 Cotets Limit ad Cotiuity 7 Limit of Sequece 8 Defiitio 8 Property 3 3 Ifiity ad Ifiitesimal 8 4

More information

TR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT

TR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT TR/46 OCTOBER 974 THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION by A. TALBOT .. Itroductio. A problem i approximatio theory o which I have recetly worked [] required for its solutio a proof that the

More information

Zeros of Polynomials

Zeros of Polynomials Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree

More information

Fall 2013 MTH431/531 Real analysis Section Notes

Fall 2013 MTH431/531 Real analysis Section Notes Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters

More information

CHAPTER 10 INFINITE SEQUENCES AND SERIES

CHAPTER 10 INFINITE SEQUENCES AND SERIES CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece

More information

Physics 116A Solutions to Homework Set #1 Winter Boas, problem Use equation 1.8 to find a fraction describing

Physics 116A Solutions to Homework Set #1 Winter Boas, problem Use equation 1.8 to find a fraction describing Physics 6A Solutios to Homework Set # Witer 0. Boas, problem. 8 Use equatio.8 to fid a fractio describig 0.694444444... Start with the formula S = a, ad otice that we ca remove ay umber of r fiite decimals

More information

ECE534, Spring 2018: Solutions for Problem Set #2

ECE534, Spring 2018: Solutions for Problem Set #2 ECE534, Srig 08: s for roblem Set #. Rademacher Radom Variables ad Symmetrizatio a) Let X be a Rademacher radom variable, i.e., X = ±) = /. Show that E e λx e λ /. E e λx = e λ + e λ = + k= k=0 λ k k k!

More information

Chapter 10: Power Series

Chapter 10: Power Series Chapter : Power Series 57 Chapter Overview: Power Series The reaso series are part of a Calculus course is that there are fuctios which caot be itegrated. All power series, though, ca be itegrated because

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

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

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i

More information

YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE

YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPSC 467a: Crytograhy ad Comuter Security Notes 16 (rev. 1 Professor M. J. Fischer November 3, 2008 68 Legedre Symbol Lecture Notes 16 ( Let be a odd rime,

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

21. Primes in arithmetic progressions

21. Primes in arithmetic progressions 2. Primes i arithmetic progressios 2. Euler s theorem ad the zeta fuctio 2.2 Dirichlet s theorem 2.3 Dual groups of abelia groups 2.4 No-vaishig o Re(s) = 2.5 Aalytic cotiuatios 2.6 Dirichlet series with

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

Primes in arithmetic progressions

Primes in arithmetic progressions (April 2, 20) Primes i arithmetic progressios Paul Garrett garrett@math.um.edu http://www.math.um.edu/ garrett/. Dirichlet s theorem 2. Dual groups of abelia groups 3. Ugly proof of o-vaishig o Re(s) =

More information

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck! Uiversity of Colorado Dever Dept. Math. & Stat. Scieces Applied Aalysis Prelimiary Exam 13 Jauary 01, 10:00 am :00 pm Name: The proctor will let you read the followig coditios before the exam begis, ad

More information

MA131 - Analysis 1. Workbook 2 Sequences I

MA131 - Analysis 1. Workbook 2 Sequences I MA3 - Aalysis Workbook 2 Sequeces I Autum 203 Cotets 2 Sequeces I 2. Itroductio.............................. 2.2 Icreasig ad Decreasig Sequeces................ 2 2.3 Bouded Sequeces..........................

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

Lecture 1. January 8, 2018

Lecture 1. January 8, 2018 Lecture 1 Jauary 8, 018 1 Primes A prime umber p is a positive iteger which caot be writte as ab for some positive itegers a, b > 1. A prime p also have the property that if p ab, the p a or p b. This

More information

[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.

[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms. [ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural

More information

INFINITE SEQUENCES AND SERIES

INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES I geeral, it is difficult to fid the exact sum of a series. We were able to accomplish this for geometric series ad the series /[(+)]. This is

More information

Chapter 6: Numerical Series

Chapter 6: Numerical Series Chapter 6: Numerical Series 327 Chapter 6 Overview: Sequeces ad Numerical Series I most texts, the topic of sequeces ad series appears, at first, to be a side topic. There are almost o derivatives or itegrals

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