The Selberg Sieve and Prime Pairs by Mart in Christopher Duarte B . S c , York University, 2001 A THESIS S U B M I T T E D IN P A R T I A L F U L F I L M E N T O F T H E R E Q U I R E M E N T S F O R T H E D E G R E E O F Master of Science in The Faculty of Graduate Studies Mathematics The University Of British Columbia Apr i l 21, 2005 © Martin Christopher Duarte, 2005 11 Abstract This paper gives an exposition of the Selberg Sieve and its application to the sifting of prime pairs. In particular, Selberg's methods are applied to the sift-ing approach of Eratosthenes and to an alternate sifting approach presented by the author. The results obtained are then used to show that the sum of the reciprocals of the twin primes (and similarly for general prime pairs) is convergent or finite. This paper is intended to be mostly self-contained and will hopefully be readable to someone with little background in the area of Sieve Theory. i i i Contents Abstract i i Contents i i i Preface v Acknowledgements v i Dedication v i i 1 Introduction 1 2 Sieve Notations and Preliminaries 3 3 The Selberg Sieve 14 3.1 The Set-up 14 3.1.1 Selberg's Main Theorem 14 3.1.2 Bounding X(d) , 19 3.2 Estimates for G(x) and E(D, P) 21 3.2.1 Using Rankin's Device 21 3.2.2 A n Asymptotic Bound 25 3.2.3 The Error Term 33 4 Twin Primes 34 4.1 Sifting for Twin Primes 34 4.1.1 A n example of the Sieve of Eratosthenes 34 4.1.2 A n Alternate Sieve for Twin Primes 35 4.1.3 Proving the Alternate Sieve works 36 4.2 Applying Selberg's Results to Twin Primes 38 4.2.1 The Eratosthenes Approach 38 4.2.2 The Alternate Approach 39 Contents iv 4.3 Sumof the Reciprocals, of Twin Primes . . . . . . . . . . . . . 41 5 G e n e r a l P r i m e P a i r s ( G . P . P . ) 45 5.1 Sifting General Prime Pairs 45 5.1.1 A n example of the Sieve of Eratosthenes'. . . . . . . . . . 45 5.1.2 The Alternate Sieve for General Prime Pairs 46 5.1.3 Proving the General Alternate Sieve works 48 5.2 Applying Selberg's Method 51 5.2.1 The Eratosthenes Approach 51 5.2.2 The Alternate Approach 53 5.3 Sum of the Reciprocals . . . 55 6 C o n c l u d i n g R e m a r k s 58 B i b l i o g r a p h y 60 Preface I was in my senior year of high school when I first learned about twin primes and the famous Twin Prime Conjecture. Though I found the problem fas-cinating at the time, I had given it little thought and soon forgot about it. Then in the beginning of the second year of my studies at York University, I was once again introduced to the outstanding problem. I was once again fascinated by the fact that nobody could solve this problem over the course of approximately the last two thousand years. I asked a close friend of mine at the time if he would be interested to work on the problem with me. It soon became clear that he was not interested and I began to seriously think about the problem on my own. I recall staying behind after one of my computer science lectures to ponder the mysteries behind twin primes. I began to notice some peculiarities among the twin primes and later would discover the alternate sifting approach to that of Eratosthenes, along with a quite cumbersome proof that it worked. I knew next to nothing about modular arithmetic at the time. Over the last few years I made some progress toward cleaning up the proof and also learned some number theory and of the existence of Sieve Theory. I then met my supervisor, Greg Martin, at the University of British Columbia and he suggested that I learn more about Sieve Theory. It is thus that the thesis you are about to read came into being. In particular, I have focused on the Selberg Sieve and much of the paper is dedicated to an exposition of it. I have then applied Selberg's results to the Eratosthenes approach for sifting twin primes and to my own approach as well. I have also discovered that the alternate approach works for general prime pairs as well. In fact, by making that discovery, I have come to'a greater understanding of how the alternate sieve works. The proofs showing that it works for twin primes and general prime pairs have been greatly simplified making good use of modular arithmetic. Finally, I have also applied Selberg's results to both sifting approaches in the case of general prime pairs. vi Acknowledgements I would like to thank Greg Mart in for all of his guidance with this thesis. Without his support and supervision, this paper would have been impossible. I would like to thank David Boyd for taking the time to be the second reader. Thanks to Lee Yupitun and Izabella Laba for providing me with the necessary information for ensuring that all requirements are met for submission of this thesis. Thanks to Michael Forbes for providing the necessary tools used to format the paper. I would also like to thank all my family, friends, peers, and especially Mariah Hamel and Abbas Moameni. Without their support, I could not have achieved this accomplishment. V l l To My Parents This accomplishment was made possible by the sacrifices and hard work of my parents, Mart in and Shira Duarte. I thank you both for your ever continuing love and support. Chapter 1 i Introduction What is a Sieve /SIV/n.? The first definition that follows is provided by the Oxford Minidictionary, whereas the second is provided by the author. 1. Utensil with a wire mesh or gauze through which liquids or fine particles can pass. -v.t. put through a sieve. 2. A mathematical cancellation process by which a desired set of num-bers/objects is yielded from a larger set of numbers/objects. Eratosthenes, a mathematician of ancient Greece, is the first known per-son to have constructed a mathematical sieve (third century, B .C . ) . He started with a list of odd numbers and then proceeded to cancel 3 2 and every third number thereafter, then cancel 5 2 and every fifth number thereafter, and so forth. After going through this process, one is left with the number 1 and the prime numbers. Today, this process is generally referred to as the "Sieve of Eratosthenes" and makes use of the observation that a number, n, if not prime, has a prime factor less than or equal to ^/n. For example, one starts with a list of all integers from 1 to N, and then cancels the proper multiples of all the primes, p, between 1 and y/N. The numbers yielded by this sieve are 1 and the primes between 1 and N. In 1808, A . M . Legendre observed that sieves can be used to give useful information about the distribution of primes and provided a more analytical formulation of the concept. His work and the work of those that follow him, like Brun and Selberg, provide the necessary tools and notations of Sieve Theory. The Selberg formulation and results can be used for a variety of prob-lems where sieves provide useful information. One such problem is the so called "Twin Prime Problem". A Twin Prime is a pair of prime numbers that differ by 2; (5,7) and (11,13) are examples. They are usually sifted by simply picking them out after conducting the Sieve of Eratosthenes. While it is well known that prime numbers occur infinitely throughout the integers, it is still an open question as to whether or not twin primes occur infinitely Chapter 1. Introduction 2 often. One may also wish to consider more general prime pairs, (p,p + 2B). It is also unknown whether or not they occur infinitely often throughout the integers. Selberg's method provides useful upper bounds for both problems: up-per bounds on the number of twin primes less than X, and on the number of general prime pairs less than X. A n alternate approach to the Sieve of Eratosthenes for sifting the twin primes, or general prime pairs, also leads to the same upper bounds. In all cases, one can deduce that the sum of the reciprocals of the twin primes is convergent (or possibly finite), and similarly for more general prime pairs. 3 Chapter 2 Sieve Notations and Preliminaries In order to discuss the Selberg Sieve and applications of it, we first need to look at the notations and language of Sieve Theory. Several lemmas and identities that wil l be needed should also be mentioned. The following are some identities that are relevant when discussing sieves; they can be found in many texts on Analytic Number Theory. Where p represents a prime and C is a constant, £ ^ _ , o g O T + 0 (l) (2.1) p<X p g i = l o g d o ^ + C + O ^ ) ; (2.2) II f1 ~ ~) = e 7 l 0 S ( z ) + CK1) (7 i s Euler's constant) (2.3) (2.3) is known as Mertens' product. The Mobius function, /z, is important to Sieve Theory; we recall its defi-nition: Mi) = i A*(PiP2 • • • Pr) = (—l) r if P i , •••) Pr are distinct primes y,(d) — 0 if p2 | d for some prime p, -i.e., \x is the multiplicative function defined at prime powers, pa, by Hip) = - 1 , »(pa) = 0 if a > 2 . We also recall a key identity involving the Mobius function: T,M = {1 otherwise. <2"4) Chapter 2. Sieve Notations and Preliminaries 4 A will denote a set of numbers we wish to sift. A typical example would be to let A be the set of natural numbers up to some bound, and then proceed to sift (choose via a cancellation process) this set for numbers not divisible by certain primes, i.e., cancel the numbers from A that are divisible by certain primes. Ad will denote the set of numbers in A that are divisible by d. P wil l denote a product of distinct primes, not necessarily containing all the primes up to some specified bound. However, in many cases, p<z P will usually be the product of primes we are sifting (cancelling) by. In connection with P, we denote P{z) = Hp . (2.6) p\p p<z In situations where no product P is implied or specified, we simply take P(z) to be P(z) = ]Jp . (2.7) p<z (a, b) wil l denote the g.c.d. of a and b. Definition 2.1 We define S(X) = z^d|x/ i(c^)- Also, abbreviate S((a, P)) to S(a, P), so we have S(a, P) = £ , M - { I 1 (2.8) d\(a, P) The second equality followed from identity (2.4). It is important to observe that the condition (a, P) = 1 says that a is not divisible by any "sifting" prime factor of P. Definition 2.2 With S(a, P) as in identity (2.8), we define S{A,P) = Y,S{a,P). (2.9) Chapter 2. Sieve Notations and Preliminaries 5 This says that S(A, P) is the number of a in A that are not divisible by any primes in the product P. Putting definitions (2.1) and (2.2) together, we get S(A, P) = £ £ / i ( d ) = £ / * ( < 0 I M (2-10) a&A d\a d\P d\P which is known as "Legendre's Identity". The second equality followed by switching the order of summation. It will be seen later that with the Selberg Sieve, identity (2.8) is replaced with an inequality where p is replaced by another function, A, where in some sense, it is easier to work with A. Also, suitable estimates for |^ 4^ 1 are needed in order to attain a good calculation of Legendre's Identity. Wi th the notations we have so far, conducting a sieve for twin primes can be thought of as a sieve on a set of numbers given by the polynomial expression: f(n) = n(n + 2). Likewise, for a more general prime pair, we would have /(re) = re(n + 2B). More generally, we take A = {/(n) : Y - X < re < Y], where f(n) is a polynomial over the integers (for twin primes, /(re) = n(n+2), and for general prime pairs, / (n) = n(re + 25)). Also, P is as in identity (2.5). To estimate |Ad|, we consider each residue class, mod d, separately. We get w = £ £ i - E f f + o w ) - <»•»> l<l<d Y-X<n<X I ^ ' f(l)=0 (mod d) n=l (mod d) The inner sum over re was estimated by expressing re as I + dm, so m is confined to an interval of length X/d. Letting p(d) represent the number of roots of the congruence /(/) = 0 (mod d), we then get \Ad\=X^ + 0{p{d)). (2.12) Chapter 2. Sieve Notations and Preliminaries 6 Using this in Legendre's Identity (2.10), we get S(A,P) = 5 > ( d ) | A i | d\P - * n ( i - ^ ) + ° f e * < > y <"3) P<2 V F / \d\P J The function p just mentioned plays a very important role in Sieve Theory. It is related to another concept known as sifting density, or dimension of a sieve. The function p has a sifting density K if a certain average of p(p) at primes p is not greater than K (and the sieve is said to have dimension re). For twin primes, p has a sifting density of 2 since f(n) — n(n + 2) = 0 (mod p) has 2 roots for primes p > 3 and 1 root for p = 2. Similarly, one can check that p has a sifting density of 2 for more general prime pairs, where f(n) = n(n + 2B). We will see later how the sifting density concept is defined for sieves in general. It also turns out that the following assumptions can be made about the function p: (1) 0 < p{p) < p when p | P (2) p(p) = 0 whenever p \ P . Convention: p(d) ^ 0 only when d \ P means that the condition d \ P may be omitted from any sums involving p(d). Definition 2.3 When Ad, X, and p{d) are specified, define the "remainder" rA{d) by \Ad\ = X ^ - + rA{d) if d\P, d<D. (2.14) a Identity (2.14) will be applicable with p a multiplicative function and D to be specified. Apparently, in many sieve problems, including the applications to twin primes and general prime pairs, \rA(d)\ < p(d). (2.15) Chapter 2. Sieve Notations and Preliminaries 7 Now recall we mentioned fi will be replaced by a different function A. In fact, functions A£, A ^ are constructed/chosen so that £ < £ / x ( d ) < £ A + ( d ) when B \ P. (2.16) d\B d\B d\B The idea is to pick A J , A# in a way that the inequalities are effective in a given sifting situation for relatively large products P. Also, D wil l have the property \±(d) ^ 0 => d < D, (2.17) Definition 2.4 When inequalities (2.16) and (2.17) hold, we say that A + , A -are (respectively) upper and lower sifting functions of level D for the product P. Definition 2.5 Define the expression V(P) by v w _ E ^ = n(i_<*e>). (2.i8) d\p P\p ^ y ' V+ and V~ are similarly defined where u. is replaced by X+, \~ respectively. This along with identity (2.15) and D/d > 1 gives the following useful result: E w « » E ^ ^ n ( ' - f ) " ' = ^ («») d\p d\p p\p v F J v ' d<D d<D Using all the information so far, we now get the essential Meta-theorem of Sieve Theory: Theorern 2.1 When A satisfies identity (2.14) and X± satisfies inequality (2.16) we obtain- '> " . XV-(D, P) + R-(D, P) < S(A, P) < XV+(D, P) + R+(D, P), (2.20) where S is as in identities (2.8) and (2.9) and v ± [ D j p ) = £ m ? m , R ± { D , P ) = £ \%(d)rA(d). (2.21) d\P d\P Chapter 2. Sieve Notations and Preliminaries 8 Proof: Taking B = (a, P) in inequality (2.16) and summing over a G A as in Legendre's Identity (2.10), we get Y,W)\M < s(A, p) < ] T A M • d\P d\P Making use of Identity (2.14) we now have A5(d) (x4& + rA(d)) < S(A, P) < £ AS(«0 (X4& + rA(d)) , d\p ^ ' d\p ^ " / from which the statement of the theorem follows. Q.E.D. The goal, therefore, is to find and choose A* and D so that i t 4 are relatively small in comparison to XV^, and much work is done in estimating V± and R±. It turns out that things can be done in such a way that A ^ ( l ) = 1 (this is known as a normalizing constraint), and we will also get | A £ ( d ) | < l for all d. (2.22) As a result of this, we have the following ^2\i(d)rA(d) d\P <EMrf)l d\P d<D from which we get a Corollary of Theorem 2.1: Corollary 2.1.1 Suppose identity (2.14) and inequalities (2.16) and (2.22) hold. Then xv-(D, P)-J2 ^ S(A, p) ^ xv+(D, P) + J2 M < * ) l • d\P d\P d<D d<D Sifting Density: We mentioned earlier that the function p has a sifting density K if a certain Chapter 2. Sieve Notations and Preliminaries 9 average of p(p) at primes p is not greater than K. In many situations, the following is true: E £ ( p ) l o g ( p ) = K l o g ( 2 ) + 0 ( 1 ) ( 2 2 3 ) p<z P When dealing with twin primes, for instance, we had p(p) — 2 for primes p > 3 and p(p) = 1 for p = 2. In this case, identity (2.23) follows from identity (2.1) with K = 2 (as desired). It turns out that in many sifting arguments, working with identity (2.23) can lead to annoying complications such as p depending on the size of A in some sense. Such complications are avoided, therefore, by using alternate for-mulations of the sifting density concept. However, the various formulations for sifting density are equivalent in the sense that one can be obtained from the others using the techniques of partial summation. Also, these formula-tions wil l not disagree with the K = 2 density for twin primes and general prime pairs. Definition 2.6 We say that K is a sifting density for the function p if there exists a constant L > 1 (depending on K) such that if2<w<z, with KW<1 + -4-r- (2-25) In some cases a bit less is used: There exists a constant K > 1 such that KW<K when w>2. (2.26) Note: The choice w = p, z = p + e shows that inequality (2.24) gives ! _ PMy\.< Kp} '•/, V(2-.27) so p(p) is bounded away from p: p(p) < p(l — \/Kp). Also, notice that « is not uniquely defined. If inequality (2.24) holds.for some Ko, then it holds for K > Ko- For some sieve techniques, the following definition is used, in which will be unique (provided it exists). Chapter 2. Sieve Notations and Preliminaries 10 Definition 2.7 We say that K is a two-sided sifting density for p if it satisfies Definition 2.6 and, additionally, there exists L > L (depending on p) such that M > f 1 _ r 4 _ u ^ 4 y « 2 < w < z . (2.28) V{P{z)) - \ \og(w)J \\og(w)J ~ • v ' For the Selberg Sieve, it turns out that it is more convenient to use something slightly stronger than Definition 2.6. Definition 2.8 Let g(d) be the multiplicative function defined for squarefree d by specifying for primes p: • (2.29) P - p[p) Using this definition, we can replace inequality (2.24) by specifying the exis-tence of a constant A > 1 such that ^2 g(p) log(p) < /dog (—) + A when 2<w <z. (2.30) w<p<z Note: As stated by Lemma 2.4 to follow, inequality (2.30) implies the usual sifting density hypothesis/definition (2.24). Many sifting situations, including that of twin primes and general prime pairs, satisfy both inequalities (2.24) and (2.30). In particular, the next lemma applies to the twin prime and general prime pair scenarios. Lemma 2.1 Suppose p{p) < p when p < K and p(p) < K for all p. Then p has sifting density K, in the stronger sense expressed by inequality (2.25), and also satisfies inequality (2.30). Proof: The inequality p(p) < p guarantees p(p) < p(l — 1/K) when p < K, for a certain K > 1 depending only on n, so that (1 — < K for these p. Mertens' product (2.3) shows that Chapter 2. Sieve Notations and Preliminaries 11 where the O-constant may depend on K. When w > K this gives w<p<z x p J - \log(w)J A Vog(w)JJ JU, (\ _ s) • The last product over primes p is exp V.Si "V v> - \ VI) ~ \ £ c \f = - P ( o ( i - 1 + 0 (I), ( 2 . 3 1 ) so inequality (2.25) follows, with some value of the constant L. It also holds when w < K, possibly with a larger value of L, because the contribution from primes p < K to the product in inequality (2.24) is bounded. In a similar way observe when w > K v-p^ ~ J k < * p - K " K w J where we used identity (2.1). Thus inequality (2.30) follows for these w, and remains valid for smaller w because g(p) is bounded when p < K. Q .E .D. We are now finally ready to discuss the Selberg Sieve but first we record the next four lemmas for completion and referral. See [4, Section 1.3.5] for their proofs and more detailed information on sifting density. The first two lemmas deal with Partial Summation where use of the notation of Stielt-jes integrals is convenient. Using integration by parts, one can take as a definition: f f(t)d(c(t)) = c(z)f(z)-c(w)f(w)- f f'(t)c(t)dt (2.32) J W J W when / ' is piecewise continuous on [w, z] and c is of bounded variation. Chapter 2. Sieve Notations and Preliminaries 12 Lemma 2.2 Define c(x> y)= Y 0/1 x<n<y whenever the indicated numbers Cn are defined. (i) If w < z and f is piecewise continuous on [w, z], then J2 °"Kn) = [Zf(t)d(C(w, t)) = - ['f(t)d(C(t, z)), (2.33) w<n<z Jw Jw where the integrals with respect to t are given by identity (2.32). (ii) Suppose, in addition, that f is positive and monotone in [w, z] and that C(x, y) is given by an expression C(x, y) = -y(y) - f(x) + e(x, y), where e(x, y) < E whenever w < x < y < z. Then °nf(n) ^ fZ f(t)d(j(t)) + EmBx{f(w), f(z)}. (iii) If f and g both satisfy the conditions required of f in parts (i) and (ii) then J2 cnf(n)g(n) < f f(t)g(t)d(7(t)) + E ( max f(u)) ( max g(v)) . Lemma 2.3 Suppose that, when t and n are in an interval [x, y), f'(t) is continuous and f(t) is positive and decreasing, g(n) > 0, and E(t, n) < A. Then f. /(*) d(J2 9in)E{t, n) ) < A Y, f(n)g(n). Jx<t<y \x<n<t ) x<n<y Lemma 2.4 Suppose p is such that the function g satisfies (2.30). Then the sifting density hypothesis follows in the form (2.25), with K < e ^ I o g W = 1 + L l o g ( i u ) Chapter 2. Sieve Notations and Preliminaries 13 Lemma 2.5 Suppose that p has sifting density K, and that 2 < w < z. (i) When inequality (2.26) holds we find Pip) log(p) £ ^ ^ < ( « + log(X))log(z). (2.34) z—' p W<p<Z (ii) If inequality (2.25) holds then W<p<Z Furthermore the function g(p) defined in identity (2.29) satisfies £ ( 2 ' 3 7 ) l o g ( * ) £ g(p)\og(p) < « l o g ( ^ ) + L ( l + « ) l o g ( e w<p<z ^ s>\ J I? \og{w)' (2.38) Chapter 3 The Selberg Sieve 14 3.1 The Set-up 3.1.1 Selberg's Main Theorem The main goal of this section is Theorem 3.1.1. It seems a bit artificial at first glance and one wonders how it was conceived, but keep in mind that Theorem 3.1.1 is the end result of a series of discoveries. The main thing to focus on here is the upper bound (3.1.9) for S(A, P). G(\fb~) is as m identity (3.1.4) and it is being used in Theorem 3.1.1 because, as will be seen later, it can be estimated in such a way that we get nice results/estimates for the upper bound (3.1.9) for S(A, P). The rest of Theorem 3.1.1, i.e., identity (3.1.10) for the error term and identity (3.1.11) involving A, are consequences of Lemma 3.1.1. In turn, Lemma 3.1.1 gives several identities, (3.1.6), (3.1.7), (3.1.8), that are conse-quences of identity (3.1.5) for V + ( A ) and are relevant to the proof and result of Theorem 3.1.1. The identity (3.1.5) shows up in the proof of Theorem 3.1.1 as a result of Selberg's clever idea: inequality (3.1.14) involving the square of the sum of the A values. We first recall the following: \Ad\=X^- + rA(d)iid\P, d<D (3.1.1) a where \Aa\ is the number of a in A divisible by a squarefree number d, and p is multiplicative. The symbol [di, c^] denotes a least common multiple. The function p* will be the multiplicative function "conjugate" to p in that its values at primes p are given as ... p* =p-p(p). (3.1.2) Chapter 3. The Selberg Sieve 15 This defines p*(d) for squarefree d, the only d that will be relevant. Then the function from identity (2.29) is a ( n \ = I p(n)/P*(n) i f n is squarefree , y K ' \ 0 otherwise. \ • • > In Theorem 3.1.1 and elsewhere we shall denote G ( z ) = X>(n), (3.1.4) n|P where P is a specified product of primes. In Lemma 3.1.1, the numbers X(d) may be arbitrary, subject only to a restriction that they are supported on an interval 1 < d < VT), so that all the sums appearing in Lemma 3.1.1 are finite. The restriction to p(h) ^ 0 in identity (3.1.6) is a natural one, because for other h the summand x2(h)/g(h) is a multiple of p(h) as follows: identity (3.1.7) gives p(h) \ x(h), so that x2(h) = p2(h) • I, for some I. Now x2(h) _ (x2(h)p*(h)) (p2(h).l-p*(h)) 9(h) pih) p(h) so after cancellation of p(h) from the numerator and denominator, the sum-mand is a multiple of p(h). Lemma 3.1.1 Define v+(\)=YE 7 T p • ( 3- l 5) dx\Pd2\P 2* Then h<VB y v ' where g is as in identity (3.1.3) and x ( h ) = E ( 3 1 7 ) d=0 (mod h) Moreover = 5 > * W H ) : (3 :1.8) Chapter 3. The Selberg Sieve 16 Proof: Using [di, ofo] = d\d2/(d\, d2) in equation (3.1.5) gives V+(\)= S^S^ Kdi)p(di) Kd2)p(d2) (di, d2) p((di,d2))#0 Since f = (d\, d2) is squarefree, the last fraction may be expressed as / We therefore have, v+t\\- \ ^ V ^ A(c?2)p(ti2) ^ 1 ( A ) - 2 ^ 2 ^ 5; ^ 2_. zThy di d2 1 2 h\{dud2) y K ' p((di, d2))#0 Rearranging the order of summation gives V W ~ 2^-g-{K) 1 , J, ^ d2 h<s/D di=0 (mod h) d2=0 (mod h) X2(h) h<VD W which is identity (3.1.6), where x(h) is as in identity (3.1.7). Lastly, identity (3.1.7) inverts to give mN=d k\m KN)p(N) N ' which is identity (3.1.8). Here we used the characteristic property (2.4) of the Mobius function. Q.E .D. Chapter 3. The Selberg Sieve 17 Theorem 3.1.1 Suppose identity (3.1.1) holds. Then S(A, P)<-jX-. + E{D, P), (3.1.9) where G is as in identity (3.1.4), E(D, p) = jm) E E WM<k)rA([di, d2\), (3.1.10) d1<VDd2<VD di\P MP and the real numbers X(d) are given, for some C ^ 0, by ^M = Cp(d) Yl 9(h) ifp(d)^0, (3.1.11) h=0 (mod d) h<VD, h\P with \{d) = 0 if p{d) = 0. Some Notes: Taking d = 1 in equation (3.1.11) shows C = ^ L . (3.1.12) The usual normalization in Theorem 3.1.1 is to make A(l) = 1. The value of X(d) when p(d) = 0 is irrelevant to the coefficient of X in Theorem 3.1.1. The choice X(d) = 0 for these d is the most efficient one when the error term E(D, P) is considered. Since g is as in identity (3.1.3), substituting h — dk in equation (3.1.11) gives X(d) = Cp(d)-£- £ g(k). (3.1.13) p ^ ' (fc,d)=i k<s/D/d, k\P Proof: Suppose, for the moment, that X(d) are arbitrary real numbers supported on squarefree d < \fD. We start with Selberg's brilliant idea A 2 ( l )S (a , P)< ( £ X(d)\ . (3.1.14) Vd\(a, P) ) Chapter 3. The Selberg Sieve 18 This holds because if (a, P) = 1, then S(a, P) — 1 and both sides of inequality (3.1.14) take the value A 2 ( l ) , but if (o, P) > 1, then S(a, P) = 0 and the right side is non-negative. The right side of inequality (3.1.14) can be written E E ¥ ) A W = E E a ^ ) W E 1-di\(a, P) d2\(a, P) di\Pd2\P [du d2]\a On summing over a G A and expressing the result in terms of p from identity (3.1.1), this gives \2(1)S(A, P) < XV+{\) + \2(1)E(D, P), (3.1.15) with V+(\) as in identity (3.1.5) and E(D, P) as stated in identity (3.1.10). If we had A(l) = 1, then we would have achieved the result of Theorem 2.1. The conclusions of Theorem 3.1.1 are achieved by minimizing V+(\), thereby getting the best bound possible for S(A, P). We now proceed to show how this is done. In discussing V+(X) we may streamline the notation by using the con-vention that p(d) = 0 if d \ P, together with a natural one that terms with p(d) = 0 are not to be included in summations over d. This wil l save a certain amount of repetition of the conditions d \ P or p{d) ^ 0, where these are implied. Similarly, the conditions d < y/TJ, p2(d) = 1 need not be explicit in a sum involving \(d). Theorem 3.1.1 will follow by choosing x(k) so as to minimize, for given A(l ) , the expression (3.1.6) for the quantity V + ( A ) . The constraint E t*(k)x(k) = A(l) (3.1.16) k<VD is now required by identity (3.1.8). We wil l use Cauchy's inequality ( E A ^) ^ E A ' E 6 ^ \h<H / h<H h<H which holds with equality when there is a constant C with = Cbh whenever h < H. This is an immediate consequence of the identity \ ' E al E bl - (E A H B H) = \ ( E AHBK -AKBH) • h<H k<H \h<H J \h<H, k<H J Chapter 3. The Selberg Sieve 19 Apply Cauchy's inequality to the condition (3.1.16) in a way that relates to identity (3.1.6) for V+(\): * E § E *(*)) * ^(A)G(V5), (3.1.17) \fc<>/5 y K ' J \k<VD ) where G(\fD) is as stated in identity (3.1.4). Equality occurs in (3.1.17) if x(k) = Cp(k)g(k) when k < y/D, (3.1.18) in which case inequality (3.1.15) gives the conclusion (3.1.9) required in The-orem 3.1.1. This situation is attained if we make A(d) satisfy equation (3.1.8) with these x(k), so that X(d)p(d) = C £ p(k)p(kd)g(kd) = Cp(d) J2 9(h). k<VD/d h=0 (mod d) h<VD This is the value stated in equation (3.1.11), in which the implied constraint h | P was written explicitly. Q.E .D. 3.1.2 Bounding X(d) The following theorem states that [X(d)\ < |A(1)|. Keep in mind that the usual normalization in Theorem 3.1.1 is to make A(l) = 1, so Theorem 3.1.2 provides a nice, convenient upper bound on X(d). For given d, a squarefree number h may be written uniquely as h = fn, where / | d and (n, d) = 1. Hence E 9(h) <J2 9(f) E 9(n). (3.1.19) h<VD f\d (n, d)=l n<y/D Chapter 3. The Selberg Sieve 20 Observe from identity (3.1.2) that for squarefree d the sum over / in (3.1.19) is As before, the fact that / , n and h divide P may be taken as implicit in the definition of the function p. Theorem 3.1.2 The numbers \(d) described in Theorem 3.1.1 satisfy the inequality \X(d)\ < |A(1)|. Proof: Let C be the normalizing constant as in identity (3.1.12), so that A(l) = C £ g(h). h<VB This leads to the following inequality which is in the opposite sense/direction to inequality (3.1.19): | A ( 1 ) | > | C | £ 5 ( / ) £ g(n). (3.1.21) f\d (n, d)=l n<VT>/d With the identity (3.1.20) this gives i — by the expression (3.1.13) for \(d). | A ( 1 ) | > | C | ^ £ 9(n) = \X(d)\, (n, d)=l n<s/D/d Q.E.D. Corollary 3.1.2.1 In Theorem 3.1.1, the error term satisfies E(D, P)< £ ^ - M ^ x , d2})\. di<VD d2<y/~D di\P d2\P Proof: The result immediately follows from identity (3.1.10) for E(D, P) and the previous theorem. Q.E.D. Chapter 3. The Selberg Sieve 21 3.2 Estimates for G(x) and E(D, P) We would now like to get some estimates for G(x) and E(D, P). We address each of these in turn. 3.2.1 Using Rankin's Device To get estimates for G(x), we will define a useful, related expression, Gz(x). Then the next theorem will provide upper and lower bounds for Gz(\/D), where the only assumptions about p used are: (1) 0<p(p)<p (2) - L - \ 2 P { P ) l ° g i P ) <B (by Lemma 2.5), (3.2.22) ^ ' p<z P where B is a constant. The proof of the theorem relies on the next lemma, which provides an upper bound for Iz(x) = Gz(oo) — Gz(x). The proof of the lemma uses a technique known as Rankin's device; it wil l be pointed out. In connection with G(x), we have the "incomplete" sum Gz(x) = g(d). (3.2.23) d<x d\P(z) This is considered "incomplete" because the sum is over all d dividing P(z) (not P) whereas the sum for G(x) is over all d dividing P. (Recall: P(z) = n p |p ,p< 2 P )• For future reference recall that the equation g(p) — p(p)/(p — p(p)) introduced earlier can be rewritten as 1 - ) 9 ( P ) = M , 1 + 9 ( P ) = ( j - < M ) " ' . (3.2.24) Observe that Gz(x) increases with z, so \. •• •. " ' •• G(x) - Gx(x) > Gz(x) (3.2.25) when z < x. In Theorem 3.1.1, a lower bound for G(x) is required (with x — \fD), so a lower bound for Gz(x) is relevant.. It is natural to denote G,(oo) = £ 9{d), d\P(z) Chapter 3. The Selberg Sieve 22 so that Gz(x) = Gz(oo) whenever x > P(z). Observe, referring to the identities in (3.2.24) where necessary, <?,(*) < G, ( oo) = n ( i+ 9 (p) )=• n f 1 - pjf)1=™W p\P{z) p\P(z) V y / V V >> (3.2.26) We see here a connection between Gz(x) coming from Selberg's method and the product V(P), but the inequality is in the wrong direction. The next theorem will give us what we seek, but first the lemma. Lemma 3.2.1 Suppose that the assumptions (3.2.22) about p hold, and de-note Iz(x) = G z(oo) - Gz(x) = £ g(d), (3.2.27) d>x d\P{z) and write x — zv. Then for each c > 0 Iz(x) < ^ ^ e x p ( - c t ; + B ( e c - 1)). (3.2.28) In particular where, for each v > 0, ipB(v) = max JO, v log - v + = J log (Jj^j Proof: dt. We use Rankin's device. Letting e > 0, we observe that when d > x, we have (d/x)€ > l e = 1, so we get Chapter 3. The Selberg Sieve 23 /,(*) = J2 9(d) < £ g(d) (±Y d>x d>x ^ ' d\P(z) d\P{z) * E +!>«(£) d>x v 7 d<x v 7 d|P(*) d|P(^) = E 9(d) (I)'= ±; T, 9(d)d< d\P{z) v ' d\P(z) = h II(1+P£^))- (3-2-30) X p\P{z) Hence, by the definitions of V(P(z)) and g(p): ' • w ™ 4 n ( ^ ) ( . + ^ ) the last inequality following from the fact 1 + x < ex. We may choose e = c/log(z), provided c > 0. Then ze — ec. Observing that (e* — \)/t increases when t > 0, we have when p.< z, pe — I e clog(p)/16g(z)-J_ j g'c _ ]_ - • elog(p) clog(p)/log(z) ~ c It follows that f - 1 < — ( 6 l o g ( p ) ) = ^ • - 4 - • log(p) = (ec -c c log(z) log(z) and when x = zv, xt = (zv)£ = (ze)v — (ec)v — e00. Using these facts along with the assumptions (3.2.22) about p, and the fact that summing over p < z Chapter 3. The Selberg Sieve 24 < eu is greater or equal than summing over p | P(z), we now have Iz(x)V(P(z)) < l e x p f £ ^ f y - l ) | \m>) v J < exp (-cv + B ( e c - 1)), as required for inequality (3.2.28). The optimal choice of c satisfies v = Bec, i.e. c = log(f) — log(S), provided v > B. If v < B then the best permissible choice is c = 0. This yields inequality (3.2.29) and the proof is complete. Q.E .D. Theorem 3.2.1 Suppose that the assumptions (3.2.22) about p hold, where z>2, and write z = D1/S. Then GZ(VD), as defined by (3.2.23), satisfies nPjz)) - G z { V D ) - nPjzTy ( 3 - 2 - 3 1 ) where ipB is as in the last lemma. In particular, ^ b Q s ) ~ ^ s i ° s ( s ) a s s -> °°. e x p ^ - V t e Q s ^ < e7B~a for all s > 0. Proof: The second inequality in (3.2.31) is just (3.2.26). The proof of (3.2.31) is completed by noting that inequality (3.2.26), identity (3.2.27), and inequality (3.2.29) give r i~\ r tn~\ r r~\ -> 1 ~ exp(-^ B ( t ;)) Gz(x) = G 2(oo) - Iz(x) > V{P(z)) ' Chapter 3. The Selberg Sieve 25 and taking x = VD, so that the notations zv = x and z = D1^ require v = | s . We get exp(V>B(|s)) < e7B~s by taking the choice c = 2 in the last lemma and noting that e 2 — 1 < 7. Q.E.D. 3.2.2 An Asymptotic Bound Though the last theorem provided a lower bound for GZ(\/~D), it is not the sharpest result. It turns out that in many applications of Theorem 3.1.1, one wishes to estimate Gz(x) from below in the case when z = x. The next theorem provides a much desired, sharp asymptotic lower bound. The proof of the theorem makes use of ]TS(P) log(p) = K\og(v) + n(t/) (3.2.32) p<v where ri(t) is required to be bounded above. This is actually a little stronger than what is given by Lemma 2.5. It is possible to proceed just based on Lemma 2.5 but using (3.2.32) makes things a bit easier. For the sifting situations we're interested in, n(t) will indeed be bounded above, allowing us to make use of Theorem 3.2.2. The proof of the theorem also relies on the next lemma, which gives an integral equation for Gz(x). To facilitate the lemma we write a („\ - J 9(n) if n \ P(z) 9 z 1 j ~ \ 0 otherwise, so the expression (3.2.23) becomes Gz(x)= 9(n)=52gz(n). (3.2.33) n<x n<x n\P(z) Lemma 3.2.2 When.z < x the expression Gz(x) given in (3.2:33) satisfies fx dt rx dt Gz(x) log(x) = / Gz(t)- + K / Gz(t)- + Sx(x), (3.2.34) Jl t Jx/z t where Sz(x) is expressible as , 6z(x) = Y,9z(n)Ez,n(^ with Ez<n(t)<v(mm(t, z)) (3.2.35) n<x Chapter 3. The Selberg Sieve 26 Proof: Since m is squarefree when gz(m) ^ O w e have J ^ & ( m ) l o g ( m ) = YJ2gz(np)\og(p) n p np<x J29z(n) E 3(p)log(p) r i<a: p<x/n p<z ~ E ^ n ) E 3(p)log(p), n<x p<x/n, p<z p\n where the second equality follows from g being multiplicative and m being squarefree. Write n = pk in the last sum. This gives E 9z{m) log(m) = ]T&(n) £ tf(p)log(p) m<x n<i p<x/n p<z P<2, pffe E*(n)F,,B ( £ ) , where the use of equation (3.2.32) shows FzM = E ^ p ) l o g ( p ) _ E 5 2(p)log(p) P<V P<y/V, P<2 P < Z (P,n)=l < E 9 ^ l o g ^ = K l o g C m i a C y . -2)) + (^min(y, z)). p<y p<z Hence _ ' E 9z(n) log(n) = K E 2*( n) l o S ( m i n (~> z ) ) + s » ( x ) n<x n<x = « E 5 » l o g ( ^ ) - « E ^ W ^ g f ^ ) +*z(x), (3.2.36) n<a; n<x/z' Chapter 3. The Selberg Sieve 27 where, setting EZtn(y) = Fz>n(y) - relog(y), we have U x ) = Ygz(.n)EZtn with EZtn{t) < ?7(min(i, z)), (3.2.37) n<x the desired expression for Sz. The last equality of (3.2.36) is best seen by looking at the two cases: when x/n < z, x/z < n making the second sum equal to zero, and when z < x/n, the difference agrees with the expression after the first equality in (3.2.36). Next, note the following, valid for x > 1, m<x m<x J m J i m<t Using this and the definition of Gz(x), we can rearrange and rewrite (3.2.36) to get fx dt rx/z dt Gz(x) log(x) - (« + 1) J Gz(t)j + KJ^ Gz(t)j = 6z(x). This is equivalent to equation (3.2.34), so the proof is complete. Q.E.D. Theorem 3.2.2 Let G(z) = Gz(z) and n(t) be as specified in (3.2.25), (3.2.23), and (3.2.32). Assume n{t) < A when 2 < t < z (3.2.38) where A > 1. Then • . ' G ' ^ r ( . + TO(1 + ° ( i 4 ) ) ' ( 3 ' 2 ' M ) where V(P) is as defined earlier. The implied' constant depends only on K. In (3.2.39) we may use = - 7 « • ^ ( - ° ( ^ ) ) n ( - J ) ' 0 - f r -(3.2.40) V (P(X)) X , p < x Chapter 3. The Selberg Sieve 28 Equation (3.2.40) follows from Mertens' product discussed earlier. The form on the right (with x = z) is what wil l be seen in the following proof. Proof: This theorem refers to Gz(x) only in the case z = x, and Lemma 3.2.2 gives fx dt G{x) log(x) = (K + 1) J G(t)j + 6(x), (3.2.41) where *(*) = 5 > ( n ) i ^ (£) . (3.2.42) n<x The primes p exceeding z are irrelevant to the theorem since all functions involving primes are only concerned with primes less than or equal to z. Therefore for present purposes, re-define p(p) for p > z by specifying 1 - M = ( 1 . I Y if p > z . (3.2.43) p V P) This will make questions relating to the convergence (as x —> oo) of the product in equation (3.2.40) become trivial. Also, when p > z the function g as in identities (3.2.24) now satisfies g(p) = Pfr) = P(P)/P = (P(P)/P) + 1 - 1 _ - (1 - P(P)/P) + 1 p-p(p) l-p(p)/p l-p(p)/p l-p(p)/p The last equality follows from the binomial theorem and the two equalities before that follow from (3.2.43). Now inequality (3.2.38) extends to an in-equality valid also when t > z, rj(t) < Ai < A when 2 < t, (3.2.45) where the constant A\ may be somewhat larger than A. Using Stieltjes integrals, equation (3.2.41) leads to G(t) log K ( i ) ' (3.2.46) Chapter 3. The Selberg Sieve 29 This is best seen as follows. Re-arranging (3.2.41) gives 5(x) = G(x) log(s) - (K + 1) J* G(t) Differentiation gives dt dS(t) = (d(G(t)) log(t) + G(t )y) - (« + = d(G(t))log(t) - K^-dt , t thereby giving ^77T = (<*«?(*)) log(t) - A ) . (3.2.47) log K + 1 (£ ) log" + 1 ( i ) Now we also compute the following G® ^ = d(G(t))log-"(t) + G(t){-K\og-K-\t))ldt logK(*) d(g(t)) bg(t) 1 G(t) l og K + 1 ( i ) Iog"+1(<) « = ^ ^ ( d ( G ( t ) ) l o g ( t ) - « ^ i f t ) . (3.2.48) Equating (3.2.47) and (3.2.48) and integrating yields (3.2.46). Denote ( 3 ' 2 ' 4 9 ) Then, for 2 < x. < y, (3.2.46) and (3.2.42) give Here En(t/n) < "because of identity (3.2.35) and inequality (3.2.45), so Lemma 2.3 applies, to give H{y)-H(x)<A1 £ (3.2.50) x<n<y 6 \ J • Chapter 3. The Selberg Sieve 30 The sum in (3.2.50) can be expressed in terms of the function H by a "con-densation" procedure. Choose c > 1. When U > 2 we find v g(n) 1 G(UC) 1 uhu>^+1(n) ~ log(C7) log«([/) log([/) ^ j-The last equality follows from (3.2.49) and basic rules of logarithms. So we now have n<y Using this in (3.2.50) gives H(y) - H(x) < sup ff(*), (3.2.51) log(x) x < t < y with A2 = CJ4I. Here we have C = C K Y - . c r>0 Now choosing C = 1 + 1/(K + 1) ensures | l / c | < 1 so that we get r* V - = cK -r>0 v C K + 1 H — rK u ~ ° ' ~ ~ - ( i / c ) ~ c - r Finally, using the fact that ( l + ( l / n ) ) n < e for all n > 0, (see [7, pgs. 63-64]), we have c - i i / ( « + i ) V K + i y Now let 0 < e < ^, and let J — l i m s u p ^ ^ , H(t). Then J is finite, for otherwise there would exist a sequence yn such that H(yn) -»• 00 as n —>• 00, #(y n ) > (1 - e) sup H(t), t<yn and combining with inequality (3.2.51) then gives 1 — e < A2/log(x), which is false for large x. Chapter 3. The Selberg Sieve 31 If x is sufficiently large, then sup x< t H(t) < J + e. We can choose y > x so that H(y) > J - e. We manipulate inequality (3.2.51) and use these inequalities to get H(x) > H(y) - sup Hit) log(--c) x<t<y > H(y)--^-AJ + e) \og{x) Ai Ai log(x) log(x) = J | 1 _ R 4 T V - . f i + ^2 log(x) / V !og(x)y Now take 0 < e < J / log(x) , so that with identity (3.2.49) we have ° { X ) =H(x)>j(l + o(-^-)), (3.2.52) log"(x) - ^ ~\log(x) initially for sufficiently large x, and so for x > 2. We need a partial identification of the constant J. For this purpose we have the following Dirichlet series: * . M - E ^ = II(I + ^ ) n=l P since g is supported on squarefree numbers. Recalling integration by parts and,Lemma 2.2 with C = G and f(t) = l/ta, when s > 0 we have w = E^- /><*» Now G ( l — e) = 0 for every e > 0 and l im^oo G(t)/ts — 0 so we just get /oo G(t)d(t-) Chapter 3. The Selberg Sieve 32 Appealing to inequality (3.2.52) and then using the substitution u = log(i), we get /oo G(t)d(t-) /oo (J + o(l))logK(t)d(rs) poo = s (J + o(l))uKe-sudu Jo JT(K + 1) . ~ — i '- as s ^ 0 + , sK where the quantities o(l) are as t —• oo and u —+ oo. The last approximation above follows from the definition of the Gamma function: xr-xe-xdx , with the substitutions r = K + 1 and x — su (so dx — s du). We now recall some facts about the Riemann £ function: (2) £(s + 1) has a simple pole at s — 0, and ((s + l )s —• 1 as s —> 0. Using these facts along with the inequality we have for Zg(s), we get the following: l imsuPIT (1 - - = r V (1 + —) = l i m s u P < J - T ( * + I). (3.2.53) Our choice (3.2.43) of p(j>) when p > z ensures that the product on the left converges when s = 0, being in fact finite for this s. Observe when z < x < y the contribution to (3.2.53) from large p is Chapter 3. The Selberg Sieve 33 Because of equation (3.2.44) the summand is 0 ( l / p 2 ) when s > 0, so the sum converges uniformly to a sum continuous in s > 0. That is, the product in (3.2.53) is continuous in s > 0. It is now easy to infer -l -<K+1>,nHH-f) Theorem 3.2.2 now follows in the form using identity (3.2.40) on taking x = z in inequality (3.2.52). Q.E .D. 3.2.3 The Error Term The following theorem provides an upper bound estimate for the Error term, E(D, P(z)), in Theorem 3.1.1. Theorem 3.2.3 Suppose that equation (3.1.1) holds with \rA(d)\ < p(d), pip) > 1 when p \ P, (3.2.54) and that p has sifting density K. Then E(D, P{z)) « £ > l o g 2 K ( z ) . Proof: Corollary 3.1.2.1 and (3.2.54) give Then dl<VDd2<VD \d<VD,d\P di\P d2\P d<VD d\P{z) p<z d\P(z) Here K ( P ( z ) ) _ 1 <S K\ogK(z) because p has sifting density K, so the final result follows. Q.E .D. Chapter 4 Twin Primes 34 Recall that a twin prime is a pair of prime numbers that differ by 2. They can be represented as (p, p + 2), where both p and p + 2 are prime. We will now take a look at two methods for finding twin primes and then explore how Selberg's results apply to these methods. 4.1 Sifting for Twin Primes As mentioned in the introduction, after conducting the sieve of Eratosthenes to the set of numbers from 1 to N, one can then identify those primes that differ by 2, i.e. twin primes. There also exists a different sifting approach that yields all twin primes except (3, 5). We provide examples of both approaches and also prove that the alternate sifting method works. 4.1.1 A n example of the Sieve of Eratosthenes For N — 36, we cancel all proper multiples of primes less that or equal to y/N = 6 (i.e., 2, 3, 5) and obtain 1 and all primes p where 1 < p < N. We then observe that (3, 5), (5, 7), (11, 13), (17, 19), (29, 31) are twin primes. Note: In the following display of numbers and in those to follow through-out the paper, there is no special significance to the direction of the strokes. What is of some importance is that some numbers are cancelled more than once. 1 • 2 3 ^ 5 # • ; • • 7 $• ? n i i n 13 ^ ty 17 ty 19 2"jf 2i 1% 23 U 25 -2v 2V 2^ 29 ffl 31 3? 3^ 3^ 36 3? Chapter 4. Twin Primes 35 4.1.2 An Alternate Sieve for Twin Primes It turns out that one can obtain the twin primes (except (3, 5)) without the other primes by using a slightly different sifting approach to that of Eratosthenes. This new sieve actually yields twin primes in an indirect way in that it gives the numbers k, where both 6k — 1 and 6k + 1 are prime; i.e. a twin prime. The sieve also makes use of the observation that i£ 6A; — 1 (or 6k + 1) is not prime, then it has a prime factor less than or equal to y/6k — 1 (or VOk + 1).' We start with all the integers from 1 to N. Since N is the largest possible "k", the largest possible twin prime is (6N — 1, 6N + 1). As such, we need only worry about prime factors less than or equal to y/6N + 1, except for 2 and 3 since 2, 3 \ 6k — 1, 6k + 1 for any k. For each prime p, where 5 < p < \/6N + 1, we define ap, bp by 6ap —1 = 0 (mod p), 0 < ap < p 6bp+l = 0 (mod p), 0<bp<p. We observe that bp = — ap (modp). Then starting with 2-g-^, we cancel all numbers that are ± a p (mod p). A l l remaining numbers, k, yield a twin prime: (6k — 1, 6k + 1). Also observe that the process only makes sense for N > 4. For N — 1, 2, 3, there is nothing to do since each of 1, 2, 3 yields a twin prime. An example of the Alternate Sieve For N = 48, we worry about prime factors p where 5 < p < y/6N + 1 = y/289 = 17, i.e.,-5, 7, 11, 13 and17. For 5, ap — 1, and cancellation starts with ^ j p = 4. For 7, ap — 1, and cancellation starts with ^ p . = ' 8 . For 11, ap = 2, and cancellation starts with 1 1 6 - 1 = 20. For 13, ap = 2, and cancellation starts with 1 3 g - 1 = 28. For 17, ap = 3, and cancellation starts with 1 7 g - 1 = 48. We therefore cancel everything starting with 4 that is ± 1 (mod 5), then cancel everything starting with 8 that is ± 1 (mod 7), then cancel everything starting with 20 that is ± 2 (mod 11), then cancel everything starting with Chapter 4. Twin Primes 36 28 that is ± 2 (mod 13), and finally, cancel everything starting with 48 that is ± 3 (mod 17). We observe that some numbers are cancelled more than once. 1 2 3 i 5 0 7 9 10 n 12 n 1N5 17 18 n 22 23 H 25 26 27 2$ n 30 n 32 33 u 3v n 37 38 30 40 4? 43 44 45 0 47 One can easily verify that the remaining numbers, k, all yield twin primes ( 6 f c - l , 6k + I). 4.1.3 P r o v i n g the A l t e r n a t e S ieve works The following theorem states that the Alternate Sieve does indeed yield twin primes. B y observing that all primes p > 5 are either of the form 6m — 1 or 6m + 1, we see that all twin primes, except (3, 5), are of the form (6k — 1, 6A; + 1). Therefore, this sieve gives us all twin primes, except (3, 5). Theorem 4.1.1 For every prime p > 5, define ap, bp by 6ap — 1 = 0 (mod p), 0 < ap < p 6bp + 1 - 0 (mod p), 0 < bp < p . Let K = {k\ k 6 N and k ^ ap (mod p), Vp prime, 5 < p < V6k — 1 (when this makes sense)} P| {k\ k € N and k ^bp (mod p), Vp prime, 5 < p < V6k + 1 (when this makes sense)} Then k G K if and only if 6k — 1, 6k + 1 are both prime. That is, (6k — 1, 6k + 1) is a twin prime. Proof: "<S=" (Contrapositive) Suppose k $.K. Then either k = ap (mod p), for some prime p, or k = bp (mod p), for some prime p, 5 < p < V6k - 1 < 6k - 1 5 < p < V6k +. 1 < 6k + 1 Chapter 4. Twin Primes 37 Therefore either 6 / c - l = or 6k + 1 = So one of 6k — 1, 6A; + 1 is prime. 6ap — 1 = 0 (mod p), 6bp + 1 = 0 (mod p), composite. That is, (6A; — p < 6k - 1 p < 6k + 1 1, 6A; + 1) is not a twin Suppose k E K. So k ^ CLP (mod p), Vp prime, 5 < p < V6k — 1 and k ^ bp (mod p), Vp prime, 5 < p < \/6fc + 1 . It follows that 6k — 1 ^ 6o p — 1 = 0 (mod p), Vp prime, 5 < p < y/6k — 1 and 6A; + 1 ^ 66p - f - 1 = 0 (mod p), Vp prime, 5 < p < V6A; + 1 . By observing 2, 3 { 6fc — 1, 6A; + 1, we have p \ 6k — 1 Vp prime, p < \/6k — 1 and p f 6k + 1 Vp prime, p < y/6k + 1 . Therefore 6A; — 1, 6A; + 1 are both prime. That is, (6A; — 1, 6A; -I- 1) is a twin prime. Additional Remarks: 1. If k ^ dp (modp), Vp prime, 5"'< p < y/6k — 1, thereby indicating 6A; — 1 prime, then it is actually true that k ^ ap (mod p), Vp prime, p > 5, except for p = 6k — 1 itself. 2. Ii k ^ bp (modp), Vp prime, 5 < p < V6A; + 1 , thereby indicating 6/c + 1 prime, then it is actually true that k ^ bp (mod p), Vp prime, p > 5, except for p = 6k + 1 itself. 3. We mentioned earlier that to check the primality of a number, n, we only had to be concerned about the primes p < \fn. We now observe Chapter 4. Twin Primes 38 that for every prime, p, the first composite number that is divisibly by p and has no prime factors q < p is p 2 . This means that all possible 6/c± 1 that are divisible by p and not divisible by any prime q < p must be greater than or equal to p 2 . This means that cancellation of numbers, k, where k = ap (mod p), starts at [^-^p-J. Likewise, the cancellation of numbers, A;, where k = bp (modp), starts at L 2 - ^ ] . It is thus ensured that for all remaining numbers, k, both Qk — 1 ^ 0 (mod p) and 6k + 1 ^ 0 (mod p). We wil l refer to [ ^ J and [ ^ J as the starting points of cancellation and they are actually equal since for every p > 5, one has p 2 = 1 (mod 6). We will see later on that for a more general prime pair, the starting points of cancellation may not necessarily coincide, and there could be complications if one decided to use only the lower cancellation point. 4. We observe that if p < V6fc - 1 (y/Qk + 1), then k > [ ^ J ( L ^ J ) , which further justifies the starting points of cancellation for each prime p > 5 when the sieve is performed. Q.E.D. 4.2 Applying Selberg's Results to Twin Primes 4.2.1 The Eratosthenes Approach For the next theorem we apply Selberg's method to the numbers n(n + 2). Let 7T2(X) denote the number of n with 1 < n < X such that both n and n + 2 are prime. Theorem 4.2.1 Let . c - n f c $ , • • . . . where the product is over all odd primes p. Then ^ 16CX ^ , ^ / O o g l o g X 7T2(X) < T - ^ T Z 1 + O l o g 2 X V V l o g * Chapter 4. Twin Primes 39 Proof: Take f(n) = n(n + 2). Then the function p in this sifting situation is given by p(p) = 2 i fp>2, p(2) = l . Thus p(p) < 2 for all p, so (as in Lemma 2.1) p has sifting density K = 2, and (3.2.38) holds with n(z,w) = 0(1). Then Theorem 3.2.2 gives G ( ^ » a K ^ ) ( i + o f e ) ) . I W ^ ( i + o(^)), where = I n ( p - 1 ) 2 2 11 p(p-2) ^ f e ^ (C as in (4.2.1)) 2 0 ^ A , * - 1 ) = 2 ^ ( 1 + 0 ( ^ ) ) ( s e e ( 2 ' 3 1 ) W i t h w = ^ Applying Theoremsv3.1.1 and 3.2.3, we now have IX ir2(X) < S(A, P(VD)) + n(VD) < +0(D log 2* D). AD log" VD Our result follows as stated on choosing D = X / (log X ) 2 K + 3 , where K — 2. Q.E.D. 4.2.2 The Alternate Approach In the alternate approach presented for sifting the twin primes, if we sift the numbers n where 1 < n < X/6, to retain only those for which both Chapter 4. Twin Primes 40 6n — 1,6n + 1 are prime, we obtain all the twin primes less than or equal to X. Correspondingly with the standard approach, if the numbers N = 6n — 1 are sifted where 1 < N < X, to retain those where both N = 6n — l,N + 2 = 6n + 1 are prime, we also get all the twin primes less than or equal to X. Therefore, in applying the Selberg sieve to the alternate approach, we must sift the numbers (6n — l)(6n + 1), just as the previous theorem sifted the numbers N(N + 2). If we let TT'2(X) denote the number of n with 1 < n < X/6 such that both 6n — 1 and 6n + 1 are prime, we observe that TT'2(X) = ^{X) — 1; (3, 5) is not counted by 7r 2(X). Hence we would expect TT2(X) to have a similar upper bound as ^ ( X ) upon applying the Selberg sieve on the numbers (6n — l)(6n + 1). This is indeed the case as demonstrated by the next theorem, and we can actually achieve the same upper bound. Theorem 4.2.2 Let where the product is over all odd primes p. Then Take f(n) = (6n — l)(6n + 1). Then the function p in this sifting situation is given by Thus p(p) < 2 for all p, so (as in Lemma 2.1) p has sifting density K — 2, and (3.2.38) holds with n(z,w) = 0(1). Then Theorem 3.2.2 gives Proof: p{p) = 2 if p > 3, p(2) = 0, P(3) = 0. Chapter 4. Twin Primes 41 where * - J . n > i ) V r 3<p<VD = 1 n ( p - i ) 2 P > V ^ V F ; = 1 2 ^ ( 1 + ° (TD)) ( S E E ( 2 - 3 1 ) W I T H ™ = ^ Applying Theorems 3.1.1 and 3.2.3, we have TT'2(X) < S(A,P(VD)) + Tt(VD) < 2 ' J +0(Dlog2"D) . ^ l o g VD Our result follows as stated on choosing D = X/(log X)2K+3, where K — 2. Q.E .D. As can be seen by comparing the results of the last two theorems, the alternate approach to sifting the twin primes leads to the same upper bound as the standard (Eratosthenes) approach. 4.3 Sum of the Reciprocals of Twin Primes It has been known for quite some time that the sum of the reciprocals ,qf the prime numbers is divergent. That is; • i J r n 1 > oo as n —• oo, Pi where pi is the i-th. prime number. The proof of this fact can be found in many texts on elementary number theory (see [6, Theorem 1.19]). In particular, this result implies that there are infinitely many prime numbers (a fact earlier known to Euclid (see [6, Theorem 1.17])). So a good question to ask is "Can this strategy be used to show that there are infinitely many twin primes?". Chapter 4. Twin Primes 42 Unfortunately, the answer is "No", leaving open to this day the question as to whether or not there are infinitely many twin primes. Viggo Brun was the first to show that the sum of the reciprocals of twin primes is convergent (or finite if there are only finitely many twin primes) [2]. That is, for some constant M , where pi is the i-th. twin prime, counting the twin primes by their first members. We present a proof of this result using Partial Summation and the common result of the previous two theorems. In the proof, we will also provide an explicit constant M. Theorem 4.3.1 Let p\, p2, ... be the sequence of prime numbers p such that p + 2 is also prime. Then We wish to use partial summation, in particular Lemma 2.2 which makes use of integration by parts (2.32). Let where M is a constant. Proof: 1 if n, n + 2 are both prime, 0 otherwise. and (/ ' is continuous on [2, oo)). Then let A(x) - £ . 0 , •n 7T2(x) = 7T2(x), 2<n<x and B(x) E a. '71 E 1 2<n<i n 2<n<x n, n+2 prime n Chapter 4. Twin Primes 43 Note here that B(x) is the sum of the reciprocals of only the first members of twin primes. This will not be a problem, however, because if B(x) is shown to be bounded by a constant y , then the sum of all reciprocals would be bounded by M since < ^- Proceeding now with use of Lemma 2.2, we have B{x) = J* f(t)d(A(t)), and making use of integration by parts (2.32), this becomes B(x) = [A(t)f(t)]x2- J\(t)f(t)dt = A(x)f(x) - A(2)/(2) - j T A(t)f'(t)dt = A(x)f(x)-J^ A(t)f'(t)dt (since A(2) = 0) < 16C ^ ) ) 0 + i Gog2(*))( LViog'2(x)y w ' h Vio 2(*h (by Theorems 4.2.1 and 4.2.2), where C is the constant from Theorems 4.2.1 and 4.2.2. Continuing the calculation, we get ~ 1 - . fx 1 B(x) < 16C = 16C = 16C 16C + i; dt \og\x) J2 t log 2(t) i _ r i l0g2(.T) | > g ( 0 j 2 J 1 1 1 + log(2) log 2(z) log(x) ' log(2)J (as x —> oo). From this it follows that V T J , T J , 4 Vi Pi + 2 < M, Chapter 4. Twin Primes 44 with M = 32C log(2)' Q.E.D. 45 Chapter 5 General Prime Pairs (G.P.P.) The last section gave some good results concerning twin primes; prime pairs of the form (p, p + 2), where p and p + 2 are both prime. Similar results can also be obtained for a more general prime pair, (p, p + 2B), where B > 1 is an integer constant. We shall apply Selberg's results to both the traditional (Eratosthenes) method for finding general prime pairs, and to a general version of the alternate method that was used to find twin primes. As such, we first proceed to show that the alternate sifting method can be generalized to find general prime pairs, (p, p + 25) . 5.1 Sifting Genera l P r i m e Pairs Recall in the introduction that after conducting the sieve of Eratosthenes to the set of numbers from 1 to N, one can then identify those primes that differ by 2, i.e., twin primes. Similarly, one could simply pick out those primes that differ by 25 , i.e., G.P.P.s. We provide a simple example of the Eratosthenes approach and then demonstrate the generalized alternate sifting method. Also, we provide proof that the general version of the alternate sieve works. 5.1.1 A n example of the Sieve of Eratosthenes Using the same example from before, for jV = 36, we cancel all proper mul-tiples of primes less than or equal to y/N = 6 (i.e., 2, 3, 5) and obtain 1 and all primes p where 1 < p < N. We then observe that for B — 4, (3, 11), (5, 13), (11, 19), (23, 31) are G.P.P.s of the form (p, p + 2B). Chapter 5. General Prime Pairs (G.P.P.) 46 1 7 13 19 25 31 9 n 32 2 9 n n 27 33 3 i n n 22 28 34 35 5 11 17 23 29 ft n n u m n 5.1.2 The Alternate Sieve for General Pr ime Pairs As for twin primes, one can obtain the general prime pairs (except possibly (3, 3 + 2B)) without the other primes by using a modified version of the previously described alternate approach. As before, this new sieve will ac-tually yield general prime pairs in an indirect way. Since all primes, other than 2 and 3, are either of the form 6A; — 1 or 6k + 1, we see that general prime pairs, (p, p + 2B), are either of the form (6A; — 1, 6A; + 2B — 1), or (6A; + 1, 6A; + 2B + 1). Furthermore, we see that the existence of these forms depends on the residue class, modulo 3, of B. That is, general prime pairs are of the form (6k + t, 6k + 2B + t) where Convention Note: It wil l be convenient for us to always say that general prime pairs are of the form (6A; + t, 6k + 2B + t), where it is to be understood that t has been predetermined by B , and should B = 0 (mod 3), we will say that general prime pairs have either the form (6k + t, 6k + 2B + t) or (6A; — t, 6k + 2B — t). Also, in several situations to follow, we will use the phrase "(when applicable)" in connection with the general prime pairs of the form (6A; — t, 6k + 2B — t), to indicate the possibility of dealing with both types of general prime pairs should B = 0 (mod 3). We shall see that the general alternate sieve is indirect in that it gives the numbers k, where both 6k + t, 6k + 2B + t are prime, and/or possibly both 6k — i , 6k + 2B — t are prime (when applicable); i.e., we get general prime pairs. The sieve also makes use of the observation that if 6k ± t (or 6A; + 2 5 ± t) is not prime, then it has a prime factor less than or equal to t < ' - 1 if B = 1 (mod 3) 1 if B = 2 (mod 3) k - 1 or 1 if fl = 0 (mod 3) Chapter 5. General Prime Pairs (G.P.P.) 47 y/W±t (or \/6k + 2B±t). If B = 0 (mod 3), we actually conduct two separate applications of the alternate sieve, once for t = 1, and once for t — —1. Afterward, we combine the numbers, k, retrieved from both applications, making careful note of any repeated elements. We start with all the integers from 1 to N. Since N is the largest possible "k", the largest possible general prime pair is (6N +1, 6N + 2B + t). As such, we need only worry about prime factors less than or equal to \/6N •+ 2B + t, except for 2 and 3 since 2, 3 \ 6k +1, 6k + 2B + t for any k (recall that t is predetermined specifically so that 3 \ 6k +1, 6k + 2B +1). For each prime p, where 5 < p < \/6N + 2B + t, we define ap, bp by 6ap + t = 0 (mod p), 0 < ap < p 6bp + 2B + t = 0 (modp), 0 < bp < p. Then starting with J > w e cancel all numbers that are ap (mod p), and starting with [p " g 5 - * ] , we cancel all numbers that are bp (mod p). A l l re-maining numbers, k, yield a general prime pair (6k + t, 6k + 2B +1). An example of the General Alternate Sieve We Consider the case B — 3. Here, we have both types of general prime pairs, (6k — 1, 6k + 5), and (6k + 1, 6k + 7). We conduct the sieve for each type separately and respectively, and then combine the results. Type 1: (6A; ~ 1, 6k \ 5) For N = 18, we worry about prime factors p where 5 < p < \/6N + 5 = VTI3 < 11, i.e., 5 and 7. For 5 : ap = 1, and cancellation starts with L^ -jpJ — 4. 6P = 0, and cancellation starts with L^ipJ = 3. For 7 : ap = 6, and cancellation starts with L^ pJ = 8. bp = 5, and cancellation starts with [-^pj = 7. We therefore cancel everything starting with 4 that is 1 (mod 5), and everything starting with 3 that is 0 (mod 5). Then cancel everything start-ing with 8 that is 6 (mod 7), and everything starting with 7 that is 5 (mod 7). Chapter 5. General Prime Pairs (G.P.P.) 48 1 2 3 4 ^ 0 7 8 9 .tK) 4 12 1^3 14 1^ 1^ 17 18 It is easily verified that all the remaining numbers, k, yield general prime pairs, (6A; — 1, 6fc + 5). T y p e 2: (6k + 1, 6k + 7) For N = 18, we worry about prime factors p where 5 < p < \/6N + 7 = \/Il5 < 11, i.e., 5 and 7. For 5 : ap — 4, and cancellation starts with [^f^-\ = 4. bp = 3, and cancellation starts with [*%^ J = 3. For 7 : ap = 1, and cancellation starts with = 8-bp = 0, and cancellation starts with L^ir"J = 7-We therefore cancel everything starting with 4 that is 4 (mod 5), and everything starting with 3 that is 3 (mod 5). Then cancel everything start-ing with 8 that is 1 (mod 7), and everything starting with 7 that is 0 (mod 7). 1 2 ? ^ 5 6 X A ^ 1 0 11 12 1^ % ty 16 17 1\8 It is easily verified that all the remaining numbers, k, yield general prime pairs, (6k + 1, 6k + 7). Combining together all the numbers, k, with mul-tiplicity if needed, that we got from the double application of the sieve, we get all general prime pairs, (p, p + 6), that are less than or equal to 6AT + 7 = 6(18) + 7 = 115. 5.1.3 Proving the General Alternate Sieve works The following theorem states that the General Alternate Sieve does indeed yield general prime pairs. We have already seen that all general prime pairs, except possibly (3, 3 + 2B), are of the form (6A; + t, 6k + 2B + t) and/or (6k — t, 6k + 2B — t) (when applicable). Therefore, this sieve, or a double application of it (when applicable), gives us all general prime pairs, except possibly (3, Z + 2B).' Chapter 5. General Prime Pairs (G.P.P.) 49 Theorem 5.1.1 Let B > 1 be an integer constant and, { 1 if 2 5 - 1 = 0 (mod 3) (i.e., B = 2 (mod 3)) -1 if 2B+ 1 = 0 (mod 3) (i.e., B = 1 (mod 3)) lor -1 if B = 0 (mod 3) . Also, for every prime p>5, define ap, bp by 6ap + t = 0 (mod p), 0 < ap < p 6bp + 2B + t = 0 (modp), 0 < bp <p . Let K = {k\ k G N and k ^ ap (mod p), Vp prime, 5 < p < V^k + t (when this makes sense)} (1 {k\ k E N and k ^ 6P (mod p), Vp pn'me, 5 < p < VQk + 2B + t (when this makes sense)} Then k G K if and only if 6fc + t, 6k + 2B + t are both prime. That is, (6k + t, 6k + 2B + t) is a G.P.P. Proof: (Contrapositive) Suppose k £ K. Then either k •• = ap (mod p), for a prime p, 5 < p < V6k + t <; 6k + t or k = bp (mod p), for a prime p, 5 < p < V6k + 2B + t < 6k + 2B + t Therefore either 6k + t = 6ap + t' = 0 (mod p), p < 6k + t or 6k + 2B + t = 6bp + 2B + t == 0(modp), p <6k + 2B + t So one of 6k + t, 6k + 25 +1 is composite. That is, (6A; 4-1, 6k + 25 +1) is not a G.P.P. Chapter 5. General Prime Pairs (G.P.P.) 50 Suppose k 6 K. So k ^ ap (mod p), Vp prime, 5 < p < y/6k + t and k ^ bp (mod p), Vp prime, 5 < p < V6k + 2B + t . It follows that 6k+ t =£ 6ap + t = 0 (modp) , Vp prime, 5 < p < y/6k + t and 6k + 2B + t # 66p + 2B +1 = 0 (modp) , Vp prime, 5 < p < \/6k + 2B + t B y observing 2, 3 f 6A; + t, 6k + 2B +1, we have p\6k + t Vp prime, p < y/6k + £ and p j 6/c + 2 5 + t Vp prime, p < V6k~+W~+t . Therefore 6k+ t, 6k + 2B + t are both prime. That is, (6A; +1, 6k + 2B +1) is a G.P.P. Additional Remarks: 1. If k ^ ap (modp), Vp prime, 5 < p < y/6k +1, thereby indicating 6k + t prime, then it is actually true that k ^ dp (mod p), Vp prime, p > 5, except for p = 6k +1 itself. 2. If k ^ 6P (mod p), Vp prime, 5 < p < \/6A; + 2B +1, thereby indicating 6k+2B+t prime, then it is actually true that k^bp (mod p), Vp prime, p > 5, except for p = 6k + 2B +1 itself. 3. As previously mentioned, the first composite number that is divisible ,by a prime, p, and has no prime factors q < p is p 2 . So all possible 6k + t, 6k + 2B + t that are divisible by p and not divisible by any prime q < p must be greater than or equal to p 2 . This means that cancellation of numbers, k, where k = ap (modp), starts at L^ ipj-Likewise, the cancellation of numbers, k, where k = bp (mod p), starts at [ p ~ 6 ~ J. It is thus ensured that for all remaining numbers, k, both 6k + t^0 (mod p) and 6k + 2B +1 ^ 0 (mod p). Chapter 5. General Prime Pairs (G.P.P.) 51 4. If p < VhT+t (V6k + 2B + t) then k > [^J (L^'f^J), which further justifies the starting points of cancellation for each prime p > 5 when the sieve is performed. 5. When sifting {1, . . . , N}, one has sifting conditions for all primes p < y/6N + 2B + t. There could be some k where 6k+t, 6k+2B+t are both prime and 6k + t < y/6N + 2B +1. If one decided to only use the smaller starting cancellation points, [p ~ J , then for these primes p = 6k +1, one could potentially have ^(6k+t) ~2B~tj < equivalently 6k + t < V6k + 2B +1. This means that these values of k would get cancelled incorrectly. However, when B is small, as in the case for twin primes, one can safely use just the lower of the two starting points, due to Remark 1 and the fact that y/6k + 2B +1 < 6k + t when B is small. For larger B, one can still use just the lower of the two starting points, but some care must be taken to not cancel those values of k where 6k +1 and 6k + 2B +1 are prime, and 6k + t < y/6k + 2B + t. 5.2 Applying Selberg's Method 5.2.1 The Eratosthenes Approach Recall that for the Eratosth'enes approach to sifting twin primes, we applied Selberg's method to the numbers n(n + 2). Similarly, we now apply the method to the numbers n(n + 2B). We define 7T 2B(X) to be the number of n where 1 < n < X, such that both n and n + 2B are prime. Theorem 5.2.1 Let Q.E.D. P(P - 2) (p - l ) 2 p-1 (5.2.1) where the products are over odd primes p. Then Chapter 5. General Prime Pairs (G.P.P.) 52 Proof: Take /(n) = n(n + 2B). Then the function p in this sifting situation is given by >\2B 2B . pip) = f 2 ifp-I 1 ifp 1 Thus p(p) < 2 for all p, so (as in Lemma 2.1) p has sifting density K = 2, and (3.2.38) holds with n{z,w) = 0(1). Then Theorem 3.2.2 gives G(VD) > L ( - J ^ L = - ) [ i + 0 where ADB 2! \V(P(VD))JX ' " VogD ^ l o g ^ ( l + o ( ^ ) ) , = \n(i-l) n p\B P5*2 p\B p?2 P<VD P\B, P#2 n P<VD p\B, p*2 i - i P (p - 1 ) 2 P(P - 2) I-2-P nH . P\B \p#2 n \P#2 P(P ~ 2) (P " I)2 (C as in (5.2.1)) . P i * v ^ \P#2 piP - 2) P(P ~ 2) T T P U i ^ 11 (p _ 1)2 . P\B \p#2 H 1 + 0 U (see (2.31) with w = \/15) = ^(1+0{TE (CB as in (5.2.1)). Applying Theorems 3.1.1 and8 3.2.3, we have 7T2BPO < S(A, P{y/D)) + n(VD) < 2X ADBlog2y/D + 0{D log2* D) . Chapter 5. General Prime Pairs (G.P.P.) 53 Our result follows as stated on choosing D = J s C / ( l o g X ) 2 r e + 3 , where K = 2. 5.2.2 The Alternate Approach In the alternate approach presented for sifting general prime pairs, for 1 < n < X/6, if we sift the numbers n to retain those where both 6n+t, 6n+2B+t are prime (t fixed as either 1 or —1, and B > 1 is an integer constant), along with those where both 6n — t, 6n + 2B — t are prime (when applicable), we obtain all the general prime pairs less than or equal to X. Correspondingly with the standard approach, for 1 < ./V < X, if the numbers N = 6n + t are sifted to retain those where both N = 6n+t, N + 2B = 6n+2B+t are prime, along with those where both N = 6n — t, N + 2B = 6n + 2B — t are prime (when applicable), we also get all the general prime pairs less than or equal to X. Therefore, in applying the Selberg sieve to the alternate approach, we must sift the numbers (6n + t)(6n + 2B + t), along with the numbers (6n — t)(6n + 2B — t) (when applicable), just as the previous theorem sifted the numbers N(N + 2B). This makes sense and agrees with the fact that the Selberg sieve was applied to the numbers (6n — l)(6n + 1) in the case of the alternate approach for sifting twin primes. We let 7 r 2 B ( X ) denote the number of n with 1 < n < X/6 such that both 6n +1 and 6n + 2J5 +1 are prime, and when applicable, 6n — t and 6n + 2B — t are also prime. We observe that Hence we would expect 7 r 2 B ( X ) to have a similar upper bound as IT2B(X) upon applying the Selberg sieve on the numbers (6n. +1)(6n + 2B +1), along with the numbers (6n — t)(6n + 2B — t} (when applicable). This is indeed the case as demonstrated by the next theorem, and we can actually achieve Q . E . D . ; - 1 if (3, 3 2B) is a G.P.P. i " ^ : if (3, .3 + 2B) is not a G.P.P. the same upper bound. Theorem 5.2.2 Let p>2 ( P - I)2 P - 1 P - 2 (5.2.2) Chapter 5. General Prime Pairs (G.P.P.) 54 where the products are over odd primes p. Then Proof: Recall that general prime pairs are of the form (6n + t, 6n + 2B + t) where B > 1 is an integer constant and ( - 1 if B = 1 (mod 3) t = < 1 if B = 2 (mod 3) [ - 1 or 1 if B = 0 (mod 3). Also recall that when 3 | B, we apply Theorem 5.1.1 to each case separately (t = 1 and i = — 1). So in the case when 3 | 5 , it is convenient to think of £ as being fixed (say t = 1) and so general prime pairs in this situation are either of the form (6n +1, 6n + 2B + i) or of the form (6n — t, 6n + 2B — £). When 3 \ B, we just said that general prime pairs are of the form (6n + t, 6n + 2B +1) (recall t is.understood to be predetermined). As such, we take / i (n) = (6n + £)(6n + 2B + £), and when applicable (i.e., 3 | B), f2(n) = (6n-t)(6n + 2B-t). Then for each situation, fi and fa (when applicable), the function p is given by { 0 i fp = 2 o r p = 3 1 if p | B a n d p ^ 2 or 3 2 otherwise. Thus p(p) < 2 for all p, so (as in Lemma 2.1) p has sifting density K — 2, and (3.2.38) holds with n(z,w) = 0(1). Then Theorem 3.2.2 gives Chapter 5. General Prime Pairs (G.P.P.) 55 where A' DB n p\B P5^2,3 p\B p^2,3 p\B, p£2, 3 pfB, p#2, 3 P n \pjL2, 3 i - i P 3 4 n . P\B W 2 , 3 P(P ~ 2) (P " I) 2 P(P - 2) (C as in (5.2.2)) 12 n W 2 - 3 p p T T P(P ~ 2) 11 ( p _ l ) 2 . .P |B V ^ 1 W 2 > 3 J (see (2.31) with iw = v^D) + if 3 | B and C f l as in (5.2.2) £ ( 1 + 0 ( T D ) ) if 3 | B and C B as in (5.2.2) 12 I 1 1_ 1 2 C B C Applying Theorems 3.1.1 and 3.2.3, and multiplying by 2 in the case when 3 | B (to combine both situations, / i and / 2 ) , we have in all cases, TT2BPO < S(A,P(VD)) + *(VD) < -A'DBlog2^ + 0(D log 2 " D) . Our result follows as stated on choosing D =,X / (log X ) 2 K + 3 , where K = 2. Q.E.D. As can be seen by comparing the results of the last two theorems, the alternate approach to sifting the general prime pairs leads to the same upper bound as the standard (Eratosthenes) approach. 5.3 Sum of the Reciprocals As for twin primes, the sum of the reciprocals for general prime pairs is convergent (or possibly finite). The proof of this result is practically identical Chapter 5. General Prime Pairs (G.P.P.) 56 to that of Theorem 4.3.1 but with the obvious differences. Theorem 5.3.1 Let pi, p2, . . . be the sequence of prime numbers p such that p + 2B is also prime. Then V f l + - L _ N ) < M , if \p, Pi + 2B J ~ where M is a constant. Proof: We wish to use partial summation; in particular, Lemma 2.2 which makes use of integration by parts (2.32). Let _ J 1 if n, n + 2B are both prime, n \ 0 otherwise. and f(n) = — ( / ' is continuous on [2, oo)). n Then let A(x) = £ an = TT2B(X), 2<n<x and B{X) =yja-= T 2<n<x 2<n<x n, n+2B prime Note here that B(x) is the sum of the reciprocals of only the first members of the general prime pairs. This will not be a problem, however, because if B(x) is shown to be bounded by a constant 4p t n e n the sum of all reciprocals would be bounded by M since < K Proceeding now with use of Lemma 2.2, we have B(x) = j f * f(t)d(A(t)), Chapter 5. General Prime Pairs (G.P.P.) 57 and making use of integration by parts (2.32), this becomes B(x) = [A(t)f(t)]x2- j*A(t)f'{t)dt = A(x)f(x)-A(2)f(2)-£ A(t)f'(t)dt = A(x)f(x) - A(t)f'(t)dt (since A(2) = 0). < 16CCB x \og\x)) \x) J2 \\og\t)J V*2 (by Theorems 5.2.1 and 5.2.2), dt where C and CB are the constants from Theorems 5.2.1 and 5.2.2. Continuing the calculation, we get B(x) < 16CCB = IQCCB = mccB WCCB ' log(2) log i r I Jix)+J2 H o g Liog2(*) Liog(t)J2 (*) -dt 1 1 + log 2(x) log(x)- ' log(2)J (as ir —> oo). From this it follows that with Pi Pi + 2B 32CCB < M, Af = log(2) • Q.E.D. 58 C h a p t e r 6 C o n c l u d i n g R e m a r k s As we have seen, the methods of Selberg are quite good for providing upper bounds. This is good and leads to results like those of Theorems 4.3.1 and 5.3.1, where the sum of the reciprocals of the twin primes/general prime pairs are convergent (or finite). However, mathematicians would like to find some means of providing effective lower bounds. It is not yet clear if, and how, the methods of Selberg can be manipulated or reformulated in such a way so as to provide good lower bounds. This is an area of active research; [4] addresses/presents some plausible approaches to the problem. The alternate approach we presented for sifting twin primes was quite elegant and easy to perform. The starting points of cancellation coincided and we saw that for every prime p > 5, we had bp = —ap. This meant that the cancellation step for each prime had a symmetrical aspect to it. While things were pleasant for twin primes, they got a bit uglier for more general prime pairs. We generally had two distinct starting cancellation points for each prime p > 5 and we no longer had symmetry in the form bp = — ap. Also, depending on whether or not 3 | B, we may have had to perform a double application of the sieve. Despite all this, however, the alternate sift-ing approach was effective and easy to perform. It must also be pointed out that the alternate sifting approach could be reformulated and applied toward finding very specific prime pairs. For in-stance, if one were specifically interested in finding prime pairs of the form (Ak + l, Ak + 2B + 1), where A, B, I are fixed constants and g.c.d.(A, I) = 1 and g.c.d:(A, 2B + I) = 1,. the alternate approach could be formulated to do just that. In addition to this, the alternate sifting approach.can also be extended and used for finding prime n-tuples; that is, tuples each consisting of n primes, where it has been pre-determined how the primes are to be sep-arated from each other (twin primes are 2-tuples that are separated by 2). Note also that one could decide to "shrink" the method and find 1-tuples; i.e., just find primes of some form Ak + I, where A, I are constants and g.c.d.(A, I) = 1. Chapter 6. Concluding Remarks 59 We saw how the Selberg method was applied to twin primes, and it was mentioned earlier that it is still an open problem as to whether or not the twin primes occur infinitely often throughout the integers. The Twin Prime Conjecture states that they do occur infinitely often, and somewhat associ-ated with this conjecture, is the famous Goldbach Conjecture, which states that every even number greater than 2 can be written as the sum of precisely two primes. Both of these problems have been open for many years, but the techniques of Sieve Theory have come remarkably close to solving them. Things seem to have culminated with the results of J.R. Chen, see [3]. He essentially proved, using similar techniques, the following two theorems. Theorem 6.1 There are infinitely many primes p where p+2 is either prime or is the product of 2 primes. Theorem 6.2 Every sufficiently large even number is either the sum of two primes or is the sum of a prime and a product of 2 primes. One can also see [5, Chapter 11], where the entire chapter is devoted to Chen's theorem(s). It is clear that Sieve Theory is quite powerful and useful, yet seems to be in need of new information in order to crack these age old problems. The Twin Prime Conjecture and Goldbach Conjecture are only two of many problems where sieve techniques can be applied. 60 B i b l i o g r a p h y [1] Apostol, Tom M . Introduction to Analytic Number Theory, Undergrad-uate Texts in Mathematics. Springer, 1976. [2] Brun, Viggo. L a serie 1/5 + 1/7 + 1/11 + 1/13 + 1/17 + 1/19 + 1/29 + 1/31 + 1/41 + 1/43 + 1/59 + 1/61 + ou les denominateurs sont "nombres premiers jumeaux" est convergente ou finie. Bulletin des Sciences Mathematiques, 43, 1919. pgs. 100-104, 124-128. [3] Chen, J . On the representation of a large even integer as the sum of a prime and the product of at most two primes. (Chinese) Kexue Tongbao, 17, 1966. pgs. 385-386. [4] Greaves, George. Sieves in Number Theory, A Series of Modern Surveys in Mathematics, Volume 43. Springer, 2001. [5] Halberstam, H . and Richert, H. -E . Sieve Methods. Academic Press Inc. 1974. pgs. 320-338. [6] Niven, Ivan; Zuckerman, Herbert S. and Montgomery, Hugh L . An Intro-duction to The Theory of Numbers, fifth edition. John Wiley and Sons, Inc. 1991. pgs. 25-28. [7] Rudin, Walter. Principles of Mathematical Analysis, third edition. McGraw-Hil l , Inc. 1976. pgs. 63-64.
- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- The Selberg Sieve and prime pairs
Open Collections
UBC Theses and Dissertations
Featured Collection
UBC Theses and Dissertations
The Selberg Sieve and prime pairs Duarte, Martin Christopher 2005
pdf
Page Metadata
Item Metadata
Title | The Selberg Sieve and prime pairs |
Creator |
Duarte, Martin Christopher |
Date Issued | 2005 |
Description | This paper gives an exposition of the Selberg Sieve and its application to the sifting of prime pairs. In particular, Selberg's methods are applied to the sifting approach of Eratosthenes and to an alternate sifting approach presented by the author. The results obtained are then used to show that the sum of the reciprocals of the twin primes (and similarly for general prime pairs) is convergent or finite. This paper is intended to be mostly self-contained and will hopefully be readable to someone with little background in the area of Sieve Theory. |
Genre |
Thesis/Dissertation |
Type |
Text |
Language | eng |
Date Available | 2009-12-11 |
Provider | Vancouver : University of British Columbia Library |
Rights | For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use. |
DOI | 10.14288/1.0080068 |
URI | http://hdl.handle.net/2429/16435 |
Degree |
Master of Science - MSc |
Program |
Mathematics |
Affiliation |
Science, Faculty of Mathematics, Department of |
Degree Grantor | University of British Columbia |
GraduationDate | 2005-05 |
Campus |
UBCV |
Scholarly Level | Graduate |
AggregatedSourceRepository | DSpace |
Download
- Media
- 831-ubc_2005-0203.pdf [ 2.36MB ]
- Metadata
- JSON: 831-1.0080068.json
- JSON-LD: 831-1.0080068-ld.json
- RDF/XML (Pretty): 831-1.0080068-rdf.xml
- RDF/JSON: 831-1.0080068-rdf.json
- Turtle: 831-1.0080068-turtle.txt
- N-Triples: 831-1.0080068-rdf-ntriples.txt
- Original Record: 831-1.0080068-source.json
- Full Text
- 831-1.0080068-fulltext.txt
- Citation
- 831-1.0080068.ris
Full Text
Cite
Citation Scheme:
Usage Statistics
Share
Embed
Customize your widget with the following options, then copy and paste the code below into the HTML
of your page to embed this item in your website.
<div id="ubcOpenCollectionsWidgetDisplay">
<script id="ubcOpenCollectionsWidget"
src="{[{embed.src}]}"
data-item="{[{embed.item}]}"
data-collection="{[{embed.collection}]}"
data-metadata="{[{embed.showMetadata}]}"
data-width="{[{embed.width}]}"
async >
</script>
</div>
Our image viewer uses the IIIF 2.0 standard.
To load this item in other compatible viewers, use this url:
http://iiif.library.ubc.ca/presentation/dsp.831.1-0080068/manifest