THE DIFFERENCE BETWEEN CONSECUTIVE PRIMES, II


 Philip Patrick Nicholson
 1 years ago
 Views:
Transcription
1 THE DIFFERENCE BETWEEN CONSECUTIVE PRIMES, II R. C. BAKER, G. HARMAN and J. PINTZ [Received May 000; revised 5 November 000]. Introduction Beginning with Hoheisel [8], many authors have found shorter and shorter intervals x x v ; xš that must contain a prime number. The most recent result is v ˆ 0:55: see Baker and Harman [], where the history of the problem is discussed. In the present paper we prove: Theorem. For all x > x 0, the interval x x 0:55 ; xš contains prime numbers. With enough effort, the value of x 0 could be determined effectively. The paper has much in common with []; in particular we use the sieve method of Harman [4, 5]. We no longer use zero density estimates, however, but rather mean value results on Dirichlet polynomials similar to those that give rise to such estimates. Compare, for example, work of Iwaniec and Pintz [9] and Baker, Harman and Pintz []. Much of the improvement over [] arises from the use of Watt's theorem [] on a particular kind of mean value. More accurate estimates for sixdimensional integrals are also used to good effect. There is in addition a device which uses a twodimensional sieve to get an asymptotic formula for a `onedimensionally sieved' set; see Lemmas 6, 7. Unfortunately, these lemmas, which would be of great signi cance for v ˆ 0:5, are not very numerically signi cant when v drops to 0.55; the same applies to the `roãle reversals' discussed below. Let us introduce enough notation to permit an outline of the proof. When E is a nite sequence of positive integers, counted with multiplicity, we write jej for the number of terms of E, and E d ˆfm: dm Eg: Let P z ˆY p; where the symbol p is reserved for a prime variable; and let S E; z ˆjfm E: m; P z ˆ gj: Let v be a positive number, 0:54 < v < 0:55: : p < z Research of the rst author was supported in part by the National Security Agency and the National Science Foundation. 000 Mathematics Subject Classi cation: N05. Proc. London Math. Soc. () 8 (00) 5±56. q London Mathematical Society 00.
2 the difference between consecutive primes 5 Let L ˆ log x; y ˆ x exp L = ; y ˆ x v «, A ˆ x y; x Ç Z and B ˆ x y ; x Ç Z; where «is a suf ciently small positive number. Buchstab's identity is the equation S E; z ˆS E; w w < p < z S E p ; p ; where < w < z; S A; x = counts the primes we are looking for. Our philosophy is to use Buchstab's identity to produce parallel decompositions of S A; x = and S B; x = : S A; x = ˆk j ˆ S B; x = ˆk j ˆ S j l j ˆ k S j l j ˆ k Here S j > 0, Sj > 0 and for j < t < k or j > k we have S j ˆ y Sj o y as x!. Thus S A; x = > y S B; x = k Sj o : y j ˆ t We must thus ensure that not too many sums are discarded, that is, fall into the category t < j < k. Just as in [] we use Buchstab's identity twice to reach the decomposition S A; x = ˆS A; x n 0 S A p ; x n a n 0 < a < = n 0 < a < = n a < a < min a ; a = S j ; S j : S A p p ; p ˆ S S S ; say. : (Here p j ˆ x a j.) We give asymptotic formulae for S and S. The piecewise linear function n... is larger (for given v) than its counterpart in []. From this point on, roãle reversals are employed. To illustrate this, note that S A p p ; p ˆjfp p h A: p j h ) p > p gj: If K is a region in which a > a a, we note that S A p p ; p ˆfhp h A: L log h ; L log p K; a ; a K p j h ) p > h = ; p j h ) p > p g;
3 54 r. c. baker, g. harman and j. pintz leading readily to the formula (in which h ˆ x b ) S A p p ; p ˆ o a ; a K a b ; a K p j h ) p > p x = S A hp ; hp which we term a roãlereversal. The point here is that our asymptotic formulae a m b m S A mn ; x n ˆ y o a y m b n S B mn ; x n : m, M n, N m, M n, N require certain upper bounds on M and N; see Lemmas and. Here m, M means M < m < M; m } M means B M < m < BM; B is a positive absolute constant, which need not have the same value at each occurrence. It will generally be bene cial to attempt as many decompositions as possible. There are two reasons for this. First, if there are several variables, there should often be a combination of variables which satisfy one of our criteria for obtaining an asymptotic formula. Second, if there are many variables, the contribution is already quite small. To see this, note that if represents x n < p n < p n <...< p < x l, then S Bp... p n ; p n Z l Z ˆ y a Z an a... a o... q n L a ˆ n a ˆ n a n ˆ n (compare []). Moreover, a... a q n < and a n Z Z... a a n a n da a... da n a n da...da n a...a n < log l=n n : n!n For v ˆ 0:55 we shall have n > 0:05. Hence the contribution from p < x = 0 (for which one can take n ˆ 8) is at most y log 8 L 8!0:05 o < 0:00000yL : (If `asymptotic formula regions', in the sense of (.4) below, are not discarded, we get a better estimate still.) However, when roãlereversals are used it may not always be bene cial to perform as many decompositions as possible. The reason for this is that with roãlereversals, a sum may be replaced by the difference of two sums, each substantially larger than the original one. If not enough combinations of variables lie in `asymptotic formula regions', we have made matters worse. For example, when decomposing in straightforward fashion we count p...p n m; p j m ) p > p n : When roãlereversals are used we may have p...p n klm; p j k ) p > p r ; p j l ) p > p s ; p j m ) p > p n : The rst expression gives rise to a term a... a q n a n a...a n an ;
4 the difference between consecutive primes 55 while the second leads to a term f f q q a r a s f q a n a...a n a r a s a n for certain expressions f, f and f. The corresponding integral can then be larger than the original term under consideration. The nal decomposition of S, given in 6, arises from Lemmas and, together with formulae of the type S A p... p r ; p r ˆ y o S B y p... p r ; p r :4 a ;... ; a r K discussed in 5. a ;... ; a r K. Application of Watt's theorem Let T ˆ x v «= and T 0 ˆ exp L =. In this section we seek a result of the type Z = it jm s N s K s j jdsj p x = L A : = it 0 where M s and N s are Dirichlet polynomials, M s ˆ a m m s ; N s ˆ b n n s ; m, M and K s is a `zeta factor', that is, K s ˆ k, K k s or n, N log k k s : Note the convention of the same symbol for the polynomial and its `length'. Of course, is a Dirichlet polynomial of length. We shall assume without comment that each Dirichlet polynomial that appears has length at most x and coef cients bounded by a power of the divisor function t: thus, whenever a sequence a m m, M is mentioned, we assume that ja m j < t m B : (This property may be readily veri ed for the particular polynomials employed later.) The bound (.), and any bound in which A appears, is intended to hold for every positive A; the constant implied by the `p' or`o' notation may depend on A, B and «. It is not a long step from (.) to a `fundamental lemma' of the type a m b n S A mn ; w ˆ y o a y m b n S B mn ; w : m, M n, N m, M n, N with This will be demonstrated in. w ˆ exp k, K L log L : :
5 56 r. c. baker, g. harman and j. pintz Lemma. Let N s ˆ p i, P i p...p u s :4 where u < B, P i > w and P...P u < x. Then, for Re s ˆ, where each g i is of the form jn s j < g s... g r s ; with r < L B ; :5 L B Yh i ˆ jn i s j; with h < B; N...N h < x; :6 and among the Dirichlet polynomials N ;...; N h greater than T = are zeta factors. the only polynomials of length Proof. It clearly suf ces to prove (.5) for N s ˆ L n n s n, N where L is von Mangoldt's function. We now obtain the desired result by the identity of HeathBrown [6]. We shall refer to polynomials N s `of type (.4)' to indicate that the hypothesis of Lemma holds for N s. Lemma. If K s is a zeta factor, < U < T, K < 4U and M < T, then Z = iu = iu= jm s j jk s j 4 jdsj p U «M U = : :7 Proof. For K < U = and M < U = this is proved in all essentials by Watt [] in the course of the proof of his main theorem. For K < U = and M > U = we have Z = iu Z jm s j jk s j 4 jdsj p kmk jk s j 4 jdsj = iu= p M «U p M U = «: Now suppose that U = < K < 4U. Using a re ection principle based on [0, Theorem 4.], we may replace K by a zeta factor of length K 0 < U = with error E ˆ O. Thus jkj 4 p jk 0 j 4 jej 4. Since Z = iu = iu= jm s j jej 4 jdsj p Z = iu = iu= p M U U «; the general case of Lemma now follows. jm s j jdsj
6 the difference between consecutive primes 57 Lemma. Let MN N K ˆ x. Suppose that M, N and N are of type (.4) and K s is a zeta factor, K p x = 4. Let M ˆ x a and N j ˆ x b j and suppose that a < v; :8 b b < v a 0 : :9 Here and subsequently a 0 ˆ max a; v. Suppose further that b < 4 v a 0 ; :0 b b < 4 v a 0 : : Then for < U < T, Z U j MN N K it j dt p x = L A : U = : Proof. Suppose rst that 4U < K and write N ˆ MN N. Lemma 5 of [] yields km k p M = L A if M > x «and similar results for N and N.Byan application of Lemmas 4. and 4.8 of [] we obtain kk k p K = U ; kknk p K = U M = N N = L A ˆ x = U L A : Hence the integral in (.) is p U kknk p x = L A : Now suppose that K < 4U. The integral in (.) is Z = Z = 4 Z = 4 jm j jn N j jk N j p x «= 50 M T = N N T = 4 T = 4 N T = = 4 r x g by Lemma and the mean value theorem [, (.)]. Here g ˆ a 0 4 max b b ; v 4 v max 0; b 8 v 5 «: The conditions (.8)±(.) guarantee that g < 5 «. Lemma 4. replaced by: The conclusion of Lemma holds if the hypotheses (.9)±(.) are either b < v or N is a zeta factor; : b < 8 v a 0 : :4 Proof. If either K > 4U,orN > 4U and N is a zeta factor, we may proceed as at the beginning of the proof of Lemma. Thus we may suppose that these cases are excluded. The integral in (.) is at most Z = Z = 4 Z = 4 jm j jn j 4 jkn j 4 p x d ;
7 58 r. c. baker, g. harman and j. pintz where d ˆ a 0 v 0 «4 max 0; 4b v : (If b < v, the mean value theorem yields R jn j 4 p Tx «= 4 ;ifn is a zeta factor and N < 4U, the same bound follows from (.7).) The result now follows, in view of (.4). Lemma 5. Let K s be a zeta factor, K p x = 4. Suppose that M ˆ x a, N ˆ x b, a < v and b < min v 4a0 ; 5 v 4a0 : :5 Suppose further that M s and N s are Dirichlet polynomials of the type (.4). Then Z T j MNK it j dt p x = L A : :6 T 0 Proof. Let U; U Š Ì T 0; T Š. It suf ces to get the above mean value bound over U; U Š. Let a ˆ min v a 0 ; 5 v a 0 : We may suppose that b > v ; since otherwise the result follows from Lemma 4 with b ˆ 0. In view of Lemma, we may suppose that N ˆ N...N t ; where N j ˆ x d j ; d <...< d t and any N j with d j > v is a zeta factor. We now give two cases in which (.6) is valid. Case. There is a subproduct x d of N...N t which is either a zeta factor or has d < v. Moreover, b d < a: If a 0 > v, then a < v a 0 < 8 v a 0 ; while if a 0 < v, then a < 5 v a 0 < 8 v a 0 : Now (.6) follows on applying Lemma 4. Case. There is a subproduct x d of N...N t such that a < d < b a: Let b ˆ min d; b d ; then b a; bš. Let b ˆ b b. Then b b ˆ b b < b a < v a 0 : Moreover, b < v 4a0 ˆ 0 4 v a
8 the difference between consecutive primes 59 and b b < 5 4 b < 4 v 4a0 : Now (.6) follows from Lemma. We may now complete the proof of the lemma. If d t < a, there is evidently a subsum of d... d t in a; aš. Now since if a 0 > v, then a < b a; a < 6v 6a 0 < v < b; while if a 0 < v, then a < 5 9v 6a 0 < v < b: Thus Case holds when d t < a, and of course Case also holds when a < d t < b a. Finally suppose that d t > b a; then we are in Case with d ˆ d t. This completes the proof of Lemma 5.. Sieve asymptotic formulae In this section we establish formulae of the type (.) and use them as a stepping stone to formulae of type (.). In order to link (.) or (.) to the behaviour of Dirichlet polynomials we use the following variant of [, Lemma ]. then Lemma 6. Let F s ˆP k } x c k k s.if Z T jf it j dt p x = L A ; : T 0 k A c k ˆ y y c k O yl A : k B : Lemma 7. Let a and u be positive numbers, w ˆ x = u and D ˆ x a. Suppose that =a < u < log x «: : Then p exp log log w ua ualog ua : :4 d j P w d > D The implied constant is absolute. d Proof. Let r ˆ u log ua =L. We use the simple inequality exp cy < exp c y :5
9 540 r. c. baker, g. harman and j. pintz for c > 0 and 0 < y <. Now d < D r d j P w d > D d j P w d r d ˆ D r Y p r p < w ˆ D r exp < D r exp log p r p < w p < w p r p p < w : :6 p We apply (.5) with y ˆ log p= log w and c ˆ log ua. The last expression in (.6) is at most exp log ua D r exp log p log w p p p < w p < w ˆ exp ualog ua ua O log log w O log w by Mertens' theorems for P p log p and P p. This completes the proof. Lemma 8. Let M s ˆP m, M a m m s, N s ˆP n, N b n n s, M ˆ x a and N ˆ x b, with a < v «and b < min v 4a 0 ; 5 v 4a 0 «: :7 Suppose further that M s and N s are of type (.4). Then (.) holds. Proof. We follow the proof of [, Lemma ]. We must prove (.) with c k ˆ a m b n m d : m; n d j l; d j P w mnlˆ k According to Lemma 5 of HeathBrown [7], m d ˆ m d O d j l; d j P w where g ˆ x «=. Let ck 0 ˆ Then m; n; d j P w ; d < g l 0 mod d ; mnlˆ k m; d, D d j l; d j P w d < g a m b n m d ; c 00 k ˆ c k ˆ k A k A ck 0 O d j l; d j P w g < d < gw! m; n; d j P w g < d < w g; l 0 mod d mnlˆ k k A ck 00 : ja m b n j: Suppose for the moment that MND > x = 4. We now apply Lemma 5 to M s N s K s, where M s ˆ a m m d b md s ; N s ˆ n n s ; K s ˆ k s ; n kmnd} x
10 the difference between consecutive primes 54 and then sum over D ˆ g j ; gš. In each case M has length at most Mx «and Lemma 5 is applicable. We conclude that ck 0 ˆ y ck 0 O yl A : :8 y k A k B We reach the same conclusion with ck 00 in place of ck 0 by modifying M s in an obvious fashion. Finally we bound P k A ck 00 by p y y k B c 00 k p y m; n ja n jjb n j mn d j P w g < d < w g p y ja m j jb n j m n exp u«log u«p yl A ; m; n from Lemma 7. Here w ˆ x = u, so that u ˆ log L. Now (.) follows on assembling this together with (.8). Now suppose that MND < x = 4, so that (.8) and its analogue for ck 00 take the form y a n a y n p yl A : nl A nl B n p x = 4 n p x = 4 This bound is easily established, because the lefthand side is y a n n O y y a y n n n O p ja n j p x = 4 «: n, N n The proof may now be carried through as in the case MND > x = 4. d Lemma 9. Let LMN ˆ x. Let g be a natural number, g < B. Suppose that M ˆ x j ; N ˆ x j ; j j < min 4v ; jj j j < v 8 «; 8g 4 v 4g ; 4g Suppose further that the Dirichlet polynomial L s satis es sup jl it j p L = L A : t T o ; T Š Then F s ˆL s M s N s satis es (.). :9 4gv g 4g : :0 : Proof. This is a variant of Theorem 4 of []. The only modi cation needed to the argument in [] comes in Case (ii), where the expressions I and I must be replaced by I 0 ˆ TM f j = = 4 g TN f j = = 4 g L g gj = g M j = N j = L j = ;
11 54 r. c. baker, g. harman and j. pintz and I 0 ˆ TM f j = = g TN f j = = g TL 4 g 6 gj = 6 g M j = N j = L j = : Here f j ˆmin j; 4 6j ; : a function which has the simple property a f j j < a f 4 4 ˆ 4 a : for any a 6 ; Š. Thus I 0 < T = g MN = 8 g L = ˆ T = g x = 8 g L = = 8 g p x = L A by (.0). Similarly I 0 < T MN = 4 g L = 6 ˆ Tx = 4 g L = 6 = 4 g p x = L A : The desired result follows just as in []. We now require combinatorial lemmas designed to bring Lemma 9 into play after a number of `Buchstab decompositions' of the lefthand side of (.). Lemma 0. Let k > 0, and suppose that Then, writing we have Let 0 < a < «and let h be the least positive integer with a > h v : v a h > a >...> a k > 0; :4 a a... a k a k < v if k > 0: :5 h v a a ˆ max ; h a a... a k < a : h v a h :6 :7 Proof. Suppose rst that k > h. Since the a j are decreasing, (.5) yields a h a k < v; :8 so that a k < v a = h ; a a... a k < v a k < v v a h v a ˆ : h h Now suppose that k < h. We apply (.4) to obtain a a... a k < a h This completes the proof of Lemma 0. v a h h v a ˆ : h :9
12 the difference between consecutive primes Note that the function a of a satis es v < h v h < a < «: 54 :0 Lemma. Make the hypotheses of Lemma 0, and suppose further that a a... a k a k > v: : Then the numbers g ˆ a a... a k and g ˆ a a... a k satisfy jg g j < v : : Proof. We have g g ˆ a a... a k a k > v ˆ v : from (.). If k > h, then we have (.9) from the previous proof. Since a > h v, a k < v a h < v h v h ˆ v : Since the a j are decreasing, g g ˆ a a... a k a k a k a k < v v ˆ v : If k < h, then (.4) yields v a g g < a h ˆ v : h This completes the proof of Lemma. Lemma. Let a 0; Š, 0 < b < min v 4a ; 5 v 4a «: Let M s ˆP m, M a m m s, N s ˆP n, N b n n s ; M ˆ x a and N ˆ x b, where M s and N s are of type (.4). Let I h ˆ h v ; h v ; and write 6v 7 n a ˆmin v a ; a I h 9 h ; h > : Then (.) holds for every n < n a. This result sharpens Lemmas 5 and 6 of []. It is clear that n a > v. The upper bound on b never falls below v «.
13 544 r. c. baker, g. harman and j. pintz Proof of Lemma. omitted. Let The summation conditions m, M and n, N will be w l; z ˆ From Buchstab's identity, w l; z ˆw l; w Here w is given by (.). We must prove that, taking z ˆ x n, c k 0 ˆ if l; P z ˆ ; 0 otherwise. mnlˆ k phˆ l w < p < z a m b n w l; z w h; p : satis es (.). From (.4), c k 0 ˆc 0 k 0 c 00 k 0 c k where c 0 k 0 ˆ a m b n w l; w ; c 00 k 0 ˆ c k ˆ mnlˆ k mnp h ˆ k w < p < z > x v mp = mnp h ˆ k w < p < z mp = < x v a m b n w h ; p ; a m b n w h ; p : We continue the process by applying (.4) to c k. In general, let c k j ˆ a m b n w h j ; p j ; then (.4) gives mp... p j h j ˆ k w < p j <... < p < z mp... p j p = j < x v c k j ˆck 0 j ck 00 j c k j where ck 0 j is obtained from c k j by replacing w h j ; p j by w h j ; w, and c 00 k j ˆ a m b n w h j ; p j : mp... p j p j h j ˆ k w < p j <... < p < z mp... p j p = j < x v < mp... p j p = j :4 For j > L= log w ˆ log L, the sum c k j is empty and decomposition ceases. Each c 0 k j satis es (.). To see this, we write p i ˆ x a i. Then since m < x a, where a I h, we have mp...p j < x a :5 in the sum c 0 k j, by Lemma 0. We now obtain (.) by an appeal to Lemmas 6 and 8, taking M s ˆ a m mp...p j s : mp... p j p = j < x v w < p j <... < p < z
14 the difference between consecutive primes 545 Each c 00 k j satis es (.). For in c 00 k j, we may write h j ˆ p 0...pu 0 where u < log L. It suf ces to prove (.) for the portion c 00 k j; u of c 00 k j arising from a xed value of u. As in the proof of Lemma of [], we may remove the conditions of summation, x v < mp... p j p = j ; p j < p j and p j < p, 0 by the use of Perron's formula, which modi es the coef cients of the Dirichlet polynomials in an acceptable way. (The same process is implicit several times in the rest of the paper.) We apply Lemmas 6 and 9 with g ˆ 5, with M s produced by grouping m; p ;...; p j, L s corresponding to p j, and N s produced by grouping the remaining variables. The restriction to dyadic ranges presents no problem, and we have only to verify (.9)±(.). For (.9) we appeal to Lemma ; the condition (.) derives from one of the summation conditions for c 00 k j. For (.0) we note that j j < n a ; and n a is de ned in such a way that (.0) holds. We complete the proof of (.) for c 00 k j by noting that (.) follows from [, Lemma 5]. We now obtain (.4) for c k 0 on combining the results for the O log L expressions into which we have decomposed it. Lemma. Let M ˆ x a,n ˆ x b and N ˆ x g, where M s, N s and N s are of type (.4) and suppose that a < and either (i) b g < v a «; or (ii) Let g < 4 v a «; b g < v a «; b < v ; g b n ˆ Then (.) holds whenever n < n a. < 8 v 4a «: A n B n : n n ˆ n n, N ; n, N Proof. We follow the proof of Lemma, altering only the discussion of c 0 k j, where N s no longer satis es the requirements of Lemma 8. However, N s ˆN s N s, and at the point in the proof of Lemma 8 where we appeal to Lemma 5, we may substitute an appeal to Lemma in Case (i), or to Lemma 4 in Case (ii). Modi ed in this way, the proof of the necessary variant of Lemma 8 goes through, and we obtain the desired result. 4. The twodimensional sieve For a given positive integer m let us write, suppressing dependence on R, E m ˆfrl: mrl A; r, Rg and de ne F m similarly with A replaced by B.
15 546 r. c. baker, g. harman and j. pintz Lemma 4. Let x = 4 < M < x = and MN R < x «, and suppose M s is of type (.4). Then a m b n S E mn ; w ˆ y a y m b n S F mn ; w O yl A : 4: m, M n, N m, M n, N Proof. As in the proof of Lemma 8, the lefthand side of (4.) is a m b n m d jed mn j O ja m b n j jed mn j : 4: m; n d j P w d < g m; n g < d < g w Let L ˆ x=mn R. For given d j P w, jed mn jˆ ehˆ d ˆ ehˆ d ˆ ef gˆ d r, R e j r r; h ˆ r 0, R = e m f l } L h j l mn rl A! m f f j h l 0 } Lh f j r 0 mn er 0 hl 0 A : 4: r 00, R = ef l 0 } L = fg mn ef gr 00 l 0 A Thus, given any coef cients l d, with jl d j <, a m b n with c k ˆ m; n efg< g w efgj P w l efg m f d < g w d j P w l d jed mn jˆ c k k A m; n mn ef grlˆ k a m b n r, R = ef l } L = fg : 4:4 Let E >, F >, G >, EFG p gw, R ˆ R=EF, L ˆ L=FG, M s ˆ a m m s l efg m f ef g s ; m, M e, E; f, F g, G L s ˆ l s and R s ˆ r s : l } L r } R Lemma and the mean value theorem yield, for T 0 < U < T and max R ; L < 4U, Z U Z = Z = 4 Z = 4 jmr L it j dt < jm j jr j 4 jl j 4 U = p x = 4 v = «p x = «L A :
16 the difference between consecutive primes 547 If R or L is greater than 4U, we get the bound Z U U = jmr L it j dt p x = L A by arguing as at the start of the proof of Lemma. Consequently, F s ˆ c k k s ˆ M s R s L s b n n n s satis es Z T T 0 k } x jf it j dt p x = L A n p x = L A and (.) holds. In particular, the rst summand in (4.) is y a y m b n m; n d j P w d < g and the second is y O ja y m jjb n j m; n Moreover, ja m b n j m; n g < d < g w jb n j n m d jf mn d j O yl A 4:5 g < d < g w jfd mn j p ja m b n j m; n g = < e < g w e j P w jfd mn j O yl A : 4:6 r, R = ef mn ef grl B l } L = fg p y ja m b n j m; n mn ef gr : g < efg< g w r, R = ef Consider, for example, the part of the last sum with e > g = ; this is p y L B e p y L A by Lemma 7. It is now easy to complete the proof on combining this estimate with the formulas (4.5) and (4.6). Lemma 5. Let M } x a with 4 < a < ; let R p x = «. Suppose that M s is of type (.4). Then a m S E m ; x n ˆ y a y m S F m ; x n O yl A m, M m, M for all n < n a. Proof. We must show that c k 0 ˆ a m m, M r, R mrlˆ k w rl; z l
17 548 r. c. baker, g. harman and j. pintz satis es (.), where z ˆ x n. Imitating the proof of Lemma, we nd that this reduces to proving (.) for c 0 k j, c 00 k j, where c 0 k j ˆ rl w ; w ; p... p j c 00 k j ˆ a m mrlˆ k a m mrlˆ k w < p j <... < p < z p... p j j rl mp... p j p = j < x v w < p j <... < p < z p... p j j rl mp... p j p = j < x v < mp... p j p = j rl w ; p p... p j j (with obvious modi cations when j ˆ 0). Let P H denote a sum over all subsets H of f;...; jg; write u H ˆQ i H p i and v H ˆQ i 6 H; i < j p i.forp... p j counted in c 0 k j there is an H such that u H j r and r; v H ˆ. Thus, writing r 0 ˆ r=u H and l 0 ˆ l=v H, we have c 0 k j ˆ w r 0 l 0 ; w : H m a m p ;...; p j r 0, R =u H ; r 0 ; v H ˆ mr 0 p... p j l 0 ˆ k P Inserting the factor K Ç H ˆ 0= j K j P u K j r 0 in place of the condition r 0 ; v H ˆ, we arrive at c 0 k j ˆ H K Ç H ˆ 0= j K j a m w r 00 l 0 ; w m l 0 Here ˆ H K Ç H ˆ 0= Note that, recalling (.5), j K j m 0 A m 0 A m 0 ˆ Q m p i i 6 K m i 6 K p i ˆ m 0 p ;...; p j mr 00 u K p... p j l 0 ˆ k n m 0 n r 00 l 0 ˆ k l 0 r 00, R = u H u K b n w r 00 l 0 ; w : r 00 l 0 a m ; b n ˆ p i i K u K ˆn : 4:7 m 0 n < x = ; nr 00 p R p x = «; 4:8 hence m 0 < x = and m 0 n r 00 p x «in the last expression for c 0 k j. Since there are fewer than j < L possibilities for H and K, Lemma 4 yields (.) for c 0 k j. We may proceed similarly to obtain c 00 k j ˆ j K j H K Ç H ˆ 0= m w < p j <... < p < z r 00, R =u H u K mp... p = j < x v < mp... p = j mr 00 u K p... p j l 0 ˆ k l 0 w r 00 l 0 ; p j :
18 the difference between consecutive primes 549 We approximate this expression by the contribution from K ˆ 0=, c k ˆ w r 00 l 0 ; p j m p ;...; p j H r 00 mr 00 p... p j l 0 ˆ k where the summation conditions for m, p ;...; p j, r 00, l 0 are as in the preceding sum. We have jc 00 k j c k j < ja m 0j b n w r 00 l 0 ; w ˆC k ; H m 0 n l 0 K Ç H ˆ 0= K 6ˆ 0= m 0 n r 00 l 0 ˆ k l 0 r 00, R =u H u K say. Here A m 0 and b n are as in (4.7) and we see that C k ˆ y C y k O yl A ; k A k B while, for some H and K, C k p y L m 0 k B ja m 0j m 0 r 00 < x r 00 l 0 < x l 0 n > w n p y L A : Obviously, then, it suf ces to prove (.) for c k in place of c 00 k j. The argument is now essentially the same as the discussion of c 00 k j at the end of the proof of Lemma and we omit it. This completes the proof of Lemma 5. In the next lemma we use Lemma 5 to obtain a formula of the shape S A p p ; x n ˆ y S B y p p ; x n O yl A p, M p, R p, M p, R 4:9 that would be inaccessible by the method of. Lemma 6. Suppose that M ˆ x a, R < M and M R < x: Then (4.9) holds for n ˆ v. Proof. 5 yields Here In view of Lemma we may suppose that R > x v = «. Lemma p, M S E p ; x n ˆ y y p, M S F p ; x n O yl A : E p ˆfrl: r, R; p rl Ag and F p is de ned similarly with B in place of A.
19 550 r. c. baker, g. harman and j. pintz We have S E p ; x n ˆ jf p 0... p 0 u l: p 0... p 0 u, R; p p 0...p 0 u l A; p, M p, M ˆ p, M ˆ p, M x n < p 0 <... < p 0 u ; p 0... p 0 u, R S A p p 0 ; x n p 0, R p, M x n < p 0 = < R The second sum in the last expression is S ˆ y y p, M x n < p 0 = < R x n < p 0 <...< p 0 u; l; P x n ˆ gj S A p p 0... p 0 u ; x n p 0 < p 0 <... < p 0 u p 0... p 0 u, R = p 0 p 0 < p 0 <... < p 0 u p 0... p 0 u, R = p 0 S A p p 0 p 0... p 0 u ; x n : S B p p 0... p 0 u ; x n O yl A 4:0 by an application of Lemma. For this it suf ces to note that MR = p x =, and R=p p x = p p x = v v = «p x since v > 0:54. (Removal of the condition p 0 < p 0 is covered in [], as pointed out earlier.) Now S A p p 0 ; x n ˆ y S F p ; x n S O yl A p, M p 0, R y p, M ˆ y S B y p p 0 ; x n O yl A p, M p 0, R by an obvious variant of (4.0). This completes the proof of Lemma 6. Lemma 7. Let M < M < M,M M M < x and M > x v, and suppose M s and M s are of type (.4). Then, for 0 < n < v, a m b m S A m p m ; x n m, M p, M m, M ˆ y a y m b m S B m p m ; x n O yl A : m, M Proof. We have m, M p, M M M < M M M = < x = ; M p xm p x v : If M < x v = «, the result follows from Lemma. Suppose now that M > x v = «:
20 the difference between consecutive primes 55 Then M M > M > x = 4. Lemma 5 yields an asymptotic formula for a m b m S E m m ; x n : m, M m, M (Here R ˆ M.) In analogy with (4.0), a m b m S E m m ; x n m ; m ˆ a m b m S A m m p 0... p 0 ; x n u m ; m ˆ m ; m a m b m x n < p 0 <... < p 0 u p 0... p 0 u, M p 0, M m ; m x n < p 0 < M = S A m m p 0 ; x n p 0 < p 0 <... < p 0 u p 0... p 0 u, M = p 0 S A m m p 0... p 0 u ; x n : The second sum in the last expression is y S B m m p 0... p 0 ; x n O yl A : u y m ; m x n < p 0 < M = p 0 < p 0 <... < p 0 u p 0... p 0 u, M = p 0 To see this we divide it into two subsums de ned by (i) m m p 0 < x =, (ii) m m p 0 > x =. If condition (i) holds, then p 0...p 0 u p M x v p x v = v v = «p x since v > 0:54. We now get the desired result from Lemma, with variables regrouped as m ˆ m m p 0 and n ˆ p 0... p 0 u. If condition (ii) holds, then we regroup the variables differently, taking m ˆ m p 0... p 0 u p m M =p 0 p m m M x = p x = ; and n ˆ m p 0 p m M = p xm 5 = p x 5 v = 4 6 «p x v = «: Once again, the desired result follows from Lemma. We may now complete the proof in exactly the same way as the previous lemma. 5. Further asymptotic formulae Let L...L l ˆ x, l >, L j ˆ x a j and a j >«. We shall nd a region of a ;...; a l in which Z T T 0 jl it...l l it j h dt p x h = L A 5: for every A > 0. Here h ˆ or. The case h ˆ is needed for application to
21 55 r. c. baker, g. harman and j. pintz primes in almost all short intervals, which we shall consider in another paper. For h ˆ, (5.) permits us to evaluate... S A p... p l ; p l : p, L p l, L l This is essentially an application of Lemma 6. We have already discussed the removal of the condition b l ; P p l ˆ in counting p... p l b l in the last sum. In order to prove (5.) we need only prove jl it j...l l it j j h p x h = L A 5: j for any set S ˆft ; t ;...g in T 0 ; T Š with jt i t j j > i 6ˆ j. By a simple dyadic decomposition we may assume that L j j = j < jl j it j < Lj j = j where < j j < «and the lefthand inequality is to be deleted when j j ˆ. We recall that the Dirichlet polynomials L j have L j j j < L B.Forj ˆ we need to hypothesize the stronger inequality L j p L A 5: for every A > 0. Now (5.) will follow if we show that S :ˆ jsjl Y B L h j j j p L A 5:4 j (the product Q j runs over j ˆ ;...; l unless otherwise stated). We have at our disposal the bounds ( f as in (.)): jsjl B p max L g j j j j L k j j ; TL g j f j j j L k j f j where k and k are 0 or, and k j is 0 for j >. To see this, apply Lemma of [] tol g j j L k j. We write I j as an abbreviation for jsjl B p L g j j j j L k j j and II j for jsjl B p TL g j f j j j L k j f j : Lemma 8. With the above notation, suppose that h h k < ; v :ˆ k > 0; g g g g Let u ˆ P i > h=g i and suppose that 6 hv < g u h g h g Let b ; c ; a ; c ; b ; c ; a 4 ; c 4 ; a 5 ; b 5 ; c 5 ; a 6 ; b 6 ; c 6 i 6ˆ < hv: h hv > : g i g 5:5 be nonnegative numbers,
22 the difference between consecutive primes 55 a j h=6g ; h=g Š,b j h=6g ; h=g Š, u ˆ h b g c ˆ a h c g ˆ h b g c ˆ a 4 h c g 4 ˆ a r b r c r r > 5 ; 6 g c h hk g 6 g c h hk 6 h hk g 6 h hk g g < k b < g c h hk g < k a < g c h hk < k b g c < h hk g < k a 4 g c 4 < h hk g ; ; 6 g c 5 h < k a 5 k b 5 < g c 5 h ; 6 h < k a 6 k b 6 g c 6 < h: Then (5.) holds whenever a j > g j v j >, a 4 h g b a g c 4 h hk 4g k b > b «v ; 5:6 a 4 h g a a g c 4 h hk 4g k a > a «v ; 5:7 a 4 h g b a g c 4 h hk 4g k b a 4 h g a 4 a g c 4 4 h hk 4g k a 4 > u g ; ; > u h «v ; g 5:8 h «v ; g a 4 h g a 5 a 4 h g b 5 a g c 5 4 h k a 5 k b 5 5:9 > a 5 b 5 «v ; 5:0 and a 4 h g a 6 a 4 h g b 6 a g c 6 4 h k a 6 k b 6 a g u h h g g > u «v 4 hv > u h 5: h «v : 5: g g
23 554 r. c. baker, g. harman and j. pintz Proof. Since a j > gj v for j >, we have I j for j >. There are thus eight cases to consider. Case I, I, I. De ne l by h h v l ˆ g g g g j > j so that 0 < l < h from (5.5). Then S p Y j ˆ L g j g j j j j L k j k j j h = g j L g g j l v = g Y L g Y j g j j j j l = g j L h j j j : j > j Every L j j j in the above product has nonnegative exponent: the exponent is 0 for j < ; h k k lv ˆ h l v g g for j ˆ ; and h l for j >. Since h l v > 0, (5.4) now follows from (5.). Case I, II, I. Since b c ˆ u h=g, we have S p L g j L k j h = g TL g f j L k f j b Y Y L g g j c j > L g j g j j j j h = g j j L h j j j : The monomials in L j j j j 6ˆ, j 6ˆ have product and can be omitted; the corresponding step will be implicit in subsequent cases. Thus S p S j ; j, where S j ; j ˆT b L h j g b f j L g c h hk = g j k b f j < S 4 ; 4 : For the last inequality, we appeal to (.), using 6 h < g b < h 5: and 6 g c h hk < k g b < g c h hk : 5:4 g In subsequent cases, we leave the appeal to (.) implicit but mention the inequalities corresponding to (5.) and (5.4). Finally, (5.6) yields S 4 ; 4 ˆT b L h = 4 g b = L g c = h = 4 hk = 4 g k b = p L A : Case II, I, I. This is similar to the previous case, with L and L interchanged.
Counting Primes whose Sum of Digits is Prime
2 3 47 6 23 Journal of Integer Sequences, Vol. 5 (202), Article 2.2.2 Counting Primes whose Sum of Digits is Prime Glyn Harman Department of Mathematics Royal Holloway, University of London Egham Surrey
More informationNotes on Factoring. MA 206 Kurt Bryan
The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor
More informationSome Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.
Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,
More informationCONTRIBUTIONS TO ZERO SUM PROBLEMS
CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg
More informationIrreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients
DOI: 10.2478/auom20140007 An. Şt. Univ. Ovidius Constanţa Vol. 221),2014, 73 84 Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients Anca
More informationA simple criterion on degree sequences of graphs
Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree
More informationElements of probability theory
2 Elements of probability theory Probability theory provides mathematical models for random phenomena, that is, phenomena which under repeated observations yield di erent outcomes that cannot be predicted
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationMATH 289 PROBLEM SET 4: NUMBER THEORY
MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What
More informationSubsets of Euclidean domains possessing a unique division algorithm
Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness
More informationSECTION 102 Mathematical Induction
73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationOn the irreducibility of certain polynomials with coefficients as products of terms in an arithmetic progression
On the irreducibility of certain polynomials with coefficients as products of terms in an arithmetic progression Carrie E. Finch and N. Saradha Abstract We prove the irreducibility of ceratin polynomials
More informationSome facts about polynomials modulo m (Full proof of the Fingerprinting Theorem)
Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem) In order to understand the details of the Fingerprinting Theorem on fingerprints of different texts from Chapter 19 of the
More informationInteger roots of quadratic and cubic polynomials with integer coefficients
Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street
More informationOn the numbertheoretic functions ν(n) and Ω(n)
ACTA ARITHMETICA LXXVIII.1 (1996) On the numbertheoretic functions ν(n) and Ω(n) by Jiahai Kan (Nanjing) 1. Introduction. Let d(n) denote the divisor function, ν(n) the number of distinct prime factors,
More informationAll trees contain a large induced subgraph having all degrees 1 (mod k)
All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New
More informationThe cyclotomic polynomials
The cyclotomic polynomials Notes by G.J.O. Jameson 1. The definition and general results We use the notation e(t) = e 2πit. Note that e(n) = 1 for integers n, e(s + t) = e(s)e(t) for all s, t. e( 1 ) =
More informationPrimality  Factorization
Primality  Factorization Christophe Ritzenthaler November 9, 2009 1 Prime and factorization Definition 1.1. An integer p > 1 is called a prime number (nombre premier) if it has only 1 and p as divisors.
More informationInformation Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay
Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture  17 ShannonFanoElias Coding and Introduction to Arithmetic Coding
More informationAn example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept
More informationSUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by
SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples
More informationTAKEAWAY GAMES. ALLEN J. SCHWENK California Institute of Technology, Pasadena, California INTRODUCTION
TAKEAWAY GAMES ALLEN J. SCHWENK California Institute of Technology, Pasadena, California L INTRODUCTION Several games of Tf takeaway?f have become popular. The purpose of this paper is to determine the
More informationInteger Factorization using the Quadratic Sieve
Integer Factorization using the Quadratic Sieve Chad Seibert* Division of Science and Mathematics University of Minnesota, Morris Morris, MN 56567 seib0060@morris.umn.edu March 16, 2011 Abstract We give
More informationRevised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)
Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.
More informationProperties of BMO functions whose reciprocals are also BMO
Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a nonnegative BMOfunction w, whose reciprocal is also in BMO, belongs to p> A p,and
More informationThe Conference Call Search Problem in Wireless Networks
The Conference Call Search Problem in Wireless Networks Leah Epstein 1, and Asaf Levin 2 1 Department of Mathematics, University of Haifa, 31905 Haifa, Israel. lea@math.haifa.ac.il 2 Department of Statistics,
More informationSample Induction Proofs
Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given
More informationThe sum of digits of polynomial values in arithmetic progressions
The sum of digits of polynomial values in arithmetic progressions Thomas Stoll Institut de Mathématiques de Luminy, Université de la Méditerranée, 13288 Marseille Cedex 9, France Email: stoll@iml.univmrs.fr
More informationMean value theorems for long Dirichlet polynomials and tails of Dirichlet series
ACA ARIHMEICA LXXXIV.2 998 Mean value theorems for long Dirichlet polynomials and tails of Dirichlet series by D. A. Goldston San Jose, Calif. and S. M. Gonek Rochester, N.Y. We obtain formulas for computing
More informationU.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
More informationInduction Problems. Tom Davis November 7, 2005
Induction Problems Tom Davis tomrdavis@earthlin.net http://www.geometer.org/mathcircles November 7, 2005 All of the following problems should be proved by mathematical induction. The problems are not necessarily
More informationIntroduction to Finite Fields (cont.)
Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number
More informationPrime power degree representations of the symmetric and alternating groups
Prime power degree representations of the symmetric and alternating groups Antal Balog, Christine Bessenrodt, Jørn B. Olsson, Ken Ono Appearing in the Journal of the London Mathematical Society 1 Introduction
More informationPRIME FACTORS OF CONSECUTIVE INTEGERS
PRIME FACTORS OF CONSECUTIVE INTEGERS MARK BAUER AND MICHAEL A. BENNETT Abstract. This note contains a new algorithm for computing a function f(k) introduced by Erdős to measure the minimal gap size in
More informationPrime Numbers and Irreducible Polynomials
Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.
More informationLOGNORMAL MODEL FOR STOCK PRICES
LOGNORMAL MODEL FOR STOCK PRICES MICHAEL J. SHARPE MATHEMATICS DEPARTMENT, UCSD 1. INTRODUCTION What follows is a simple but important model that will be the basis for a later study of stock prices as
More informationCOMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS
Bull Austral Math Soc 77 (2008), 31 36 doi: 101017/S0004972708000038 COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V EROVENKO and B SURY (Received 12 April 2007) Abstract We compute
More informationn k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...
6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence
More informationCHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY
January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.
More informationOn the largest prime factor of the Mersenne numbers
On the largest prime factor of the Mersenne numbers Kevin Ford Department of Mathematics The University of Illinois at UrbanaChampaign Urbana Champaign, IL 61801, USA ford@math.uiuc.edu Florian Luca Instituto
More informationKevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm
MTHSC 412 Section 2.4 Prime Factors and Greatest Common Divisor Greatest Common Divisor Definition Suppose that a, b Z. Then we say that d Z is a greatest common divisor (gcd) of a and b if the following
More informationThe Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationRESULTANT AND DISCRIMINANT OF POLYNOMIALS
RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results
More informationComputing divisors and common multiples of quasilinear ordinary differential equations
Computing divisors and common multiples of quasilinear ordinary differential equations Dima Grigoriev CNRS, Mathématiques, Université de Lille Villeneuve d Ascq, 59655, France Dmitry.Grigoryev@math.univlille1.fr
More informationFaster deterministic integer factorisation
David Harvey (joint work with Edgar Costa, NYU) University of New South Wales 25th October 2011 The obvious mathematical breakthrough would be the development of an easy way to factor large prime numbers
More informationMaximum Hitting Time for Random Walks on Graphs. Graham Brightwell, Cambridge University Peter Winkler*, Emory University
Maximum Hitting Time for Random Walks on Graphs Graham Brightwell, Cambridge University Peter Winkler*, Emory University Abstract. For x and y vertices of a connected graph G, let T G (x, y denote the
More informationMeasuring Rationality with the Minimum Cost of Revealed Preference Violations. Mark Dean and Daniel Martin. Online Appendices  Not for Publication
Measuring Rationality with the Minimum Cost of Revealed Preference Violations Mark Dean and Daniel Martin Online Appendices  Not for Publication 1 1 Algorithm for Solving the MASP In this online appendix
More informationHomework until Test #2
MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such
More informationPOLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS
POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).
More informationEvery Positive Integer is the Sum of Four Squares! (and other exciting problems)
Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer
More informationVictims Compensation Claim Status of All Pending Claims and Claims Decided Within the Last Three Years
Claim#:021914174 Initials: J.T. Last4SSN: 6996 DOB: 5/3/1970 Crime Date: 4/30/2013 Status: Claim is currently under review. Decision expected within 7 days Claim#:041715334 Initials: M.S. Last4SSN: 2957
More information1.2 Solving a System of Linear Equations
1.. SOLVING A SYSTEM OF LINEAR EQUATIONS 1. Solving a System of Linear Equations 1..1 Simple Systems  Basic De nitions As noticed above, the general form of a linear system of m equations in n variables
More informationLecture 1: Systems of Linear Equations
MTH Elementary Matrix Algebra Professor Chao Huang Department of Mathematics and Statistics Wright State University Lecture 1 Systems of Linear Equations ² Systems of two linear equations with two variables
More informationMathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 19967 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationSECTION 0.6: POLYNOMIAL, RATIONAL, AND ALGEBRAIC EXPRESSIONS
(Section 0.6: Polynomial, Rational, and Algebraic Expressions) 0.6.1 SECTION 0.6: POLYNOMIAL, RATIONAL, AND ALGEBRAIC EXPRESSIONS LEARNING OBJECTIVES Be able to identify polynomial, rational, and algebraic
More informationLarge induced subgraphs with all degrees odd
Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order
More informationMATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
More informationTaylor Series and Asymptotic Expansions
Taylor Series and Asymptotic Epansions The importance of power series as a convenient representation, as an approimation tool, as a tool for solving differential equations and so on, is pretty obvious.
More informationON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction
ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove
More informationBest Monotone Degree Bounds for Various Graph Parameters
Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer
More informationThe Goldberg Rao Algorithm for the Maximum Flow Problem
The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }
More information9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
More informationFactorization Theorems
Chapter 7 Factorization Theorems This chapter highlights a few of the many factorization theorems for matrices While some factorization results are relatively direct, others are iterative While some factorization
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. FiniteDimensional
More informationLecture 6. Inverse of Matrix
Lecture 6 Inverse of Matrix Recall that any linear system can be written as a matrix equation In one dimension case, ie, A is 1 1, then can be easily solved as A x b Ax b x b A 1 A b A 1 b provided that
More informationTaylor Polynomials and Taylor Series Math 126
Taylor Polynomials and Taylor Series Math 26 In many problems in science and engineering we have a function f(x) which is too complicated to answer the questions we d like to ask. In this chapter, we will
More informationDETERMINANTS. b 2. x 2
DETERMINANTS 1 Systems of two equations in two unknowns A system of two equations in two unknowns has the form a 11 x 1 + a 12 x 2 = b 1 a 21 x 1 + a 22 x 2 = b 2 This can be written more concisely in
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationElementary Number Theory We begin with a bit of elementary number theory, which is concerned
CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,
More informationPythagorean vectors and their companions. Lattice Cubes
Lattice Cubes Richard Parris Richard Parris (rparris@exeter.edu) received his mathematics degrees from Tufts University (B.A.) and Princeton University (Ph.D.). For more than three decades, he has lived
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationComputing Cubic Fields in QuasiLinear Time
Computing Cubic Fields in QuasiLinear Time K. Belabas Département de mathématiques (A2X) Université Bordeaux I 351, cours de la Libération, 33405 Talence (France) belabas@math.ubordeaux.fr Cubic fields
More informationPartial Derivatives. @x f (x; y) = @ x f (x; y) @x x2 y + @ @x y2 and then we evaluate the derivative as if y is a constant.
Partial Derivatives Partial Derivatives Just as derivatives can be used to eplore the properties of functions of 1 variable, so also derivatives can be used to eplore functions of 2 variables. In this
More informationOPTIMAL SELECTION BASED ON RELATIVE RANK* (the "Secretary Problem")
OPTIMAL SELECTION BASED ON RELATIVE RANK* (the "Secretary Problem") BY Y. S. CHOW, S. MORIGUTI, H. ROBBINS AND S. M. SAMUELS ABSTRACT n rankable persons appear sequentially in random order. At the ith
More informationCS 103X: Discrete Structures Homework Assignment 3 Solutions
CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On wellordering and induction: (a) Prove the induction principle from the wellordering principle. (b) Prove the wellordering
More informationTenacity and rupture degree of permutation graphs of complete bipartite graphs
Tenacity and rupture degree of permutation graphs of complete bipartite graphs Fengwei Li, Qingfang Ye and Xueliang Li Department of mathematics, Shaoxing University, Shaoxing Zhejiang 312000, P.R. China
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An ndimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0534405967. Systems of Linear Equations Definition. An ndimensional vector is a row or a column
More informationON THE EMBEDDING OF BIRKHOFFWITT RINGS IN QUOTIENT FIELDS
ON THE EMBEDDING OF BIRKHOFFWITT RINGS IN QUOTIENT FIELDS DOV TAMARI 1. Introduction and general idea. In this note a natural problem arising in connection with socalled BirkhoffWitt algebras of Lie
More information8 Divisibility and prime numbers
8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 918/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationFACTORING LARGE NUMBERS, A GREAT WAY TO SPEND A BIRTHDAY
FACTORING LARGE NUMBERS, A GREAT WAY TO SPEND A BIRTHDAY LINDSEY R. BOSKO I would like to acknowledge the assistance of Dr. Michael Singer. His guidance and feedback were instrumental in completing this
More informationModule MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013
Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of
More informationPrimitive Prime Divisors of FirstOrder Polynomial Recurrence Sequences
Primitive Prime Divisors of FirstOrder Polynomial Recurrence Sequences Brian Rice brice@hmc.edu July 19, 2006 Abstract The question of which terms of a recurrence sequence fail to have primitive prime
More informationON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS
ON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS YANN BUGEAUD, FLORIAN LUCA, MAURICE MIGNOTTE, SAMIR SIKSEK Abstract If n is a positive integer, write F n for the nth Fibonacci number, and ω(n) for the number
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER
Séminaire Lotharingien de Combinatoire 53 (2006), Article B53g ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER RON M. ADIN AND YUVAL ROICHMAN Abstract. For a permutation π in the symmetric group
More informationTwo classes of ternary codes and their weight distributions
Two classes of ternary codes and their weight distributions Cunsheng Ding, Torleiv Kløve, and Francesco Sica Abstract In this paper we describe two classes of ternary codes, determine their minimum weight
More informationOn an antiramsey type result
On an antiramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider antiramsey type results. For a given coloring of the kelement subsets of an nelement set X, where two kelement
More informationFactoring & Primality
Factoring & Primality Lecturer: Dimitris Papadopoulos In this lecture we will discuss the problem of integer factorization and primality testing, two problems that have been the focus of a great amount
More informationarxiv:1112.0829v1 [math.pr] 5 Dec 2011
How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman Thomas P. Hayes arxiv:1112.0829v1 [math.pr] 5 Dec 2011 Abstract Consider a gambling game in which we are allowed to repeatedly
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More informationFactoring Algorithms
Factoring Algorithms The p 1 Method and Quadratic Sieve November 17, 2008 () Factoring Algorithms November 17, 2008 1 / 12 Fermat s factoring method Fermat made the observation that if n has two factors
More information14.451 Lecture Notes 10
14.451 Lecture Notes 1 Guido Lorenzoni Fall 29 1 Continuous time: nite horizon Time goes from to T. Instantaneous payo : f (t; x (t) ; y (t)) ; (the time dependence includes discounting), where x (t) 2
More information