BOUNDED GAPS BETWEEN PRIMES


 Sydney Gardner
 2 years ago
 Views:
Transcription
1 BOUNDED GAPS BETWEEN PRIMES ANDREW GRANVILLE Abstract. Recetly, Yitag Zhag proved the existece of a fiite boud B such that there are ifiitely may pairs p, p of cosecutive primes for which p p B. This ca be see as a massive breakthrough o the subject of twi primes ad other delicate questios about prime umbers that had previously seemed itractable. I this article we will discuss Zhag s extraordiary work, puttig it i its cotext i aalytic umber theory, ad sketch a proof of his theorem. Zhag eve proved the result with B A cooperative team, polymath8, collaboratig oly olie, has bee able to lower the value of B to 4680, ad it seems plausible that these techiques ca be pushed somewhat further, though the limit of these methods seem, for ow, to be B 2. Cotets. Itroductio 2 2. The distributio of primes, divisors ad prime ktuplets 8 3. Uiformity i arithmetic progressios 5 4. GoldstoPitzYıldırım s argumet Distributio i arithmetic progressios Prelimiary reductios Complete expoetial sums Icomplete expoetial sums The Grad Fiale Weaker hypotheses Mathematics Subject Classificatio. P32. To Yiliag Zhag, for showig that oe ca, o matter what.
2 2 ANDREW GRANVILLE sec:itro. Itroductio.. Itriguig questios about primes. Early o i our mathematical educatio we get used to the two basic rules of arithmetic, additio ad multiplicatio. Whe we defie a prime umber, simply i terms of the umber s multiplicative properties, we discover a strage ad magical sequece of umbers. O the oe had, so easily defied, o the other, so difficult to get a firm grasp of, sice they are defied i terms of what they are ot (i.e. that they caot be factored ito two smaller itegers)). Whe oe writes dow the sequece of prime umbers: 2, 3, 5, 7,, 3, 7, 9, 23, 29, 3, 37, 4, 43, 47, 53, 59, 6,... oe sees that they occur frequetly, but it took a rather clever costructio of the aciet Greeks to eve establish that there really are ifiitely may. Lookig further at a list of primes, some patters begi to emerge; for example, oe sees that they ofte come i pairs: 3 ad 5, 5 ad 7, ad 3, 7 ad 9, 29 ad 3, 4 ad 43, 59 ad 6,... Oe might guess that there are ifiitely may such prime pairs. But this is a ope, elusive questio, the twi prime cojecture. Util recetly there was little theoretical evidece for it. All that oe could say is that there was a eormous amout of computatioal evidece that these pairs ever quit; ad that this cojecture (ad various more refied versios) fit ito a eormous etwork of cojecture, which build a beautiful elegat structure of all sorts of prime patters; ad if the twi prime cojecture were to be false the the whole edifice would crumble. The twi prime cojecture is certaily itriguig to both amateur ad professioal mathematicias alike, though oe might argue that it is a artificial questio, sice it asks for a very delicate additive property of a sequece defied by its multiplicative properties. Ideed, umber theorists had struggled, util very recetly, to idetify a approach to this questio that seemed likely to make ay sigificat headway. I this article we will discuss these latest shockig developmets. I the first few sectios we will take a leisurely stroll through the historical ad mathematical backgroud, so as to give the reader a sese of the great theorem that has bee recetly proved, ad also from a perspective that will prepare the reader for the details of the proof..2. Other patters. Lookig at the list of primes above we see other patters that begi to emerge, for example, oe ca fid four primes which have all the same digits, except the last oe:, 3, 7 ad 9, which is repeated with 0, 03, 07 ad 09, ad oe ca fid may more such examples are there ifiitely may? More simply how about prime pairs with differece 4, 3 ad 7, 7 ad, 3 ad 7, 9 ad 23, 37 ad 4, 43 ad 47, 67 ad 7,... ; or differece 0, 3 ad 3, 7 ad 7, 3 ad 23, 9 ad 29, 3 ad 4, 37 ad 47, 43 ad 53,...?
3 BOUNDED GAPS BETWEEN PRIMES 3 Are there ifiitely may such pairs? Such questios were probably asked back to atiquity, but the first clear metio of twi primes i the literature appears i a paper of de Poligac from 849. I his hoour we ow call ay iteger h, for which there are ifiitely may prime pairs p, p h, a de Poligac umber. The there are the Sophie Germai pairs, primes p ad q : 2p, which prove useful i several simple algebraic costructios: 2 2 ad 5, 3 ad 7, 5 ad, ad 23, 23 ad 47, 29 ad 59, 4 ad 83,... ; Now we have spotted all sorts of patters, we eed to ask ourselves whether there is a way of predictig which patters ca occur ad which do ot. Let s start by lookig at the possible differeces betwee primes: It is obvious that there are ot ifiitely may prime pairs of differece, because oe of ay two cosecutive itegers must be eve, ad hece ca oly be prime if it equals 2. Thus there is just the oe pair, 2 ad 3, of primes with differece. Oe ca make a similar argumet for prime pairs with odd differece. Hece if h is a iteger for which there are ifiitely may prime pairs of the form p, q p h the h must be eve. We have see may examples, above, for each of h 2, h 4 ad h 0, ad the reader ca similarly costruct lists of examples for h 6 ad for h 8, ad ideed for ay other eve h that takes her or his facy. This leads us to bet o the geeralized twi prime cojecture, which states that for ay eve iteger 2k there are ifiitely may prime pairs p, q p 2k. What about prime triples? or quadruples? We saw two examples of prime quadruples of the form 0, 0 3, 0 7, 0 9, ad believe that there are ifiitely may. What about other patters? Evidetly ay patter that icludes a odd differece caot succeed. Are there ay other obstructios? The simplest patter that avoids a odd differece is, 2, 4. Oe fids the oe example 3, 5, 7 of such a prime triple, but o others. Further examiatio makes it clear why ot: Oe of the three umbers is always divisible by 3. This is very similar to what happeed with, ; ad oe ca verify that, similarly, oe of, 6, 2, 8, 24 is always divisible by 5. The geeral obstructio ca be described as follows: For a give set of distict itegers a a 2... a k we say that prime p is a obstructio if p divides at least oe of a,..., a k, for every iteger. I other words, p divides Ppq p a qp a 2 q... p a k q for every iteger ; which ca be classified by the coditio that the set a, a 2,..., a k pmod pq icludes all of the residue classes mod p. If o prime is a obstructio the we say that x a,..., x a k is a admissible set of forms. 3. Pitz makes a slightly defiitio: That is, that p ad p h should be cosecutive primes. 2 These are useful because, i this case, the group of reduced residues mod q is a cyclic group of order q 2p, ad therefore isomorphic to C 2 C p if p 2. Therefore every elemet i the group has order (that is, ), 2 (that is, ), p (the squares mod q) or 2p q. Hece g geerates the group of reduced residues if ad oly if g is ot a square mod q ad g. 3 Notice that a, a 2,..., a k pmod pq ca occupy o more tha k residue classes mod p ad so, if p k the p caot be a obstructio.
4 4 ANDREW GRANVILLE Number theorists have log made the optimistic cojecture if there is o such obvious obstructio to a set of liear forms beig ifiitely ofte prime, the they are ifiitely ofte simultaeously prime. That is: Cojecture: If x a,..., x a k is a admissible set of forms the there are ifiitely may itegers such that a,..., a k are all prime umbers. I this case, we call a,..., a k a ktuple of prime umbers. To date, this has ot bee prove for ay k though, followig Zhag s work, we are startig to get close for k 2. Ideed, Zhag proves a weak variat of this cojecture, as we shall see. The above cojecture ca be exteded, as is, to all sets of k liear forms with iteger coefficiets i oe variable, so log as we exted the otio of admissibility to also exclude the obstructio that two of the liear forms have differet sigs for all, but fiitely may,, sice a egative iteger caot be prime (for example, ad 2 ); some people call this the obstructio at the prime,. We ca also exted the cojecture to more tha oe variable (for example the set of forms m, m, m 4): The prime ktuplets cojecture: If a set of k liear forms i variables is admissible the there are ifiitely may sets of itegers such that whe we substitute these itegers ito the forms we get a ktuple of prime umbers. There has bee substatial recet progress o this cojecture. The famous breakthrough was Gree ad Tao s theorem for the ktuple of liear forms i the two variables a ad d: a, a d, a 2d,..., a pk qd. Alog with Ziegler, they wet o to prove the prime ktuplets cojecture for ay admissible set of liear forms, provided o two satisfy a liear equatio over the itegers. What a remarkable theorem! Ufortuately these exceptios iclude may of the questios we are most iterested i; for example, p, q p 2 satisfy the liear equatio q p 2; ad p, q 2p satisfy the liear equatio q 2p ). Fially, we also believe that the cojecture holds if we cosider ay admissible set of k irreducible polyomials with iteger coefficiets, with ay umber of variables. For example we believe that 2 is ifiitely ofte prime, ad that there are ifiitely may prime triples m,, m We will ed this sectio by statig Zhag s mai theorem ad a few of the more beguilig cosequeces: Zhag s mai theorem: There exists a iteger k such that the followig is true: If x a,..., x a k is a admissible set of forms the there are ifiitely may itegers such that at least two of a,..., a k are prime umbers.
5 BOUNDED GAPS BETWEEN PRIMES 5 Note that the result states that oly two of the a i are prime, ot all (as would be required i the prime ktuplets cojecture). Zhag proved this result for a fairly large value of k, that is k , which has bee reduced to k 632 by the polymath8 team. Of course if oe could take k 2 the we would have the twi prime cojecture, but the most optimistic pla at the momet, alog the lies of Zhag s proof, would yield k 5. To deduce that there are bouded gaps betwee primes from Zhag s Theorem we eed oly show the existece of a admissible set with k elemets. This is ot difficult, simply by lettig the a i be the first k primes k. 4 Hece we have proved: Corollary: [Bouded gaps betwee primes] There exists a boud B such that there are ifiitely may itegers pairs of prime umbers p q p B. Fidig the smallest B for a give k is a challegig questio. The prime umber theorem together with our costructio above suggests that B kplog k Cq for some costat C, but it is iterestig to get better bouds. Our Corollary further implies Corollary: There is a iteger h, 0 of primes p, p h. h B such that there are ifiitely may pairs That is, some positive iteger B is a de Poligac umber. I fact oe ca go a little further usig Zhag s mai theorem: Corollary: Let k be as i Zhag s Theorem, ad let A be ay admissible set of k itegers. There is a iteger h P pa Aq : ta b : a b P Au such that there are ifiitely may pairs of primes p, p h. Fially we ca deduce from this Corollary: A positive proportio of itegers are de Poligac umbers Proof. If A t0,..., Bu is a admissible set the ma : tma : a P Au is admissible for every iteger m. Give large x let M rx{bs. By Zhag s Theorem there exists a pair a m b m P A such that mpb m a m q is a de Polgac umber. Sice there are at most B{2 differeces d b a with a b P A there must be some differece which is the value of b m a m for at least 2M{B values of m M. This gives rise to 2M{B x{b 2 distict de Poligac umbers of the form md x. Our costructio above implies that the proportio is at least {k 2 plog k Cq 2. 4 This is admissible sice oe of the a i is 0 pmod pq for ay p k, ad the p k were hadled i the previous footote.
6 6 ANDREW GRANVILLE.3. The simplest aalytic approach. There are 4 odd primes up to 50, that is 4 out of the 25 odd itegers up to 50, so oe ca deduce that several pairs differ by 2. We might hope to take this kid of desity approach more geerally: If A is a sequece of itegers of desity {2 (i all of the itegers) the we ca easily deduce that there are may pairs of elemets of A that differ by o more tha 2. Oe might guess that there are pairs that differ by exactly 2, but this is by o meas guarateed, as the example A : t P Z : or 2 pmod 4qu shows. Moreover, to use this kid of reasoig to hut for twi primes, we presumably eed a lower boud o the desity of primes as oe looks at larger ad larger primes. This was somethig that itrigued the youg Gauss who, by examiig Cherik s table of primes up to oe millio, surmised that the desity of primes at aroud x is roughly { log x (ad this was subsequetly verified, as a cosequece of the prime umber theorem). Therefore we are guarateed that there are ifiitely may pairs of primes p q with q p log p, which is ot quite as small a gap as we are hopig for! Noetheless this raises the questio: Fix c 0. Ca we prove that There are ifiitely may pairs of primes p q with q p c log p? This follows for all c by the prime umber theorem, but it is ot easy to prove such a result for ay particular value of c. The first such results were proved coditioally assumig the Geeralized Riema Hypothesis. This is, i itself, surprisig: The Geeralized Riema Hypothesis was formulated to better uderstad the distributio of primes i arithmetic progressios, so why would it appear i a argumet about short gaps betwee primes? It is far from obvious by the argumet used, ad yet this coectio has deepeed ad broadeed as the literature developed. We will discuss primes i arithmetic progressios i detail i the ext sectio. The first ucoditioal (though iexplicit) such result, boudig gaps betwee primes, was proved by Erdős i 940 usig the small sieve (we will obtai ay c e γ by such a method i sectio 3.2 MaierTrick ). I 966, Bombieri ad Daveport [2] bomdav substituted the BombieriViogradov theorem for the Geeralized Riema Hypothesis i earlier, coditioal argumets, to prove this ucoditioally for ay c ; ad i 988 Maier maier 2 [25] observed that oe ca easily modify this to obtai ay c 2 e γ. The Bombieri Viogradov Theorem is also a result about primes i arithmetic progressios, as we will discuss later. Maier further improved this, by combiig the approaches of Erdős ad of Bombieri ad Daveport, to some boud a little smaller tha, with substatial 4 effort. The first big breakthrough occurred i 2005 whe Goldsto, Pitz ad Yildirim [5] gpy were able to show that there are ifiitely may pairs of primes p q with q p c log p, for ay give c 0. Ideed they exteded their methods to show that, for ay ɛ 0, there are ifiitely may pairs of primes p q for which q p plog pq {2 ɛ. It is their method which forms the basis of the discussio i this paper. Like Bombieri ad Daveport, they showed that oe ca could better uderstad small gaps betwee primes, by obtaiig strog estimates o primes i arithmetic progressios, as i the
7 BOUNDED GAPS BETWEEN PRIMES 7 BombieriViogradov Theorem. Eve more, if oe assumes a strog, but widely believed, cojecture about the equidistributio of primes i arithmetic progressios, which exteds the BombieriViogradov Theorem, the oe ca show that there are ifiitely may pairs of primes p q which differ by o more tha 6 (that is, p q p 6)! What a extraordiary statemet, ad oe that we will briefly discuss: We kow that if p q p 6 the q p 2, 4, 6, 8, 0, 2, 4 or 6, ad so at least oe of these differece occurs ifiitely ofte. That is, there exists a positive, eve iteger 2k 6 such that there are ifiitely pairs of primes p, p 2k. Very recetly this has bee refied further by James Mayard, improvig the upper boud to 2, by a variat of the origial argumet. After Goldsto, Pitz ad Yildirim, most of the experts tried ad failed to obtai eough of a improvemet of the BombieriViogradov Theorem to deduce the existece of some fiite boud B such that there are ifiitely may pairs of primes that differ by o more tha B. To improve the BombieriViogradov Theorem is o mea feat ad people have loged discussed barriers to obtaiig such improvemets. I fact a techique had bee developed by Fouvry [0], fouvry ad by Bombieri, Friedlader ad Iwaiec [3], bfi but these were either powerful eough or geeral eough to work i this circumstace. Eter Yitag Zhag, a ulikely figure to go so much further tha the experts, ad to fid exactly the right improvemet ad refiemet of the BombieriViogradov Theorem to establish the existece of the elusive boud B such that there are ifiitely may pairs of primes that differ by o more tha B. By all accouts, Zhag was a brilliat studet i Beijig from 978 to the mid80s, fiishig with a master s degree, ad the workig o the Jacobia cojecture for his Ph.D. at Purdue, graduatig i 992. He did ot proceed to a job i academia, workig i odd jobs, such as i a sadwich shop, at a motel ad as a delivery worker. Fially i 999 he got a job at the Uiversity of New Hampshire as a lecturer, with a high teachig load, workig with may of the less qualified udergraduate studets. From timetotime a lecturer devotes their eergy to workig o provig great results, but few have doe so with such aplomb as Zhag. Not oly did he prove a great result, but he did so by improvig techically o the experts, havig importat key ideas that they missed ad developig a highly igeious ad elegat costructio cocerig expoetial sums. The, so as ot to be rejected out of had, he wrote his difficult paper up i such a clear maer that it could ot be deied. Albert Eistei worked i a patet office, Yitag Zhag i a Subway sadwich shop; both foud time, despite the urelated calls o their time ad eergy, to thik the deepest thoughts i sciece. Moreover Zhag did so at the relatively advaced age of 50 (or more). Truly extraordiary.
8 8 ANDREW GRANVILLE 2. The distributio of primes, divisors ad prime ktuplets veheuristic 2.. The prime umber theorem. As we metioed i the previous sectio, Gauss observed, at the age of 6, that the desity of primes at aroud x is roughly { log x, which leads quite aturally to the cojecture that #tprimes p xu» x 2 dt log t x log x as x Ñ 8. (We use the symbol Apxq Bpxq for two fuctios A ad B of x, to mea that Apxq{Bpxq Ñ as x Ñ 8.) This was proved i 896, the prime umber theorem, ad the itegral provides a cosiderably more precise approximatio to the umber of primes x, tha x{ log x. However, this itegral is rather cumbersome to work with, ad so it is atural to istead weight each prime with log p; that is we work with θpxq : p prime px ad the prime umber theorem implies 5 that log p θpxq x as x Ñ 8. (2.) pt A sievig heuristic to guess at the prime umber theorem. How may itegers up to x have o prime factors y? If y? x the this couts ad all of the primes betwee y ad x, so a accurate aswer would yield the prime umber theorem. The usual heuristic is to start by observig that there are x{2 Opq itegers up to x that are ot divisible by 2. A proportio 2 rds of these remaiig itegers are ot 3 divisible by 3; the a proportio 4 ths of the remaiig itegers are ot divisible by 5, 5 etc. Hece we guess that the umber of itegers x which are free of prime factors y, is roughly ¹ x. p py Evaluatig the product here is tricky but was accomplished by Mertes: If y Ñ 8 the ¹ e γ p log y. py Here γ is the EulerMascheroi costat, defied as lim NÑ8... log N. 2 N There is o obvious explaatio as to why this costat, defied i a very differet cotext, appears here. If? x y opxq (that is, for ay fixed ɛ 0 we have y ɛx oce x is sufficietly large) the we kow from the prime umber theorem that there are x{ log x itegers left usieved, whereas the predictio from our heuristic varies cosiderably as y varies i this rage. This shows that the heuristic is wrog for large y. Takig y? x it 5 This is really statig thigs backwards sice, i provig the prime umber theorem, it is sigificatly easier to iclude the log p weight, ad the deduce estimates for the umber of primes by partial summatio.
9 BOUNDED GAPS BETWEEN PRIMES 9 predicts too may primes by a factor of 2e γ ; takig y x{ log x it predicts too few primes by a factor of e γ. I fact this heuristic gives a accurate estimate provided y x opq. We will exploit the differece betwee this heuristic ad the correct cout, to show that there are smaller tha average gaps betwee primes i sectio 3.2. MaierTrick 2.3. The prime umber theorem for arithmetic progressios, I. Ay prime divisor of pa, qq is a obstructio to the primality of values of the polyomial qx a, ad these are the oly such obstructios. The prime ktuplets cojecture therefore implies that if pa, qq the there are ifiitely may primes of the form q a. This was first proved by Dirichlet i 837. Oce proved oe might ask for a more quatitative result. If we look at the primes i the arithmetic progressios pmod 0q:, 3, 4, 6, 7, 0 3, 3, 23, 43, 53, 73, 83, 03 7, 7, 37, 47, 67, 97, 07 9, 29, 59, 79, 89, 09 the there seem to be roughly equal umbers i each, ad this patter persists as we look further out. Let φpqq deote the umber of a for which pa, qq, ad so we expect that θpx; q, aq : log p x as x Ñ 8. φpqq p prime px pa This is the prime umber theorem for arithmetic progressios ad was first proved by suitably modifyig the proof of the prime umber theorem. The fuctio φpqq was studied by Euler, who showed that it is multiplicative, that is φpqq ¹ p e }q φpp e q (where p e }q meas that p e is the highest power of prime p dividig q) ad that φpp e q p e p e for all e Dirichlet s divisor trick. Aother multiplicative fuctio of importace is the divisor fuctio τpq : where the sum is over the positive itegers d that divide. It is ot difficult to verify that τpp e q e. If is squarefree ad has k prime factors the τpq 2 k, so we see that τpq varies greatly depedig o the arithmetic structure of. Noetheless oe might ask for the average of τpq, that is the average umber of divisors of a positive iteger x. A first d
10 0 ANDREW GRANVILLE approach yields that x τpq x d d x d dx x d sice the positive itegers up to x that are divisible by d ca be writte as dm with m x{d, ad so there are rx{ds such itegers, where rts deotes the largest iteger t. It evidet that rts t Opq, where Opq sigifies that there is a correctio here of at most a bouded multiple of. If we substitute this approximatio i above, we obtai τpq x Opq O x x d d x x dx ³ dx dx Oe ca approximate dx by x dt{t log x. Ideed the differece teds to a limit, d the EulerMascheroi costat γ : lim NÑ8... log N. Hece we have 2 N proved that the itegers up to x have log x Opq divisors, o average, which is quite remarkable for such a wildly fluctuatig fuctio. Dirichlet studied this argumet ad oticed that whe we approximate rx{ds by x{d Opq for large d, say for those d i px{2, xs, the this is ot really a very good approximatio, ad gives a large cumulative error term, Opxq. However we kow that rx{ds exactly, for each of these d, ad so we ca estimate this sum by x{2 Opq, which is much more precise. Dirichlet realized that the correct way to formulate this observatio is to write dm, where d ad m are itegers. Whe d is small the we should fix d, ad cout the umber of such m, with m x{d (as we did above); but whe m is small, the we should fix m, ad cout the umber of d with d x{m. I this way our sums are all over log itervals, which allows us to get a accurate approximatio of their value. I fact we ca exploit the symmetry here to simply break the sum at x {2. Hece Dirichlet proceeded as follows: τpq x x dm d? x x d d? x x d Opq m m? x x m? x x m Opq, d? x m? x x Op? xq. Oe ca do eve better with these sums tha above, showig that N { log N γ Op{Nq. Hece we ca deduce that x x τpq log x 2γ O a extraordiary improvemet upo the earlier error term.?x, I the calculatios i this article, this same idea is essetial. We will take some fuctios, that are difficult to sum, ad rewrite them as a sum of products of other fuctios, that are easier to sum, ad fid a way to sum them over log eough itervals for our methods to take effect. So we should defie the covolutio of two fuctios f ad g as f g where pf gqpq : fpaqgpbq, ab
11 BOUNDED GAPS BETWEEN PRIMES for every iteger, where the sum is over all pairs of positive itegers a, b whose product is. Hece τ, where is the fuctio with pq for every. Let δ pq if, ad δ pq 0 otherwise. Aother importat multiplicative fuctio is the Mobius fuctio µpq, sice µ δ. From this oe ca verify that µppq ad µpp e q 0 for all e 2, for all primes p. We defie Lpq : log, ad we let Λpq log p if is a power of prime p, ad Λpq 0 otherwise. By factorig, we see that L Λ. We therefore deduce that Λ pµ q Λ µ p Λq µ L; that is # log p if p m, where p is prime, m ; Λpq µpaq log b. (2.2) VMidetity 0 otherwise. ab We ca approach the prime umber theorem via this idetity by summig over all x to get Λpq µpaq log b. x abx The lefthad side equals θpxq plus a cotributio from prime powers p e with e 2, ad it is easily show that this cotributio is small (i fact Op? xq). The right had side is the covolutio of a awkward fuctio µ ad somethig very smooth ad easy to sum, L. Ideed, it is easy to see that bb log b log B! ad we ca estimate this very precisely usig Stirlig s formula. Oe ca ifer (see [8] GS for details) that the prime umber theorem is equivalet to provig that x x µpq Ñ 0 as x Ñ 8. I our work here we will eed a more covoluted idetity that ( 2.2) VMidetity to prove our estimates for primes i arithmetic progressios. There are several possible suitable idetities, the simplest of which is due to Vaugha [35]: vaugha Vaugha s idetity : Λ V µ U L µ U Λ V µ U Λ V (2.3) Vaughidet where g W pq gpq if W ad gpq 0 otherwise; ad g g W g W. To verify this idetity, we maipulate the algebra of covolutios: rimektuples Λ V Λ Λ V pµ Lq Λ V p µq µ U L µ U L µ U Λ V µ U Λ V µ U L µ U Λ V µ U pλ Λ V q, 2.5. A quatitative prime ktuplets cojecture. We are goig to develop a heuristic to guesstimate the umber of pairs of twi primes p, p 2 up to x. We start with Gauss s statemet that the desity of primes at aroud x is roughly { log x. Hece the probability that p is prime is { log x, ad the probability that p 2 is prime is { log x so, assumig that these evets are idepedet, the probability that p ad p 2
12 2 ANDREW GRANVILLE are simultaeously prime is log x log x plog xq 2 ; ad so we might expect about x{plog xq 2 pairs of twi primes p, p 2 x. But there is a problem with this reasoig, sice we are implicitly assumig that the evets p is prime for a arbitrary iteger p x, ad p 2 is prime for a arbitrary iteger p x, ca be cosidered to be idepedet. This is obviously false sice, for example, if p is eve the p 2 must also be. 6 So, to correct for the oidepedece, we cosider the ratio of the probability that both p ad p 2 are ot divisible by q, to the probabiliity that p ad p are ot divisible by q, for each small prime q. Now the probability that q divides a arbitrary iteger p is {q; ad hece the probability that p is ot divisible by q is {q. Therefore the probability that both of two idepedetly chose itegers are ot divisible by q, is p {qq 2. The probability that q does ot divide either p or p 2, equals the probability that p 0 or 2. If q 2 the p ca be i ay oe of q 2 residue classes mod q, which occurs, for a radomly chose p, with probability 2{q. If q 2 the p ca be i ay just oe residue class mod 2, which occurs with probability {2. Hece the correctio factor for divisibility by 2 is p 2 q p 2, q2 2 whereas the correctio factor for divisibility by ay prime q 2 is p 2 q q p q q2. Now divisibility by differet small primes i idepedet, as we vary over values of, by the Chiese Remaider Theorem, ad so we might expect to multiply together all of these correctio factors, correspodig to each small prime q. The questio the becomes, what does small mea? I fact, it does t matter much because the product of the correctio factors over larger primes is very close to, ad hece we ca simply exted the correctio to be a product over all primes q. (More precisely, the ifiite product over all q, coverges.) Hece we defie the twi prime costat to be C : 2 ¹ q prime q 3 p 2 q q p , q2 q ad we cojecture that the umber of prime pairs p, p x C plog xq. 2 2 x is 6 Also ote that the same reasoig would tell us that there are x{plog xq 2 prime pairs p, p x.
13 BOUNDED GAPS BETWEEN PRIMES 3 Computatioal evidece suggests that this is a pretty good guess. The aalogous argumet implies the cojecture that the umber of prime pairs p, p 2k x is ¹ p x C p 2 plog xq. 2 p k p 3 This argumet is easily modified to make a aalogous predictio for ay ktuple: Give a,..., a k, let Ωppq be the set of distict residues give by a,..., a k pmod pq, ad the let ωppq Ωppq. Noe of the a i is divisible by p if ad oly if is i ay oe of p ωppq residue classes mod p, ad therefore the correctio factor for prime p is p ωppq p q p. p qk Hece we predict that the umber of prime ktuplets a,..., a k x is, x ¹ Cpaq where Cpaq : plog xq k p p ωppq p q p. p qk Recogktuple A aalogous cojecture, via similar reasoig, ca be made for the frequecy of prime ktuplets of polyomial values i several variables. What is remarkable is that computatioal evidece suggests that these cojectures do approach the truth, though this rests o a rather shaky theoretical framework. A more covicig theoretical framework (though rather more difficult) was give by Hardy ad Littlewood [9] hardy see sectio 3.3. HLheuristic 2.6. Recogizig prime ktuples. The idetity ( 2.2) VMidetity allows us to distiguish prime powers from composite umbers i a arithmetic way. Such idetities ot oly recogize primes, but ca be used to idetify itegers with o more tha k prime factors. For example I geeral Λ 2 pq : µpdqplog {dq 2 d $ '& '% p2m qplog pq 2 if p m ; 2 log p log q if p a q b, p q; 0 otherwise. Λ k pq : µpdqplog {dq k d equals 0 if νpq k (where νpmq deotes the umber of distict prime factors of m). We will be workig with (a variat of) the expressio Λ k pppqq. We have see that if this is ozero the Ppq has k distict prime factors. We will ext show that if 0 a... a k ad a... a k the Ppq must have exactly k distict prime factors. I that case if the k prime factors of Ppq are p,..., p k, the Λ k pppqq k!plog p q... plog p k q.
14 4 ANDREW GRANVILLE Now, suppose that Ppq has r k distict prime factors, call them p,..., p r. For each p i select j jpiq for which the power of p i dividig a j is maximized. Evidetly there exists some J, J k which is ot a jpiq. Therefore if p e i i } a J the Hece p e i i p a Jq p a jpiq q pa J a jpiq q, which divides a J lcm i p e i i divides ¹ jk jj pa J a j q, ¹ jk jj ad so a J ± j a j, by hypothesis, which is impossible. The expressio for Λpq i ( 2.2) VMidetity ca be rewritte as Λpq µpdq log {d, ad eve d d µpdq log R{d, for ay R, provided. Selberg has show that the trucatio d dr µpdq log R{d pa J a j q. is also sesitive to primes ; ad ca be cosiderably easier to work with i various aalytic argumets. I our case, we will work with the fuctio d Ppq dr µpdqplog R{dq k, which is aalogously sesitive to prime ktuplets, ad easier to work with tha the full sum for Λ k pppqq.
15 BOUNDED GAPS BETWEEN PRIMES 5 3. Uiformity i arithmetic progressios 3.. Whe primes are first equidistributed i arithmetic progressios. There is a importat further issue whe cosiderig primes i arithmetic progressios: I may applicatios it is importat to kow whe we are first guarateed that the primes are moreorless equidistributed amogst the arithmetic progressios a with pa, qq ; that is θpx; q, aq x for all pa, qq. (3.) PNTaps φpqq To be clear, here we wat this to hold whe x is a fuctio of q, as q Ñ 8. If oe does extesive calculatios the oe fids that, for ay ɛ 0, if q is sufficietly large ad x q ɛ the the primes up to x are equidistributed amogst the arithmetic progressios a with pa, qq, that is ( 3.) PNTaps holds. This is ot oly uproved at the momet, also o oe really has a plausible pla of how to show such a result. However the slightly weaker statemet that ( 3.) PNTaps holds for ay x q 2 ɛ, ca be show to be true, assumig the Geeralized Riema Hypothesis. This gives us a clear pla for provig such a result, but oe which has see little progress i the last cetury! The best ucoditioal results kow are much weaker tha we have hoped for, equidistributio oly beig proved oce x e qɛ. This is the SiegelWalfisz Theorem, ad it ca be stated i several (equivalet) ways with a error term: For ay B 0 we have θpx; q, aq x φpqq O x plog xq B Or: for ay A 0 there exists B 0 such that if q " * θpx; q, aq x O φpqq plog xq B for all pa, qq. (3.2) SW plog xq A the for all pa, qq. (3.3) SW2 That x eeds to be so large compared to q limited the umber of applicatios of this result. The great breakthough of the secodhalf of the twetieth cetury came i appreciatig that for may applicatios, it is ot so importat that we kow that equidistributio holds for every a with pa, qq, ad every q up to some Q, but rather that this holds for most such q (with Q x {2 ɛ ). It takes some jugglig of variables to state the BombieriViogradov Theorem: We are iterested, for each modulus q, i the size of the largest error term max x a mod q θpx; q, aq φpqq, or eve max yx pa,qq max a mod q pa,qq y θpy; q, aq φpqq. The bouds 0 θpx; q, aq! x log x are trivial, the upper boud obtaied by boudig q the possible cotributio from each term of the arithmetic progressio. (Throughout the symbol!, as i fpxq! gpxq meas there exists a costat c 0 such that
16 6 ANDREW GRANVILLE fpxq cgpxq. ) We would like to improve o the trivial upper boud, perhaps by a power of log x, but we are uable to do so for all q. However, it turs out that we ca prove that if there are exceptioal q, the they are few ad far betwee, ad the BombieriViogradov Theorem expresses this i a useful form. The first thig we do is add up the above quatities over all q Q! qq x. The trivial upper boud is the x q log x! xplog xq2. The BombieriViogradov states that we ca beat this trivial boud by a arbitrary power of log x, provided Q is a little smaller tha? x: The BombieriViogradov Theorem. For ay give A 0 there exists a costat B BpAq, such that qq where Q x {2 {plog xq B. max a mod q pa,qq x θpx; q, aq φpqq! A x plog xq A I fact oe ca take B 2A 5; ad oe ca also replace the summad here by the expressio above with the extra sum over y (though we will ot eed to do this here). It is believed that this kid of estimate holds with Q sigificatly larger tha? x; ideed Elliott ad Halberstam cojectured elliott [8] that oe ca take Q x c for ay costat c : The ElliottHalberstam cojecture For ay give A 0 ad η, 0 have max x a mod q θpx; q, aq φpqq! x plog xq A where Q x {2 η. qq pa,qq However, it was show i fg [3] that oe caot go so far as to take Q x{plog xq B. η, we 2 gpythm This cojecture was the startig poit for the work of Goldsto, Pitz ad Yıldırım gpy [5], as well as of Zhag [38]. zhag This startig poit was a beautiful argumet from [5], gpy that we will spell out i the ext sectio, which yields the followig result. gpy Theorem 3. (GoldstoPitzYıldırım). [5] Let k 2, l be itegers, ad 0 η {2, such that 2η 2l 2l k. (3.4) thetal If the ElliottHalberstam cojecture holds with Q x {2 η the the followig is true: If x a,..., x a k is a admissible set of forms the there are ifiitely may itegers such that at least two of a,..., a k are prime umbers. The coclusio here is exactly the statemet of Zhag s mai theorem.
17 BOUNDED GAPS BETWEEN PRIMES 7 For ow the ElliottHalberstam cojecture seems too difficult to prove, but progress has bee made whe restrictig to oe particular residue class: Fix iteger a 0. We believe that for ay fixed η, 0 η, oe has qq pq,aq 2 x θpx; q, aq φpqq! x plog xq A where Q x {2 η. The key to progress has bee to otice that if oe ca factor the key terms here ito a sum of covolutios the it is easier to make progress, much as we saw with Dirichlet ad the divisor problem. I this case the key covolutio is ( 2.2) VMidetity ad Vaugha s idetity ( 2.3). Vaughidetity A secod type of factorizatio that takes place cocers the modulus: it is much easier to proceed if we ca factor the modulus q as, say dr where d ad r are roughly some prespecified sizes. The simplest class of itegers q for which this sort of thig is true is the ysmooth itegers, those itegers whose prime factors are all y. For example if we are give a ysmooth iteger q ad we wat q dr with d ot much smaller tha D, the we select d to be the largest divisor of q that is D ad we see that D{y d D. This is precisely the class of moduli that Zhag cosidered: 7 MaierTrick Yitag Zhag s Theorem There exist costats η, δ 0 such that for ay give iteger a, we have qq pq,aq q is y smooth q squarefree where Q x {2 η ad y x δ. x θpx; q, aq φpqq! A x plog xq A (3.5) EHsmooth Zhag [38] zhag proved his Theorem for η{2 δ, ad the argumet works provided 68 44η 72δ. We will prove this result, by a somewhat simpler proof, provided 62η 90δ. We expect this estimate holds for every η P r0, {2s ad every δ P p0, s, but just provig it for ay positive pair η, δ 0 is a extraordiary breakthrough that has a eormous effect o umber theory, sice it is such a applicable result (ad techique). This is the techical result that truly lies at the heart of Zhag s result about bouded gaps betwee primes, ad sketchig a proof of this is the focus of the secod half of this article. startig sectio 5. GeeralBV 3.2. A first result o gaps betwee primes. We will ow exploit the differece betwee the heuristic, preseted i sectio 2.2, SieveHeuristic for the prime umber theorem, ad the correct cout. ± Let m py p, N m2 ad x mn, so that y log m log x by the prime 3 umber theorem, ( 2.). pt2 We cosider the primes i the short itervals rm, m Js for N 2N 7 We will prove this with ψpx; q, aq : x, a Λpq i place of θpx; q, aq. It is ot difficult to show that the differece betwee the two sums is! x {2 opq.
18 8 ANDREW GRANVILLE HLheuristic with J y log y. Note that all of the short itervals are px, 2xs. The total umber of primes i all of these short itervals is 2Ņ N πpm Jq πpm q J j πp2x; m, jq πpx; m, jq jj pj,mq assumig ( PNTaps 3.). Hece, sice the maximum is always at least the average, J max πpm Jq πpm q PpN,2Ns log x #t j J : pj, mq u pφpmq{mqj x φpmq log x e γ J log x. usig the prime umber theorem, ad Merte s Theorem, as i sectio 2.2. SieveHeuristic Therefore we have proved that there is i a iterval of legth J, betwee x ad 2x, which has at J least primes, ad so there must be two that differ by e γ log x À e γ log x Hardy ad Littlewood s heuristic for the twi prime cojecture. The rather elegat ad atural heuristic for the quatitative twi prime cojecture, which we described i sectio 2.5, Primektuples was ot the origial way i which Hardy ad Littlewood made this extraordiary predictio. The geesis of their techique lies i the circle method., that they developed together with Ramauja. The idea is that oe ca distiguish the iteger 0 from all other itegers, sice» # if 0; eptqdt (3.6) expitegra 0 otherwise, 0 where, for ay real umber t, we write eptq : e 2πit. Notice that this is literally a itegral aroud the uit circle. Therefore to determie whether the two give primes p ad q differ by 2, we simply determie» 0 eppp q 2qtq dt. If we sum this up over all p, q x, we fid that the umber of twi primes p, p 2 x equals, exactly,»» eppp q 2qtq dt P ptq 2 ep 2tq dt, where P ptq : epptq. p,qx p,q primes 0 0 px p prime I the circle method oe ext distiguishes betwee those parts of the itegral which are large (the major arcs), ad those that are small (the mior arcs). Typically the major arcs are small arcs aroud those t that are ratioals with small deomiators. Here the width of the arc is about {x, ad we wish to uderstad the cotributio at t a{m, where pa, mq. Note the that P pa{mq b pmod mq pb,mq e m pabqπpx; m, bq.
19 BOUNDED GAPS BETWEEN PRIMES 9 where e m pbq ep b m q e2πib{m. We ote the easily proved idetity r pmod mq, pr,mq e m prkq φppk, mqqµpm{pm, kqq. Assumig the prime umber theorem for arithmetic progressios with a good error term we therefore see that x P pa{mq e m pabq µpmq x φpmq log x φpmq log x. b pmod mq pb,mq Hece i total we predict that the umber of prime pairs p, p x mm a: pa,mq x plog xq 2 e m p 2aq µpmq x φpmq log x φp2q ¹ p 2 2 φppq 2 x plog xq 2 m x C plog xq, 2 2 x is roughly µpmq 2 φpp2, mqqµpm{p2, mqq φpmq2 as i sectio quatprimektuples??. Moreover the aalogous argumet yields the more geeral cojecture for prime pairs p, p h. Why does t this argumet lead to a proof of the twi prime cojecture? For the momet we have little idea how to show that the mior arcs cotribute very little. Give that we do ot kow how to fid cacelatio amogst the mior arcs, we would eed to show that the itegrad is typically very small o the mior arcs, meaig that there is usually a lot of cacelatio i the sums P ptq. For ow this is a importat ope problem. Noetheless, it is this kid of argumet that has led to Helfgott s recet proof HH [2] that every odd iteger 3 is the sum of o more tha three primes.
20 20 ANDREW GRANVILLE gpysec 4. GoldstoPitzYıldırım s argumet We ow give a versio of the combiatorial argumet of GoldstoPitzYıldırım gpy [5], which was the ispiratio for provig that there are bouded gaps betwee primes: 4.. The set up. Let H pa a 2... a k q be a admissible ktuple, ad take x a k. Our goal is to select a fuctio ν for which νpq 0 for all, such that x 2x νpqp If we ca do this the there must exist a iteger such that νpqp ķ i ķ i θp a i q log 3xq 0. (4.) gpy θp a i q log 3xq 0. I that case νpq 0 so that νpq 0, ad therefore ķ i θp a i q log 3x. However each a i 2x a k 2x x ad so each θp a i q log 3x. This implies that at least two of the θp a i q are ozero, that is, at least two of a,..., a k are prime. A simple idea, but the difficulty comes i selectig the fuctio νpq with these properties for which we ca evaluate the sum. I [5] gpy they had the further idea that they could select νpq so that it would be sesitive to whe each a i is prime, or almost prime, ad so they relied o the type of costructio that we discussed i sectio 2.6. Recogktuple I order that νpq 0 oe ca simply take it to be a square. Hece we select νpq : d Ppq where λpdq : µpdq m log R{d m! log R whe d P D, ad λpdq 0 otherwise, for some positive iteger m k l, where D is a subset of the squarefree itegers i t,..., Ru, ad we select R x {3. I the argumet of [5], gpy D icludes all of the squarefree itegers i t,..., Ru, whereas Zhag uses oly the ysmooth oes. Our formulatio works i both cases. λpdq Evaluatig the sums, I. Now, expadig the above sum gives d,d 2 D:rd,d 2 s λpd qλpd 2 q ķ i x 2x D Ppq θp a i q log 3x x 2x D Ppq. (4.2) gpy2
ORDERS OF GROWTH KEITH CONRAD
ORDERS OF GROWTH KEITH CONRAD Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really wat to uderstad their behavior It also helps you better grasp topics i calculus
More informationModule 4: Mathematical Induction
Module 4: Mathematical Iductio Theme 1: Priciple of Mathematical Iductio Mathematical iductio is used to prove statemets about atural umbers. As studets may remember, we ca write such a statemet as a predicate
More informationIn nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008
I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces
More informationwhen n = 1, 2, 3, 4, 5, 6, This list represents the amount of dollars you have after n days. Note: The use of is read as and so on.
Geometric eries Before we defie what is meat by a series, we eed to itroduce a related topic, that of sequeces. Formally, a sequece is a fuctio that computes a ordered list. uppose that o day 1, you have
More informationThe Euler Totient, the Möbius and the Divisor Functions
The Euler Totiet, the Möbius ad the Divisor Fuctios Rosica Dieva July 29, 2005 Mout Holyoke College South Hadley, MA 01075 1 Ackowledgemets This work was supported by the Mout Holyoke College fellowship
More informationLecture 4: Cauchy sequences, BolzanoWeierstrass, and the Squeeze theorem
Lecture 4: Cauchy sequeces, BolzaoWeierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits
More informationAsymptotic Growth of Functions
CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll
More informationDepartment of Computer Science, University of Otago
Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS200609 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly
More informationProperties of MLE: consistency, asymptotic normality. Fisher information.
Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout
More informationFactors of sums of powers of binomial coefficients
ACTA ARITHMETICA LXXXVI.1 (1998) Factors of sums of powers of biomial coefficiets by Neil J. Cali (Clemso, S.C.) Dedicated to the memory of Paul Erdős 1. Itroductio. It is well ow that if ( ) a f,a = the
More information
Factoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett
(March 16, 004) Factorig x 1: cyclotomic ad Aurifeuillia polyomials Paul Garrett Polyomials of the form x 1, x 3 1, x 4 1 have at least oe systematic factorizatio x 1 = (x 1)(x 1
More information1. MATHEMATICAL INDUCTION
1. MATHEMATICAL INDUCTION EXAMPLE 1: Prove that for ay iteger 1. Proof: 1 + 2 + 3 +... + ( + 1 2 (1.1 STEP 1: For 1 (1.1 is true, sice 1 1(1 + 1. 2 STEP 2: Suppose (1.1 is true for some k 1, that is 1
More informationSequences and Series
CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their
More information7. Sample Covariance and Correlation
1 of 8 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 7. Sample Covariace ad Correlatio The Bivariate Model Suppose agai that we have a basic radom experimet, ad that X ad Y
More informationIrreducible polynomials with consecutive zero coefficients
Irreducible polyomials with cosecutive zero coefficiets Theodoulos Garefalakis Departmet of Mathematics, Uiversity of Crete, 71409 Heraklio, Greece Abstract Let q be a prime power. We cosider the problem
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13
EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Note 13 Itroductio At this poit, we have see eough examples that it is worth just takig stock of our model of probability ad may
More informationThe Field of Complex Numbers
The Field of Complex Numbers S. F. Ellermeyer The costructio of the system of complex umbers begis by appedig to the system of real umbers a umber which we call i with the property that i = 1. (Note that
More informationSection IV.5: Recurrence Relations from Algorithms
Sectio IV.5: Recurrece Relatios from Algorithms Give a recursive algorithm with iput size, we wish to fid a Θ (best big O) estimate for its ru time T() either by obtaiig a explicit formula for T() or by
More informationThe second difference is the sequence of differences of the first difference sequence, 2
Differece Equatios I differetial equatios, you look for a fuctio that satisfies ad equatio ivolvig derivatives. I differece equatios, istead of a fuctio of a cotiuous variable (such as time), we look for
More informationSequences II. Chapter 3. 3.1 Convergent Sequences
Chapter 3 Sequeces II 3. Coverget Sequeces Plot a graph of the sequece a ) = 2, 3 2, 4 3, 5 + 4,...,,... To what limit do you thik this sequece teds? What ca you say about the sequece a )? For ǫ = 0.,
More informationConvexity, Inequalities, and Norms
Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for
More information4.1 Sigma Notation and Riemann Sums
0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas
More informationCS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations
CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad
More information1 The Binomial Theorem: Another Approach
The Biomial Theorem: Aother Approach Pascal s Triagle I class (ad i our text we saw that, for iteger, the biomial theorem ca be stated (a + b = c a + c a b + c a b + + c ab + c b, where the coefficiets
More informationSoving Recurrence Relations
Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree
More informationA probabilistic proof of a binomial identity
A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two
More information8.1 Arithmetic Sequences
MCR3U Uit 8: Sequeces & Series Page 1 of 1 8.1 Arithmetic Sequeces Defiitio: A sequece is a comma separated list of ordered terms that follow a patter. Examples: 1, 2, 3, 4, 5 : a sequece of the first
More informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More informationChapter 6: Variance, the law of large numbers and the MonteCarlo method
Chapter 6: Variace, the law of large umbers ad the MoteCarlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value
More informationI. Chisquared Distributions
1 M 358K Supplemet to Chapter 23: CHISQUARED DISTRIBUTIONS, TDISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad tdistributios, we first eed to look at aother family of distributios, the chisquared distributios.
More informationAQA STATISTICS 1 REVISION NOTES
AQA STATISTICS 1 REVISION NOTES AVERAGES AND MEASURES OF SPREAD www.mathsbox.org.uk Mode : the most commo or most popular data value the oly average that ca be used for qualitative data ot suitable if
More informationNPTEL STRUCTURAL RELIABILITY
NPTEL Course O STRUCTURAL RELIABILITY Module # 0 Lecture 1 Course Format: Web Istructor: Dr. Aruasis Chakraborty Departmet of Civil Egieerig Idia Istitute of Techology Guwahati 1. Lecture 01: Basic Statistics
More informationSAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx
SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval
More informationKey Ideas Section 81: Overview hypothesis testing Hypothesis Hypothesis Test Section 82: Basics of Hypothesis Testing Null Hypothesis
Chapter 8 Key Ideas Hypothesis (Null ad Alterative), Hypothesis Test, Test Statistic, Pvalue Type I Error, Type II Error, Sigificace Level, Power Sectio 81: Overview Cofidece Itervals (Chapter 7) are
More informationWHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER?
WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? JÖRG JAHNEL 1. My Motivatio Some Sort of a Itroductio Last term I tought Topological Groups at the Göttige Georg August Uiversity. This
More informationRiemann Sums y = f (x)
Riema Sums Recall that we have previously discussed the area problem I its simplest form we ca state it this way: The Area Problem Let f be a cotiuous, oegative fuctio o the closed iterval [a, b] Fid
More informationChapter 5 O A Cojecture Of Erdíos Proceedigs NCUR VIII è1994è, Vol II, pp 794í798 Jeærey F Gold Departmet of Mathematics, Departmet of Physics Uiversity of Utah Do H Tucker Departmet of Mathematics Uiversity
More information8.5 Alternating infinite series
65 8.5 Alteratig ifiite series I the previous two sectios we cosidered oly series with positive terms. I this sectio we cosider series with both positive ad egative terms which alterate: positive, egative,
More informationChapter 7 Methods of Finding Estimators
Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of
More informationDivide and Conquer, Solving Recurrences, Integer Multiplication Scribe: Juliana Cook (2015), V. Williams Date: April 6, 2016
CS 6, Lecture 3 Divide ad Coquer, Solvig Recurreces, Iteger Multiplicatio Scribe: Juliaa Cook (05, V Williams Date: April 6, 06 Itroductio Today we will cotiue to talk about divide ad coquer, ad go ito
More informationTrigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is
0_0605.qxd /5/05 0:45 AM Page 470 470 Chapter 6 Additioal Topics i Trigoometry 6.5 Trigoometric Form of a Complex Number What you should lear Plot complex umbers i the complex plae ad fid absolute values
More informationDistributions of Order Statistics
Chapter 2 Distributios of Order Statistics We give some importat formulae for distributios of order statistics. For example, where F k: (x)=p{x k, x} = I F(x) (k, k + 1), I x (a,b)= 1 x t a 1 (1 t) b 1
More informationExample 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).
BEGINNING ALGEBRA Roots ad Radicals (revised summer, 00 Olso) Packet to Supplemet the Curret Textbook  Part Review of Square Roots & Irratioals (This portio ca be ay time before Part ad should mostly
More informationx(x 1)(x 2)... (x k + 1) = [x] k n+m 1
1 Coutig mappigs For every real x ad positive iteger k, let [x] k deote the fallig factorial ad x(x 1)(x 2)... (x k + 1) ( ) x = [x] k k k!, ( ) k = 1. 0 I the sequel, X = {x 1,..., x m }, Y = {y 1,...,
More informationLesson 12. Sequences and Series
Retur to List of Lessos Lesso. Sequeces ad Series A ifiite sequece { a, a, a,... a,...} ca be thought of as a list of umbers writte i defiite order ad certai patter. It is usually deoted by { a } =, or
More informationif A S, then X \ A S, and if (A n ) n is a sequence of sets in S, then n A n S,
Lecture 5: Borel Sets Topologically, the Borel sets i a topological space are the σalgebra geerated by the ope sets. Oe ca build up the Borel sets from the ope sets by iteratig the operatios of complemetatio
More informationDivergence of p 1/p. Adrian Dudek. adrian.dudek[at]anu.edu.au
Divergece of / Adria Dudek adria.dudek[at]au.edu.au Whe I was i high school, my maths teacher cheekily told me that it s ossible to add u ifiitely may umbers ad get a fiite umber. She the illustrated this
More informationTHE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n
We will cosider the liear regressio model i matrix form. For simple liear regressio, meaig oe predictor, the model is i = + x i + ε i for i =,,,, This model icludes the assumptio that the ε i s are a sample
More informationLecture Notes CMSC 251
We have this messy summatio to solve though First observe that the value remais costat throughout the sum, ad so we ca pull it out frot Also ote that we ca write 3 i / i ad (3/) i T () = log 3 (log ) 1
More informationHere are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
This documet was writte ad copyrighted by Paul Dawkis. Use of this documet ad its olie versio is govered by the Terms ad Coditios of Use located at http://tutorial.math.lamar.edu/terms.asp. The olie versio
More information1.3 Binomial Coefficients
18 CHAPTER 1. COUNTING 1. Biomial Coefficiets I this sectio, we will explore various properties of biomial coefficiets. Pascal s Triagle Table 1 cotais the values of the biomial coefficiets ( ) for 0to
More informationTHE ARITHMETIC OF INTEGERS.  multiplication, exponentiation, division, addition, and subtraction
THE ARITHMETIC OF INTEGERS  multiplicatio, expoetiatio, divisio, additio, ad subtractio What to do ad what ot to do. THE INTEGERS Recall that a iteger is oe of the whole umbers, which may be either positive,
More informationLecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)
18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the BruMikowski iequality for boxes. Today we ll go over the
More informationThe Field Q of Rational Numbers
Chapter 3 The Field Q of Ratioal Numbers I this chapter we are goig to costruct the ratioal umber from the itegers. Historically, the positive ratioal umbers came first: the Babyloias, Egyptias ad Grees
More informationSection 11.3: The Integral Test
Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult
More information3. Greatest Common Divisor  Least Common Multiple
3 Greatest Commo Divisor  Least Commo Multiple Defiitio 31: The greatest commo divisor of two atural umbers a ad b is the largest atural umber c which divides both a ad b We deote the greatest commo gcd
More information0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5
Sectio 13 KolmogorovSmirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.
More information0,1 is an accumulation
Sectio 5.4 1 Accumulatio Poits Sectio 5.4 BolzaoWeierstrass ad HeieBorel Theorems Purpose of Sectio: To itroduce the cocept of a accumulatio poit of a set, ad state ad prove two major theorems of real
More informationrepresented by 4! different arrangements of boxes, divide by 4! to get ways
Problem Set #6 solutios A juggler colors idetical jugglig balls red, white, ad blue (a I how may ways ca this be doe if each color is used at least oce? Let us preemptively color oe ball i each color,
More information4 n. n 1. You shold think of the Ratio Test as a generalization of the Geometric Series Test. For example, if a n ar n is a geometric sequence then
SECTION 2.6 THE RATIO TEST 79 2.6. THE RATIO TEST We ow kow how to hadle series which we ca itegrate (the Itegral Test), ad series which are similar to geometric or pseries (the Compariso Test), but of
More informationIncremental calculation of weighted mean and variance
Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically
More information1 n. n > dt. t < n 1 + n=1
Math 05 otes C. Pomerace The harmoic sum The harmoic sum is the sum of recirocals of the ositive itegers. We kow from calculus that it diverges, this is usually doe by the itegral test. There s a more
More informationWeek 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable
Week 3 Coditioal probabilities, Bayes formula, WEEK 3 page 1 Expected value of a radom variable We recall our discussio of 5 card poker hads. Example 13 : a) What is the probability of evet A that a 5
More informationTAYLOR SERIES, POWER SERIES
TAYLOR SERIES, POWER SERIES The followig represets a (icomplete) collectio of thigs that we covered o the subject of Taylor series ad power series. Warig. Be prepared to prove ay of these thigs durig the
More informationDefinition. Definition. 72 Estimating a Population Proportion. Definition. Definition
7 stimatig a Populatio Proportio I this sectio we preset methods for usig a sample proportio to estimate the value of a populatio proportio. The sample proportio is the best poit estimate of the populatio
More informationARITHMETIC AND GEOMETRIC PROGRESSIONS
Arithmetic Ad Geometric Progressios Sequeces Ad ARITHMETIC AND GEOMETRIC PROGRESSIONS Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives
More informationFourier Series and the Wave Equation Part 2
Fourier Series ad the Wave Equatio Part There are two big ideas i our work this week. The first is the use of liearity to break complicated problems ito simple pieces. The secod is the use of the symmetries
More information13 Fast Fourier Transform (FFT)
13 Fast Fourier Trasform FFT) The fast Fourier trasform FFT) is a algorithm for the efficiet implemetatio of the discrete Fourier trasform. We begi our discussio oce more with the cotiuous Fourier trasform.
More informationPerfect Packing Theorems and the AverageCase Behavior of Optimal and Online Bin Packing
SIAM REVIEW Vol. 44, No. 1, pp. 95 108 c 2002 Society for Idustrial ad Applied Mathematics Perfect Packig Theorems ad the AverageCase Behavior of Optimal ad Olie Bi Packig E. G. Coffma, Jr. C. Courcoubetis
More informationMath Discrete Math Combinatorics MULTIPLICATION PRINCIPLE:
Math 355  Discrete Math 4.14.4 Combiatorics Notes MULTIPLICATION PRINCIPLE: If there m ways to do somethig ad ways to do aother thig the there are m ways to do both. I the laguage of set theory: Let
More informationA Recursive Formula for Moments of a Binomial Distribution
A Recursive Formula for Momets of a Biomial Distributio Árpád Béyi beyi@mathumassedu, Uiversity of Massachusetts, Amherst, MA 01003 ad Saverio M Maago smmaago@psavymil Naval Postgraduate School, Moterey,
More information3. Covariance and Correlation
Virtual Laboratories > 3. Expected Value > 1 2 3 4 5 6 3. Covariace ad Correlatio Recall that by takig the expected value of various trasformatios of a radom variable, we ca measure may iterestig characteristics
More informationHypothesis testing. Null and alternative hypotheses
Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate
More informationNUMBERS COMMON TO TWO POLYGONAL SEQUENCES
NUMBERS COMMON TO TWO POLYGONAL SEQUENCES DIANNE SMITH LUCAS Chia Lake, Califoria a iteger, The polygoal sequece (or sequeces of polygoal umbers) of order r (where r is r > 3) may be defied recursively
More informationChapter Gaussian Elimination
Chapter 04.06 Gaussia Elimiatio After readig this chapter, you should be able to:. solve a set of simultaeous liear equatios usig Naïve Gauss elimiatio,. lear the pitfalls of the Naïve Gauss elimiatio
More informationarxiv:1012.1336v2 [cs.cc] 8 Dec 2010
Uary SubsetSum is i Logspace arxiv:1012.1336v2 [cs.cc] 8 Dec 2010 1 Itroductio Daiel M. Kae December 9, 2010 I this paper we cosider the Uary SubsetSum problem which is defied as follows: Give itegers
More informationTHE LEAST COMMON MULTIPLE OF A QUADRATIC SEQUENCE
THE LEAST COMMON MULTIPLE OF A QUADRATIC SEQUENCE JAVIER CILLERUELO Abstract. We obtai, for ay irreducible quadratic olyomial f(x = ax 2 + bx + c, the asymtotic estimate log l.c.m. {f(1,..., f(} log. Whe
More information5 Boolean Decision Trees (February 11)
5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected
More informationBasic Elements of Arithmetic Sequences and Series
MA40S PRECALCULUS UNIT G GEOMETRIC SEQUENCES CLASS NOTES (COMPLETED NO NEED TO COPY NOTES FROM OVERHEAD) Basic Elemets of Arithmetic Sequeces ad Series Objective: To establish basic elemets of arithmetic
More informationConfidence Intervals for One Mean with Tolerance Probability
Chapter 421 Cofidece Itervals for Oe Mea with Tolerace Probability Itroductio This procedure calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) with
More informationπ d i (b i z) (n 1)π )... sin(θ + )
SOME TRIGONOMETRIC IDENTITIES RELATED TO EXACT COVERS Joh Beebee Uiversity of Alaska, Achorage Jauary 18, 1990 Sherma K Stei proves that if si π = k si π b where i the b i are itegers, the are positive
More information8.3 POLAR FORM AND DEMOIVRE S THEOREM
SECTION 8. POLAR FORM AND DEMOIVRE S THEOREM 48 8. POLAR FORM AND DEMOIVRE S THEOREM Figure 8.6 (a, b) b r a 0 θ Complex Number: a + bi Rectagular Form: (a, b) Polar Form: (r, θ) At this poit you ca add,
More informationInfinite Sequences and Series
CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...
More informationSection 9.2 Series and Convergence
Sectio 9. Series ad Covergece Goals of Chapter 9 Approximate Pi Prove ifiite series are aother importat applicatio of limits, derivatives, approximatio, slope, ad cocavity of fuctios. Fid challegig atiderivatives
More informationClass Meeting # 16: The Fourier Transform on R n
MATH 18.152 COUSE NOTES  CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,
More information23 The Remainder and Factor Theorems
 The Remaider ad Factor Theorems Factor each polyomial completely usig the give factor ad log divisio 1 x + x x 60; x + So, x + x x 60 = (x + )(x x 15) Factorig the quadratic expressio yields x + x x
More informationSEQUENCES AND SERIES
Chapter 9 SEQUENCES AND SERIES Natural umbers are the product of huma spirit. DEDEKIND 9.1 Itroductio I mathematics, the word, sequece is used i much the same way as it is i ordiary Eglish. Whe we say
More information+ 1= x + 1. These 4 elements form a field.
Itroductio to fiite fields II Fiite field of p elemets F Because we are iterested i doig computer thigs it would be useful for us to costruct fields havig elemets. Let s costruct a field of elemets; we
More informationReview for College Algebra Final Exam
Review for College Algebra Fial Exam (Please remember that half of the fial exam will cover chapters 14. This review sheet covers oly the ew material, from chapters 5 ad 7.) 5.1 Systems of equatios i
More informationUnit 20 Hypotheses Testing
Uit 2 Hypotheses Testig Objectives: To uderstad how to formulate a ull hypothesis ad a alterative hypothesis about a populatio proportio, ad how to choose a sigificace level To uderstad how to collect
More informationGeometric Sequences and Series. Geometric Sequences. Definition of Geometric Sequence. such that. a2 4
3330_0903qxd /5/05 :3 AM Page 663 Sectio 93 93 Geometric Sequeces ad Series 663 Geometric Sequeces ad Series What you should lear Recogize, write, ad fid the th terms of geometric sequeces Fid th partial
More informationBuilding Blocks Problem Related to Harmonic Series
TMME, vol3, o, p.76 Buildig Blocks Problem Related to Harmoic Series Yutaka Nishiyama Osaka Uiversity of Ecoomics, Japa Abstract: I this discussio I give a eplaatio of the divergece ad covergece of ifiite
More informationMATH 361 Homework 9. Royden Royden Royden
MATH 61 Homework 9 Royde..9 First, we show that for ay subset E of the real umbers, E c + y = E + y) c traslatig the complemet is equivalet to the complemet of the traslated set). Without loss of geerality,
More informationA Gentle Introduction to Algorithms: Part II
A Getle Itroductio to Algorithms: Part II Cotets of Part I:. Merge: (to merge two sorted lists ito a sigle sorted list.) 2. Bubble Sort 3. Merge Sort: 4. The BigO, BigΘ, BigΩ otatios: asymptotic bouds
More informationB1. Fourier Analysis of Discrete Time Signals
B. Fourier Aalysis of Discrete Time Sigals Objectives Itroduce discrete time periodic sigals Defie the Discrete Fourier Series (DFS) expasio of periodic sigals Defie the Discrete Fourier Trasform (DFT)
More informationINFINITE SERIES KEITH CONRAD
INFINITE SERIES KEITH CONRAD. Itroductio The two basic cocepts of calculus, differetiatio ad itegratio, are defied i terms of limits (Newto quotiets ad Riema sums). I additio to these is a third fudametal
More information3.2 Introduction to Infinite Series
3.2 Itroductio to Ifiite Series May of our ifiite sequeces, for the remaider of the course, will be defied by sums. For example, the sequece S m := 2. () is defied by a sum. Its terms (partial sums) are
More information{{1}, {2, 4}, {3}} {{1, 3, 4}, {2}} {{1}, {2}, {3, 4}} 5.4 Stirling Numbers
. Stirlig Numbers Whe coutig various types of fuctios from., we quicly discovered that eumeratig the umber of oto fuctios was a difficult problem. For a domai of five elemets ad a rage of four elemets,
More informationTHE LEAST SQUARES REGRESSION LINE and R 2
THE LEAST SQUARES REGRESSION LINE ad R M358K I. Recall from p. 36 that the least squares regressio lie of y o x is the lie that makes the sum of the squares of the vertical distaces of the data poits from
More information