ψ(y + h; q, a) ψ(y; q, a) Λ(n), (1.2) denotes a sum over a set of reduced residues modulo q. We shall assume throughout x 2, 1 q x, 1 h x, (1.
|
|
- Kenneth Simon
- 5 years ago
- Views:
Transcription
1 PRIMES IN SHORT SEGMENTS OF ARITHMETIC PROGRESSIONS D. A. Goldston and C. Y. Yıldırım. Introduction In this paper we study the mean suare distribution of primes in short segments of arithmetic progressions. Specifically we eamine I(, h, ) = * a() ( ψ(y + h;, a) ψ(y;, a) h ) dy (.) φ() where ψ(;, a) = n n a() Λ(n), (.) Λ is the von Mangoldt function, and * a() denotes a sum over a set of reduced residues modulo. We shall assume throughout,, h, (.3) the other ranges being without interest. As far as we are aware the only known result concerning the general function I(, h, ) is due to Prachar [], who showed that, assuming the Generalized Riemann Hypothesis (GRH) I(, h, ) hlog. (.4) On the other hand, much more is known about the special cases where one of the two aspects, segment or progression, is trivialized. Indeed, our function I(, h, ) is essentially a hybrid of the more familiar functions I(, h) = the second moment for primes in short intervals, and G(, ) = * a() (ψ(y + h) ψ(y) h) dy, (.5) ( ψ(;, a) ), (.6) φ() 99 Mathematics Subject Classification. Primary:M6. Supported by an NSF Grant The second author was on a sabbatical at San Jose State University Typeset by AMS-TEX
2 GOLDSTON AND YILDIRIM which measures the total variance in the prime number theorem for arithmetic progressions modulo. We see I(, h, ) = I(, h) so that I(, h, ) generalizes I(, h). We shall see for small that I(, h, ) behaves rather similarly to I(, h). When h is about then h I(,, h) will behave rather similarly to G(, ). In studying I(, h, ) we will use some techniues from the recent papers Goldston [4] and Friedlander and Goldston [] where I(, h) and G(, ) were eamined. It is helpful in understanding the results we obtain to first consider what follows from the Riemann Hypothesis (RH) and a strong form of the twin prime conjecture. Let N = N (k) = ma(0, k), N = N (, k) = min(, k), (.7) and E(, k) = where we define as usual S(k) = N (k)<n N (,k) C p k p> Λ(n)Λ(n + k) S(k)( k ), (.8) ( ) p, if k is even, k 0; p 0, if k is odd; (.9) with C = p> ( ) (p ). (.0) Theorem. Assume the Riemann Hypothesis and that for 0 < k and some given ǫ (0, 4 ) E(, k) +ǫ. (.) Then for h/ ǫ and h we have I(, h, ) hlog ( ). (.) h In the smaller range 4ǫ h/ ǫ we have I(, h, ) = hlog( h ) h γ + log π + log p +O(h )+O ǫ (h ǫ ). (.3) p In the case = we recover the formula I(, h) hlog(/h), h ǫ (.4) subject to the same hypotheses. We may conjecture that euation (.4) hold for the epanded range h ǫ, since Goldston and Montgomery [5] showed this conjecture is euivalent under the RH to a pair correlation conjecture for zeros of the Riemann zeta-function. Therefore we might conjecture the condition h/ ǫ for (.) might be relaed. In the case of G(, ) it was proved in [] that under the same conjectures G(, ) log, +ǫ. (.5)
3 PRIMES IN ARITHMETIC PROGRESSIONS 3 We mention that the case h/ may be dealt with trivially, and it is easy to show that I(, h, ) hlog, h. (.6) The conjecture (.) is a very strong conjecture and one purpose of this paper is to see what can be proved when we replace this conjecture with GRH. For certain small ranges of h and our results are unconditionally true, but the results conditional on GRH are more interesting. We begin by proving that (.) and (.3) holds for almost all in a smaller range. Theorem. Assume the Generalized Riemann Hypothesis. Then we have for h 3/4 Q h that I(, h, ) hlog( h ) + h γ + log π + log p p Q/< Q h 7 4 log min(h Q 3 log 3 Q, hq) + h (Q + log 3 ). (.7) From this theorem we obtain the following almost-all result, where we mean by almost-all that all ecept at most o(q) integers in the interval [Q/, Q] satisfy the given property. Corollary. Assume the Generalized Riemann Hypothesis. Then for almost all with h 3/4 log 5 h we have I(, h, ) hlog( h ) (.8) and for h = o() in the range h 3/4 log 5 o(h/ log 3 h) we have I(, h, ) hlog( h ) h γ + log π + log p. (.9) p The range where the Corollary holds is h h 4 log 5, (.0) which is smaller than the range of validity in Theorem. Net we prove a Barban-Davenport-Halberstam type theorem for I(, h, ). Theorem 3. Assume the Generalized Riemann Hypothesis. Then we have, for Q h, Q I(, h, ) = Qhlog( Q h ) cqh + O(min(Q 3 h log 3 Q, Qh) + O(Qh ) + O(h 3 log 6 ), (.)
4 4 GOLDSTON AND YILDIRIM where c = γ + log π + p log p p(p ). We thus obtain an asymptotic formula I(, h, ) Qhlog( Q h ) (.) Q provided h log 6 Q h. This gives a range of validity h h log 6 (.3) which is larger than the range in Theorem and close to Theorem when h is close to. All of our results in Theorems, and 3 contain an error term containing an O(h ) which is significant as a second order term if h is close to or eual to. This error term can be replaced by an eplicit epression; we have chosen not to do so to keep the appearance of the results as simple as possible. We have retained these terms in Lemma 4, and it is straightforward to retain them through the paper and obtain the complete second order terms for h close to. Finally we prove that we can obtain reasonable lower bounds for I(, h, ) consistent with (.7). Theorem 4. Assume the Generalized Riemann Hypothesis. Then for any ǫ > 0 and h 3, we have ǫ log 3 I(, h, ) h ( ( log ) ) 3 O(h(log log ) 3 ) (.4) h Letting h = α, we have in particular for any ǫ > 0 and 0 α 3, ( I(, h, ) 3 ) α ǫ h log. (.5) Euation (.5) improves the result obtained in [4]. This improvement is based on a suggestion of Heath-Brown. A similar improvement has been made in [3] for the result in []. Our results have interesting connections with the pair correlation of zeros of Dirichlet L-functions, and allow us to obtain new result that connect and etend the earlier work of Yıldırım [] and relate it to work of Özlük [0]. We will present these results in a later paper.. Preliminaries and Lemmas In this section we relate I(, h, ) to E(, k) and obtain the necessary lemmas for proving our results. We have I(, h, ) = * a() h φ() (ψ(y + h;, a) ψ(y;, a)) dy * a() (ψ(y + h;, a) ψ(y;, a)) dy + h φ() =S h φ() S + h φ(). (.)
5 PRIMES IN ARITHMETIC PROGRESSIONS 5 Now S = * a() n a() = Λ(n)f(n,, h), n (n,)= Λ(n) dy [,] [n h,n) where n, for n < + h h, for + h n f(n,, h) = dy = [,] [n h,n) n + h, for < n + h 0, elsewhere. (.) Since we conclude n +h (n,)> S = Λ(n) = <n +h ν p ν +h log p log p log, (.3) Λ(n)f(n,, h) + O(h log ). (.4) To evaluate sums involving f(n,, h) we use the following result. Lemma. Let C() = n c n. Then we have c n f(n,, h) = +h C(u)du <n +h where c v = 0 if v is not an integer. Proof. Since the left-hand side is +h f(u,, h)dc(u) = = the lemma follows. +h +h +h C(u)d u f(u,, h) C(u)du + +h C(u) du (.5) C(u)du, Now writing R() = ψ(), (.6) we obtain on taking C() = ψ() in Lemma that S = h + +h R(u)du To evaluate S, we use the following lemma. +h R(u) du. (.7)
6 6 GOLDSTON AND YILDIRIM Lemma. For real numbers a n and b n we have a n b m dy = a n b n f(n,, h) y<n y+h y<m y+h <n +h + (a n b n+k + a n+k b n )f(n,, h k). 0<k h <n +h k (.8) Proof. The left-hand side of (.8) is = <m,n +h m n h a n b m [,] [n h,n) [m h,m) dy. The terms n = m give the first term on the right of (.8). The terms with n < m are = a n b m f(n,, h (m n)), <n<m +h m n h and letting m = n + k this becomes 0<k h <n +h k a n b n+k f(n,, h k). The terms m < n contribute the symmetric term in (.8). S = By Lemma we see that <n +h (n,)= Λ (n)f(n,, h) + 0<k h k 0() <n n+h k (n(n+k),)= Λ(n)Λ(n + k)f(n,, h k). A calculation similar to (.3) shows that we may drop the conditions (n, ) = and (n(n + k), ) = in the above sums with an error h log + h log. (.9) Thus we have S = S 3 + S 4 + O(( + h )h log ), (.0) where and S 3 = Λ (n)f(n,, h) (.) <n +h S 4 = Λ(n)Λ(n + j)f(n,, h j). (.) 0<j h/ <n +h j
7 To evaluate S 3 we let PRIMES IN ARITHMETIC PROGRESSIONS 7 P() = n Λ (n) log + (.3) and on applying Lemma with C() = n Λ (n) we obtain ( + h) S 3 = + log( + h) () ( + h) log log( + h) log 3h + +h P(u)du +h P(u)du =hlog + log( ( + h ) ) + h( 3 ( + h ) + log 4( + h ) ( + h ) ) + h log( + h + h ) + +h P(u)du +h P(u)du. (.4) For S 4, we take C(u) = 0<n u Λ(n)Λ(n + j) in Lemma and obtain S 4 = = {( +h +h +h j 0<j u 0<j u +h j n u j n u j ) n uλ(n)λ(n + j)du} Λ(n)Λ(n + j)du On combining our results on S, S, and S 3 we obtain Λ(n)Λ(n + j) du. (.5) I(, h, ) =hlog + log( ( + h ) ) + h( 3 ( + h ) + log 4( + h ) ( + h ) ) + h log( + h + h ) + +h 0<j u +h n u j ( h +h R(u)du φ() + +h P(u)du +h 0<j u n u j Λ(n)Λ(n + j)du h φ() +h R(u) du ) Λ(n)Λ(n + j)du P(u)du + O( h log ) + O(h log ). (.6) We see that if h/ the double sums above vanish and by the prime number theorem the terms with R(u) and P(u) contribute h( + h φ() ) log A. Thus
8 8 GOLDSTON AND YILDIRIM euation (.6) follows from (.6). To evaluate the double sums over primes in (.6), we use (.8) and find +h +h = 0<j u 0<j h/ +h 0<j u n u j n u j (h j)s(j) + 0<j u Λ(n)Λ(n + j)du Λ(n)Λ(n + j)du +h 0<j u E(u, j)du E(u, j) du. (.7) To evaluate the singular series above we using the following result from []. Lemma 3. We have (y j)s(j) = y j y ( φ() y log y y γ+log π + for any δ, 0 < δ <, where, letting = (,), I δ (y, ) = S( ) πi δ+i δ i ζ(s) p ) log p +I δ (y, ), (.8) p ( )( y ) s+ ds + (p )p s s(s + ). Further, we have the estimates I δ (y, ) S()y δ δ ( ( δ) 3 + )( p δ and, for arbitrarily small fied ǫ, η > 0, and min 0<δ< + ), (.9) p ( δ) ( ) min I δ (y, ) min(y(log log 3) 3, y log y ep η ), (.0) 0<δ< log Q/< Q I δ ( h, ) min(q 3 h log 3 Q, Qh), (h ǫ Q h). (.) On combining (.6) with (.7) and (.8) we obtain the following result which we use in the proof of Theorems,, and 3.
9 PRIMES IN ARITHMETIC PROGRESSIONS 9 Lemma 4. We have I(, h, ) =hlog( h ) h γ + log π + + log p p log ( + h ) ( + h ) + log( ( + h ) ) + h ( + h ) log( + h + h ) + I δ( h, )) +h +h + E(u, j)du E(u, j)du 0<j u ( h +h R(u)du φ() + +h P(u)du +h +h R(u) du ) 0<j u P(u)du + O( h log ) + O(h log ). (.) 3. Proof of Theorems and. Assuming the Riemann Hypothesis, we have [] and by partial summation R() log, (3.) P() log 3. (3.) Using Lemma 4 and these estimates we find after epanding the logarithmic terms into power series that, assuming RH, I(, h, ) =hlog( h ) h γ + log π + log p p Since + O(h ) + I δ ( h, ) +h + 0<j u +h E(u, j)du 0<j u E(u, j)du + O( h / log ) + O(h / log 3 ). (3.3) φ() log p p p log log p p log log 3, (3.4) on using the former bound in (.0), and the conjectured bound (.) we see that (.) holds. In order to prove (.3) we need to show that min I δ ( h 0<δ<, ) h ǫ. (3.5)
10 0 GOLDSTON AND YILDIRIM If > e η (η will be specified in terms of ǫ below), then the latter bound in (.0) yields min I δ ( h 0<δ<, ) (h) +η. (3.6) For 4ǫ h ǫ and ǫ < 4 we have (h) +η (h (+ +4ǫ ) +η ǫ ( = h +4ǫ )(+η) h ǫ if we choose η = ǫ 3. For e η, we appeal to (.9) with δ = ǫ to see that (3.5) holds with the implied constant now depending on ǫ. We now turn to the proof of Theorem, which depends on the following result essentially due to Kaczorowski, Perelli, and Pintz [7]. Proposition. Assume the Generalized Riemann Hypothesis. Then, with H N, we have uniformly in N that N k N+H E(, k) H log. (3.7) We first derive Theorem, before making some comments on the proof of Proposition. By (3.3) we have Q/< Q I(, h, ) hlog( h ) + h γ + log π + log p p h Q + I δ ( h, ) Q/< Q + h ma ma u 3 0<v h Q/< Q 0<j v E(u, j) + O((h + hq) / log 3 ). (3.8) Now E(u, j) E(u, j) Q/< Q 0<j v 0<j v = k v τ(k) E(u, k) ( )( τ (k) k v k v E(u, k) ) v 3 4 u log 3 v log 4 u (3.9) where we have used k v τ (k) v log 3 v and Proposition in the last line. We apply (.) for the term involving I δ ( h, ) in (3.8), where the condition in (.)
11 PRIMES IN ARITHMETIC PROGRESSIONS is satisfied for h ǫ Q h, and conclude Q/< Q I(, h, ) hlog( h ) + h γ + log π + h Q + min(q 3 h log 3 Q, Qh) log p p + h 7 4 log h / log 3. (3.0) This proves Theorem. To prove the corollary, by (3.4) it is sufficient to pick Q so that the right hand side of (3.0) (or (.7)) is hqlog log. This is the case if h 3 4 log 5 Q h. If in addition, h = o() and Q = o(h/ log 3 h), then the right hand side of (3.0) is o(hq) which gives the second part of the corollary. Proposition is due to Kaczorowski, Perelli, and Pintz. The proof may be found in [7] with three modifications. First, in that paper the result is proved for the Goldbach problem, and therefore one replaces the generating function S(α) with S(α). This changes the main term to the one given in Proposition but all error terms are estimated with absolute value and therefore the rest of the proof goes through unchanged. Second, as mentioned in [8], Lemma should state /Q /Q ψ (N, χ, η) dη N log4 N Q (3.) where the original had the log factor log N instead; this slightly inflates the power of the log term in Proposition. Finally, there is an additional error term F(n, N, H) in the Kaczorowski, Perelli, and Pintz result that can be eliminated. To do this, as in [7] one derives from (3.) that a (a,)= /Q /Q R(η,, a) dη N log4 N Q (3.) and then by the Cauchy-Schwarz ineuality one obtains a (a,)= /Q /Q R(η,, a) dη N log N. (3.3) Q Using this estimate in the proof in [7] one obtains P log 3 which is smaller than the error estimate for 3 since Q. One then finds that F(n, N, H) can be absorbed into the main error term. 4. Proof of Theorem 3 The proof of Theorem 3 closely follows the proof of Theorem 4 of [] and therefore we do not repeat parts of the proof that need no alterations from the earlier proof. The information on twin primes we need is contained in the following Proposition.
12 GOLDSTON AND YILDIRIM Proposition. Assume the Generalized Riemann Hypothesis. Then we have for H R H that E(, j) H log 6. (4.) 0< j H R R< H j This generalizes Proposition 4 of [] which is the case H =. Proof of Theorem 3. Using the GRH estimate (.4) we have I(, h, ) = I(, h, ) + O(Q 0 hlog ), (4.) Q Q 0< Q where Q 0 will be chosen later. By (3.3) we therefore have on GRH that I(, h, ) = hlog( h ) h γ + log π + log p p Q Q 0< Q + O(Qh ) + I δ ( h, ) + Q 0< Q k+h ( ) k k= k Q 0< Q 0<j u k E(u, j)du + O(h / log 3 ) + O(Qh / log 3 ) + O(Q 0 hlog ) (4.3) First, an easy computation gives hlog( h ) h γ + log π + log p p Q 0< Q ( = Qhlog( Q h ) Qh γ + log π + ) log p + O(Q 0 hlog ). p(p ) p (4.4) Net by (.) we have, for h ǫ Q 0, I δ ( h, ) min(q 3 3 h log Q, Qh). (4.5) Q 0< Q Finally, by Proposition we have for h Q 0 k+h E(u, j)du k Q 0< Q = h k+h k 0<j u k ma 0 H h Q 0 R Q 0<j u k Q 0 Q 0< u k j 0<j H R R< H j E(, j) 0<j u k Q Q< u k j E(u, j)du h 3 log 6. (4.6)
13 PRIMES IN ARITHMETIC PROGRESSIONS 3 We now choose Q 0 = h. Therefore the conditions in euations (4.5) and (4.6) are satisfied, and Theorem 3 follows from (4.3), (4.4), (4.5), and (4.6). Proof of Proposition. We sketch the modifications needed in the proof of Proposition 4 in []. Since E(, k) = E(, k) we need only consider positive j. By (7.7) and (7.6) of [] we have E(, j) = I + I 3 + E + E + O(log j). (4.7) We shall denote f(j, ) = H,R j H R R< H j f(j, ). Then Lemma 7. of [] states that, for α b r r, (b, r) =, and r H R, W(α) = H,R e(jα) H log H. (4.8) r To prove Proposition we sum over j and in (4.7) and estimate each term on the right hand side. This was done in [] for the case H =. The argument is identical here only we apply the estimate (4.8) at the appropriate point in each estimation. We obtain in this way I H log 5, H,R E RH log H, H,R H,R H,R I 3 H R log6, E H R log3, log j H log. H,R (4.9) Taking H R H (which forces R / ), then all of these error terms are H log 6 and Proposition follows. 5. Proof of Theorem 4 The proof of Theorem 4 is similar to the proof of the lower bounds for I(, h) in [4] and G(, ) in []. We make use of the arithmetic function λ R (n) = r R We note the simple bound, for any ǫ > 0, We reuire the following lemma from []. µ (r) dµ(d). (5.) d r d n λ R (n) τ(n)log R n ǫ log R. (5.)
14 4 GOLDSTON AND YILDIRIM Lemma 5. Let L(R) = r R µ (r) = log R + O(). (5.3) For R, we have λ R (n)λ(n) = ψ()l(r) + O(R log ), (5.4) n λ R (n) = L(R) + O(R ). (5.5) n Letting E(;, a) = ψ(;, a) E,a φ(), where E,a = if (, a) = and is 0 otherwise, we have for 0 < k, with N, N as in (.7), that and N (k)<n N (,k) N (k)<n N (,k) ( ) kτ(k) λ R (n)λ(n + k) = S(k)( k ) + O φ(k)r + O( r R µ (r)r log(r/r) E(N + k; r, k) E(N + k; r, k) ), (5.6) ( ) kτ(k) λ R (n)λ R (n + k) = S(k)( k ) + O + O(R ). (5.7) φ(k)r Proof of Theorem 4. By (.), (.7), and (3.) we have on RH that I(, h, ) = S h h + O( φ() φ() log ). (5.8) Let a() denote a sum over a complete set of residues modulo. By (.9) and the euation above it we see that S = a() = a() (ψ(y + h;, a) ψ(y;, a)) dy + O(h( h + )log ) y<n y+h n a() Λ(n) dy + O(h( h + )log ) = S + O(h( h + )log ). (5.9) We now obtain a lower bound for S through the ineuality J(, ) = a() y<n y+h n a() (Λ(n) λ R (n)) dy 0. (5.0)
15 PRIMES IN ARITHMETIC PROGRESSIONS 5 Writing R (n) = Λ(n) λ R (n), we have by Lemma that J(, ) = ( ( R (n)) f(n,, h) a() = S <n +h n a() <n +h 0<k h k 0() + 0<k h k 0() ( <n +h k n n+k a() α(n, 0)f(n,, h) <n +h k ) ) R (n) R (n + k)f(n,, h k) α(n, k)f(n,, h k), (5.) where α(n, k) = Λ(n)λ R (n + k) + Λ(n + k)λ R (n) λ R (n)λ R (n + k). To evaluate these sums we use Lemma and Lemma 5. In order to control the error term O(R ) in (5.5) and (5.7) we assume R. (5.) By (5.3),(5.4), (5.5), (5.) and the prime number theorem we have that α(n, 0) = log R + O() n which on applying Lemma gives together with (5.) that <n +h α(n, 0)f(n,, h) = hlog R + O(h). (5.3) By replacing by + k in (5.6) and (5.7) and using the case of k negative in (5.6) to handle the term Λ(n)λ R (n + k) we obtain ( ) kτ(k) α(n, k) = S(k) + O + O(R ) φ(k)r n + O ( r R µ (r)r log(r/r) ( E( + k; r, k) + E(; r, k) + E(k; r, k) ) ). (5.4) By Lemma we now obtain α(n, k)f(n,, h k) 0<k h k 0() <n +h k = 0<j h <n +h j α(n, j)f(n,, h j) = (h j)s(j) + O(R(, h, )), (5.5)
16 6 GOLDSTON AND YILDIRIM where R(, h, ) = h R + l= By Lemma 3 we have l+h j l jτ(j) φ(j) r R + h R µ (r)r log(r/r) ma v u+j E(v; r, j) du. (5.6) (h j)s(j) = h φ() hlog h + O(h(log log 3)3, (5.7) and therefore we conclude by (5.8), (5.9), (5.0), (5.), (5.3), (5.5) and (5.7) that subject to (5.) and RH I(, h, ) hlog R h + O(h(log log 3)3 ) + O( h φ() log ) + O(R(, h, )). It remains to bound R(, h, ). Since (5.8) jτ(j) φ(j) τ() φ() jτ(j) φ(j) hǫ ( + log h ), we see where R(, h, ) h ǫ R = h log R r R R log h + h R + R, (5.9) µ (r)r ma u +h E(u; r, j). (5.0) The simplest way to bound R is to use the bound [] E(,, a) log (), which assumes GRH. This was done in [4] and []. Heath-Brown observed that one can do better by taking advantage of the averaging over j. To do this, we use Hooley s GRH estimate [6] * a() ma E(u;, u a) log 4. (5.) This result without the ma is a well known result of Turán and of Montgomery [9]. Now in the inner sum in (5.0) we insert the condition (r, j) = with an error (r,j)> ψ(3; r, j) p r n 3 p n Λ(n) h log p r h log.
17 PRIMES IN ARITHMETIC PROGRESSIONS 7 Since for (j, r) = the seuence of j will run through a reduced set of residues modulo r as j runs through a reduced set of residues modulo r, we see that R h logr r R (r,)= µ (r)r (j,r)= ma u +h By Cauchy s ineuality and (5.) we have r R (r,)= µ (r)r (j,r)= r R (r,)= ma u +h µ (r)r ( ) h r R (r,)= ( ) h ( h R r R E(u; r, j) + hr ( ) ( h (j,r)= µ ( (r)r + h r µ (r)r ) We conclude by (5.9), (5.) and (5.3) that ( ) h R R(, h, ) h log 3 We now obtain from (5.8) that + hr E(u; r, j) h R log 3 + O( ) (5.) ma u +h ) E(u; r, j) ) ( * ma E(u; r, j) j(r) u 3 ( ( ) ) h + log r ) log. (5.3) + h ǫ R log h + h R log 3 I(, h, ) hlog R h + O(h(log log )3 ) + R, + h R. (5.4) where We take ( h R R h log 3 + hr R = ( h log 3 + hǫ log R ) log 3 ) + hr. and see that R = O(h) subject to the condition that h 3. We conclude ǫ log 3 that I(, h, ) h ( ( log ) ) 3 O(h(log log ) 3 ) (5.5) h which proves Theorem 4.
18 8 GOLDSTON AND YILDIRIM References. H Davenport, Multiplicative Number Theory, second edition, revised by H. L. Montgomery, Springer-Verlag (Berlin).. J. B. Friedlander and D. A. Goldston, Variance of distribution of primes in residue classes, Quart. J. Math. Oford () 47 (996), J. B. Friedlander and D. A. Goldston, Note on a Variance in the Distribution of Primes, Conference Proceedings (997). 4. D. A. Goldston, A lower bound for the second moment of primes in short intervals, Epo. Math. 3 (995), D. A. Goldston and H. L. Montgomery, Pair correlation of zeros and primes in short intervals, Analytic Number Theory and Diophantine Problems, Birkhaüser, Boston, Mass., 987, pp C. Hooley, On the Barban-Davenport-Halberstam theorem: VI, J. London Math. Soc. () 3 (976), J. Kaczorowski, A. Perelli, and J. Pintz, A note on the eceptional set for Goldbach s problem in short intervals, Mh. Math. 6 (993), A. Languasco and A. Perelli, A pair correlation hypothesis and the eceptional set in Goldbach s problem, Mathematika 43 (996), H. L. Montgomery, Multiplicative Number Theory, Lecture Notes in Mathematics, vol. 7, Springer-Verlag, Berlin, A. E. Özlük, On the -analogue of the pair correlation conjecture, Journal of Number Theory 59 (996), K. Prachar, Generalisation of a theorem of A. Selberg on primes in short intervals, Topics in Number Theory, Debrecen, 974, pp C. Y. Yıldırım, The pair correlation of zeros of Dirichlet L-functions and primes in arithmetic progressions, Manuscripta Math. 7 (99), DAG:Department of Mathematics and Computer Science, San Jose State University, San Jose, CA 959, USA address: goldston@jupiter.sjsu.edu CYY:Department of Mathematics, Bilkent University, Ankara 06533, Turkey address: yalcin@sci.bilkent.edu.tr
PRIMES IN SHORT SEGMENTS OF ARITHMETIC PROGRESSIONS
Can. J. Mat. Vol. 50 (3), 998 pp. 563 580 PRIMES IN SHORT SEGMENTS OF ARITHMETIC PROGRESSIONS D. A. GOLDSTON AND C. Y. YILDIRIM ABSTRACT. Consider te variance for te number of primes tat are bot in te
More informationLecture 1: Small Prime Gaps: From the Riemann Zeta-Function and Pair Correlation to the Circle Method. Daniel Goldston
Lecture 1: Small Prime Gaps: From the Riemann Zeta-Function and Pair Correlation to the Circle Method Daniel Goldston π(x): The number of primes x. The prime number theorem: π(x) x log x, as x. The average
More informationarxiv:math/ v2 [math.nt] 4 Feb 2006
arxiv:math/0512436v2 [math.nt] 4 Feb 2006 THE PATH TO RECENT PROGRESS ON SMALL GAPS BETWEEN PRIMES D. A. GOLDSTON, J. PINTZ AND C. Y. YILDIRIM 1. Introduction In the articles Primes in Tuples I & II ([13],
More informationPrimes in almost all short intervals and the distribution of the zeros of the Riemann zeta-function
Primes in almost all short intervals and the distribution of the zeros of the Riemann zeta-function Alessandro Zaccagnini Dipartimento di Matematica, Università degli Studi di Parma, Parco Area delle Scienze,
More informationThe path to recent progress on small gaps between primes
Clay Mathematics Proceedings Volume 7, 2007 The path to recent progress on small gaps between primes D. A. Goldston, J. Pintz, and C. Y. Yıldırım Abstract. We present the development of ideas which led
More informationBefore giving the detailed proof, we outline our strategy. Define the functions. for Re s > 1.
Chapter 7 The Prime number theorem for arithmetic progressions 7. The Prime number theorem We denote by π( the number of primes. We prove the Prime Number Theorem. Theorem 7.. We have π( as. log Before
More informationThe zeros of the derivative of the Riemann zeta function near the critical line
arxiv:math/07076v [mathnt] 5 Jan 007 The zeros of the derivative of the Riemann zeta function near the critical line Haseo Ki Department of Mathematics, Yonsei University, Seoul 0 749, Korea haseoyonseiackr
More informationHarmonic sets and the harmonic prime number theorem
Harmonic sets and the harmonic prime number theorem Version: 9th September 2004 Kevin A. Broughan and Rory J. Casey University of Waikato, Hamilton, New Zealand E-mail: kab@waikato.ac.nz We restrict primes
More informationThe major arcs approximation of an exponential sum over primes
ACTA ARITHMETICA XCII.2 2 The major arcs approximation of an exponential sum over primes by D. A. Goldston an Jose, CA. Introduction. Let. α = Λnenα, eu = e 2πiu, where Λn is the von Mangoldt function
More informationFirst, let me recall the formula I want to prove. Again, ψ is the function. ψ(x) = n<x
8.785: Analytic Number heory, MI, spring 007 (K.S. Kedlaya) von Mangoldt s formula In this unit, we derive von Mangoldt s formula estimating ψ(x) x in terms of the critical zeroes of the Riemann zeta function.
More informationSome Arithmetic Functions Involving Exponential Divisors
2 3 47 6 23 Journal of Integer Sequences, Vol. 3 200, Article 0.3.7 Some Arithmetic Functions Involving Exponential Divisors Xiaodong Cao Department of Mathematics and Physics Beijing Institute of Petro-Chemical
More informationOn Roth's theorem concerning a cube and three cubes of primes. Citation Quarterly Journal Of Mathematics, 2004, v. 55 n. 3, p.
Title On Roth's theorem concerning a cube and three cubes of primes Authors) Ren, X; Tsang, KM Citation Quarterly Journal Of Mathematics, 004, v. 55 n. 3, p. 357-374 Issued Date 004 URL http://hdl.handle.net/107/75437
More informationOn the Subsequence of Primes Having Prime Subscripts
3 47 6 3 Journal of Integer Sequences, Vol. (009, Article 09..3 On the Subsequence of Primes Having Prime Subscripts Kevin A. Broughan and A. Ross Barnett University of Waikato Hamilton, New Zealand kab@waikato.ac.nz
More informationCharacter sums with Beatty sequences on Burgess-type intervals
Character sums with Beatty sequences on Burgess-type intervals William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bbanks@math.missouri.edu Igor E. Shparlinski Department
More informationarxiv: v2 [math.nt] 28 Jun 2012
ON THE DIFFERENCES BETWEEN CONSECUTIVE PRIME NUMBERS I D. A. GOLDSTON AND A. H. LEDOAN arxiv:.3380v [math.nt] 8 Jun 0 Abstract. We show by an inclusion-eclusion argument that the prime k-tuple conjecture
More informationPrime Number Theory and the Riemann Zeta-Function
5262589 - Recent Perspectives in Random Matrix Theory and Number Theory Prime Number Theory and the Riemann Zeta-Function D.R. Heath-Brown Primes An integer p N is said to be prime if p and there is no
More informationGOLDBACH S PROBLEMS ALEX RICE
GOLDBACH S PROBLEMS ALEX RICE Abstract. These are notes from the UGA Analysis and Arithmetic Combinatorics Learning Seminar from Fall 9, organized by John Doyle, eil Lyall, and Alex Rice. In these notes,
More informationLINNIK S THEOREM MATH 613E UBC
LINNIK S THEOREM MATH 63E UBC FINAL REPORT BY COLIN WEIR AND TOPIC PRESENTED BY NICK HARLAND Abstract This report will describe in detail the proof of Linnik s theorem regarding the least prime in an arithmetic
More informationMath 229: Introduction to Analytic Number Theory The product formula for ξ(s) and ζ(s); vertical distribution of zeros
Math 9: Introduction to Analytic Number Theory The product formula for ξs) and ζs); vertical distribution of zeros Behavior on vertical lines. We next show that s s)ξs) is an entire function of order ;
More informationas x. Before giving the detailed proof, we outline our strategy. Define the functions for Re s > 1.
Chapter 7 The Prime number theorem for arithmetic progressions 7.1 The Prime number theorem Denote by π( the number of primes. We prove the Prime Number Theorem. Theorem 7.1. We have π( log as. Before
More informationA remark on a conjecture of Chowla
J. Ramanujan Math. Soc. 33, No.2 (2018) 111 123 A remark on a conjecture of Chowla M. Ram Murty 1 and Akshaa Vatwani 2 1 Department of Mathematics, Queen s University, Kingston, Ontario K7L 3N6, Canada
More informationPRIMES IN TUPLES I arxiv:math/ v1 [math.nt] 10 Aug 2005
PRIMES IN TUPLES I arxiv:math/050885v [math.nt] 0 Aug 2005 D. A. GOLDSTON, J. PINTZ, AND C. Y. YILDIRIM Abstract. We introduce a method for showing that there exist prime numbers which are very close together.
More informationPATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS
PATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS JÁNOS PINTZ Rényi Institute of the Hungarian Academy of Sciences CIRM, Dec. 13, 2016 2 1. Patterns of primes Notation: p n the n th prime, P = {p i } i=1,
More informationVARIANTS OF EQUIDISTRIBUTION IN ARITHMETIC PROGRESSION AND THE TWIN PRIME CONJECTURE
VARIANTS OF EQUIDISTRIBUTION IN ARITHMETIC PROGRESSION AND THE TWIN PRIME CONJECTURE AKSHAA VATWANI ABSTRACT. Let H = {h 1... h k } be fied set of k distinct non-negative integers. We show that Bombieri-Vinogradov
More informationGeneralized Euler constants
Math. Proc. Camb. Phil. Soc. 2008, 45, Printed in the United Kingdom c 2008 Cambridge Philosophical Society Generalized Euler constants BY Harold G. Diamond AND Kevin Ford Department of Mathematics, University
More informationON THE AVERAGE RESULTS BY P. J. STEPHENS, S. LI, AND C. POMERANCE
ON THE AVERAGE RESULTS BY P J STEPHENS, S LI, AND C POMERANCE IM, SUNGJIN Abstract Let a > Denote by l ap the multiplicative order of a modulo p We look for an estimate of sum of lap over primes p on average
More informationarxiv: v1 [math.nt] 24 Mar 2009
A NOTE ON THE FOURTH MOMENT OF DIRICHLET L-FUNCTIONS H. M. BUI AND D. R. HEATH-BROWN arxiv:93.48v [math.nt] 4 Mar 9 Abstract. We prove an asymptotic formula for the fourth power mean of Dirichlet L-functions
More information#A61 INTEGERS 14 (2014) SHORT EFFECTIVE INTERVALS CONTAINING PRIMES
#A6 INTEGERS 4 (24) SHORT EFFECTIVE INTERVALS CONTAINING PRIMES Habiba Kadiri Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Canada habiba.kadiri@uleth.ca Allysa
More informationEXPLICIT CONSTANTS IN AVERAGES INVOLVING THE MULTIPLICATIVE ORDER
EXPLICIT CONSTANTS IN AVERAGES INVOLVING THE MULTIPLICATIVE ORDER KIM, SUNGJIN DEPARTMENT OF MATHEMATICS UNIVERSITY OF CALIFORNIA, LOS ANGELES MATH SCIENCE BUILDING 667A E-MAIL: 70707@GMAILCOM Abstract
More informationFlat primes and thin primes
Flat primes and thin primes Kevin A. Broughan and Zhou Qizhi University of Waikato, Hamilton, New Zealand Version: 0th October 2008 E-mail: kab@waikato.ac.nz, qz49@waikato.ac.nz Flat primes and thin primes
More informationTwin primes (seem to be) more random than primes
Twin primes (seem to be) more random than primes Richard P. Brent Australian National University and University of Newcastle 25 October 2014 Primes and twin primes Abstract Cramér s probabilistic model
More informationMath 680 Fall A Quantitative Prime Number Theorem I: Zero-Free Regions
Math 68 Fall 4 A Quantitative Prime Number Theorem I: Zero-Free Regions Ultimately, our goal is to prove the following strengthening of the prime number theorem Theorem Improved Prime Number Theorem: There
More informationSOME MEAN VALUE THEOREMS FOR THE RIEMANN ZETA-FUNCTION AND DIRICHLET L-FUNCTIONS D.A. KAPTAN, Y. KARABULUT, C.Y. YILDIRIM 1.
SOME MEAN VAUE HEOREMS FOR HE RIEMANN ZEA-FUNCION AND DIRICHE -FUNCIONS D.A. KAPAN Y. KARABUU C.Y. YIDIRIM Dedicated to Professor Akio Fujii on the occasion of his retirement 1. INRODUCION he theory of
More informationNORMAL NUMBERS AND UNIFORM DISTRIBUTION (WEEKS 1-3) OPEN PROBLEMS IN NUMBER THEORY SPRING 2018, TEL AVIV UNIVERSITY
ORMAL UMBERS AD UIFORM DISTRIBUTIO WEEKS -3 OPE PROBLEMS I UMBER THEORY SPRIG 28, TEL AVIV UIVERSITY Contents.. ormal numbers.2. Un-natural examples 2.3. ormality and uniform distribution 2.4. Weyl s criterion
More informationA proof of Selberg s orthogonality for automorphic L-functions
A proof of Selberg s orthogonality for automorphic L-functions Jianya Liu, Yonghui Wang 2, and Yangbo Ye 3 Abstract Let π and π be automorphic irreducible cuspidal representations of GL m and GL m, respectively.
More informationOn a diophantine inequality involving prime numbers
ACTA ARITHMETICA LXI.3 (992 On a diophantine inequality involving prime numbers by D. I. Tolev (Plovdiv In 952 Piatetski-Shapiro [4] considered the following analogue of the Goldbach Waring problem. Assume
More informationTheorem 1.1 (Prime Number Theorem, Hadamard, de la Vallée Poussin, 1896). let π(x) denote the number of primes x. Then x as x. log x.
Chapter 1 Introduction 1.1 The Prime Number Theorem In this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if lim f(/g( = 1, and denote by log the natural
More informationErgodic aspects of modern dynamics. Prime numbers in two bases
Ergodic aspects of modern dynamics in honour of Mariusz Lemańczyk on his 60th birthday Bedlewo, 13 June 2018 Prime numbers in two bases Christian MAUDUIT Institut de Mathématiques de Marseille UMR 7373
More informationAverage Orders of Certain Arithmetical Functions
Average Orders of Certain Arithmetical Functions Kaneenika Sinha July 26, 2006 Department of Mathematics and Statistics, Queen s University, Kingston, Ontario, Canada K7L 3N6, email: skaneen@mast.queensu.ca
More informationChapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem
Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f g as if lim
More informationTHE NUMBER OF GOLDBACH REPRESENTATIONS OF AN INTEGER
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 140, Number 3, March 01, Pages 795 804 S 000-9939011)10957- Article electronicall published on Jul 0, 011 THE NUMBER OF GOLDBACH REPRESENTATIONS
More informationOn the counting function for the generalized. Niven numbers
On the counting function for the generalized Niven numbers R. C. Daileda, Jessica Jou, Robert Lemke-Oliver, Elizabeth Rossolimo, Enrique Treviño Introduction Let q 2 be a fied integer and let f be an arbitrary
More informationTWO PROOFS OF THE PRIME NUMBER THEOREM. 1. Introduction
TWO PROOFS OF THE PRIME NUMBER THEOREM PO-LAM YUNG Introduction Let π() be the number of primes The famous prime number theorem asserts the following: Theorem (Prime number theorem) () π() log as + (This
More informationOn the maximal exponent of the prime power divisor of integers
Acta Univ. Sapientiae, Mathematica, 7, 205 27 34 DOI: 0.55/ausm-205-0003 On the maimal eponent of the prime power divisor of integers Imre Kátai Faculty of Informatics Eötvös Loránd University Budapest,
More informationBounds for the Eventual Positivity of Difference Functions of Partitions into Prime Powers
3 47 6 3 Journal of Integer Seuences, Vol. (7), rticle 7..3 ounds for the Eventual Positivity of Difference Functions of Partitions into Prime Powers Roger Woodford Department of Mathematics University
More informationOn the counting function for the generalized Niven numbers
On the counting function for the generalized Niven numbers Ryan Daileda, Jessica Jou, Robert Lemke-Oliver, Elizabeth Rossolimo, Enrique Treviño Abstract Given an integer base q 2 and a completely q-additive
More informationOn the representation of primes by polynomials (a survey of some recent results)
On the representation of primes by polynomials (a survey of some recent results) B.Z. Moroz 0. This survey article has appeared in: Proceedings of the Mathematical Institute of the Belarussian Academy
More informationOn Some Mean Value Results for the Zeta-Function and a Divisor Problem
Filomat 3:8 (26), 235 2327 DOI.2298/FIL6835I Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On Some Mean Value Results for the
More informationZeros of the Riemann Zeta-Function on the Critical Line
Zeros of the Riemann Zeta-Function on the Critical Line D.R. Heath-Brown Magdalen College, Oxford It was shown by Selberg [3] that the Riemann Zeta-function has at least c log zeros on the critical line
More informationDirichlet s Theorem. Martin Orr. August 21, The aim of this article is to prove Dirichlet s theorem on primes in arithmetic progressions:
Dirichlet s Theorem Martin Orr August 1, 009 1 Introduction The aim of this article is to prove Dirichlet s theorem on primes in arithmetic progressions: Theorem 1.1. If m, a N are coprime, then there
More informationChapter One. Introduction 1.1 THE BEGINNING
Chapter One Introduction. THE BEGINNING Many problems in number theory have the form: Prove that there eist infinitely many primes in a set A or prove that there is a prime in each set A (n for all large
More informationON PRIMES IN QUADRATIC PROGRESSIONS & THE SATO-TATE CONJECTURE
ON PRIMES IN QUADRATIC PROGRESSIONS & THE SATO-TATE CONJECTURE LIANGYI ZHAO INSTITUTIONEN FÖR MATEMATIK KUNGLIGA TEKNISKA HÖGSKOLAN (DEPT. OF MATH., ROYAL INST. OF OF TECH.) STOCKHOLM SWEDEN Dirichlet
More informationZeros of Dirichlet L-Functions over the Rational Function Field
Zeros of Dirichlet L-Functions over the Rational Function Field Julio Andrade (julio_andrade@brown.edu) Steven J. Miller (steven.j.miller@williams.edu) Kyle Pratt (kyle.pratt@byu.net) Minh-Tam Trinh (mtrinh@princeton.edu)
More informationAn Exploration of the Arithmetic Derivative
An Eploration of the Arithmetic Derivative Alaina Sandhu Final Research Report: Summer 006 Under Supervision of: Dr. McCallum, Ben Levitt, Cameron McLeman 1 Introduction The arithmetic derivative is a
More informationGoldbach and twin prime conjectures implied by strong Goldbach number sequence
Goldbach and twin prime conjectures implied by strong Goldbach number sequence Pingyuan Zhou E-mail:zhoupingyuan49@hotmail.com Abstract In this note, we present a new and direct approach to prove the Goldbach
More informationON THE SPEISER EQUIVALENT FOR THE RIEMANN HYPOTHESIS. Extended Selberg class, derivatives of zeta-functions, zeros of zeta-functions
ON THE SPEISER EQUIVALENT FOR THE RIEMANN HYPOTHESIS RAIVYDAS ŠIMĖNAS Abstract. A. Speiser showed that the Riemann hypothesis is equivalent to the absence of non-trivial zeros of the derivative of the
More informationDistribution of Prime Numbers Prime Constellations Diophantine Approximation. Prime Numbers. How Far Apart Are They? Stijn S.C. Hanson.
Distribution of How Far Apart Are They? June 13, 2014 Distribution of 1 Distribution of Behaviour of π(x) Behaviour of π(x; a, q) 2 Distance Between Neighbouring Primes Beyond Bounded Gaps 3 Classical
More informationON THE CONSTANT IN BURGESS BOUND FOR THE NUMBER OF CONSECUTIVE RESIDUES OR NON-RESIDUES Kevin J. McGown
Functiones et Approximatio 462 (2012), 273 284 doi: 107169/facm/201246210 ON THE CONSTANT IN BURGESS BOUND FOR THE NUMBER OF CONSECUTIVE RESIDUES OR NON-RESIDUES Kevin J McGown Abstract: We give an explicit
More informationChapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem
Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if
More informationOn the Error Term for the Mean Value Associated With Dedekind Zeta-function of a Non-normal Cubic Field
Λ44ΩΛ6fi Ψ ο Vol.44, No.6 05ffμ ADVANCES IN MAHEMAICS(CHINA) Nov., 05 doi: 0.845/sxjz.04038b On the Error erm for the Mean Value Associated With Dedekind Zeta-function of a Non-normal Cubic Field SHI Sanying
More informationSpecial values of derivatives of L-series and generalized Stieltjes constants
ACTA ARITHMETICA Online First version Special values of derivatives of L-series and generalized Stieltjes constants by M. Ram Murty and Siddhi Pathak (Kingston, ON To Professor Robert Tijdeman on the occasion
More informationAPPROXIMATIONS FOR SOME FUNCTIONS OF PRIMES
APPROXIMATIONS FOR SOME FUNCTIONS OF PRIMES Fataneh Esteki B. Sc., University of Isfahan, 2002 A Thesis Submitted to the School of Graduate Studies of the University of Lethbridge in Partial Fulfillment
More informationOn Carmichael numbers in arithmetic progressions
On Carmichael numbers in arithmetic progressions William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bbanks@math.missouri.edu Carl Pomerance Department of Mathematics
More informationLARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS
LARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS HELMUT MAIER AND MICHAEL TH. RASSIAS Abstract. We rove a modification as well as an imrovement
More informationAnalytic Number Theory
American Mathematical Society Colloquium Publications Volume 53 Analytic Number Theory Henryk Iwaniec Emmanuel Kowalski American Mathematical Society Providence, Rhode Island Contents Preface xi Introduction
More informationA Remark on Sieving in Biased Coin Convolutions
A Remark on Sieving in Biased Coin Convolutions Mei-Chu Chang Department of Mathematics University of California, Riverside mcc@math.ucr.edu Abstract In this work, we establish a nontrivial level of distribution
More informationOn Gelfond s conjecture on the sum-of-digits function
On Gelfond s conjecture on the sum-of-digits function Joël RIVAT work in collaboration with Christian MAUDUIT Institut de Mathématiques de Luminy CNRS-UMR 6206, Aix-Marseille Université, France. rivat@iml.univ-mrs.fr
More informationMULTIPLICATIVE FUNCTIONS IN SHORT INTERVALS
MULTIPLICATIVE FUNCTIONS IN SHORT INTERVALS KAISA MATOMÄKI AND MAKSYM RADZIWI L L Abstract. We introduce a general result relating short averages of a multiplicative function to long averages which are
More informationON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM. 1. Introduction
ON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM A. DUBICKAS and A. NOVIKAS Abstract. Let E(4) be the set of positive integers expressible by the form 4M d, where M is a multiple of the product ab and
More informationSome unusual identities for special values. of the Riemann zeta function. by William D. Banks. 1. Introduction p s ) 1
Some unusual identities for special values of the Riemann zeta function by William D Banks Abstract: In this paper we use elementary methods to derive some new identities for special values of the Riemann
More informationON THE LOGARITHMIC DERIVATIVES OF DIRICHLET L-FUNCTIONS AT s = 1
ON THE LOGARITHMIC DERIVATIVES OF DIRICHLET L-FUNCTIONS AT s = YASUTAKA IHARA, V. KUMAR MURTY AND MAHORO SHIMURA Abstract. We begin the study of how the values of L (χ, )/L(χ, ) are distributed on the
More informationOn the number of elements with maximal order in the multiplicative group modulo n
ACTA ARITHMETICA LXXXVI.2 998 On the number of elements with maximal order in the multiplicative group modulo n by Shuguang Li Athens, Ga.. Introduction. A primitive root modulo the prime p is any integer
More informationResolving Grosswald s conjecture on GRH
Resolving Grosswald s conjecture on GRH Kevin McGown Department of Mathematics and Statistics California State University, Chico, CA, USA kmcgown@csuchico.edu Enrique Treviño Department of Mathematics
More informationSieve theory and small gaps between primes: Introduction
Sieve theory and small gaps between primes: Introduction Andrew V. Sutherland MASSACHUSETTS INSTITUTE OF TECHNOLOGY (on behalf of D.H.J. Polymath) Explicit Methods in Number Theory MATHEMATISCHES FORSCHUNGSINSTITUT
More informationA class of trees and its Wiener index.
A class of trees and its Wiener index. Stephan G. Wagner Department of Mathematics Graz University of Technology Steyrergasse 3, A-81 Graz, Austria wagner@finanz.math.tu-graz.ac.at Abstract In this paper,
More informationThe Circle Method. Basic ideas
The Circle Method Basic ideas 1 The method Some of the most famous problems in Number Theory are additive problems (Fermat s last theorem, Goldbach conjecture...). It is just asking whether a number can
More informationGoldbach's problem with primes in arithmetic progressions and in short intervals
Goldbach's problem with primes in arithmetic progressions and in short intervals Karin Halupczok Journées Arithmétiques 2011 in Vilnius, June 30, 2011 Abstract: We study the number of solutions in Goldbach's
More informationarxiv:math/ v1 [math.nt] 27 May 2006
arxiv:math/0605696v1 [math.nt] 27 May 2006 SMALL GAPS BETWEEN PRIME NUMBERS: THE WORK OF GOLDSTON-PINTZ-YILDIRIM K. Soundararajan Introduction. In early 2005, Dan Goldston, János Pintz, and Cem Yıldırım
More informationRiemann Zeta Function and Prime Number Distribution
Riemann Zeta Function and Prime Number Distribution Mingrui Xu June 2, 24 Contents Introduction 2 2 Definition of zeta function and Functional Equation 2 2. Definition and Euler Product....................
More informationEvidence for the Riemann Hypothesis
Evidence for the Riemann Hypothesis Léo Agélas September 0, 014 Abstract Riemann Hypothesis (that all non-trivial zeros of the zeta function have real part one-half) is arguably the most important unsolved
More information= 1 2 x (x 1) + 1 {x} (1 {x}). [t] dt = 1 x (x 1) + O (1), [t] dt = 1 2 x2 + O (x), (where the error is not now zero when x is an integer.
Problem Sheet,. i) Draw the graphs for [] and {}. ii) Show that for α R, α+ α [t] dt = α and α+ α {t} dt =. Hint Split these integrals at the integer which must lie in any interval of length, such as [α,
More informationLarge Sieves and Exponential Sums. Liangyi Zhao Thesis Director: Henryk Iwaniec
Large Sieves and Exponential Sums Liangyi Zhao Thesis Director: Henryk Iwaniec The large sieve was first intruded by Yuri Vladimirovich Linnik in 1941 and have been later refined by many, including Rényi,
More informationIMPROVING RIEMANN PRIME COUNTING
IMPROVING RIEMANN PRIME COUNTING MICHEL PLANAT AND PATRICK SOLÉ arxiv:1410.1083v1 [math.nt] 4 Oct 2014 Abstract. Prime number theorem asserts that (at large x) the prime counting function π(x) is approximately
More informationMath 259: Introduction to Analytic Number Theory Exponential sums IV: The Davenport-Erdős and Burgess bounds on short character sums
Math 259: Introduction to Analytic Number Theory Exponential sums IV: The Davenport-Erdős and Burgess bounds on short character sums Finally, we consider upper bounds on exponential sum involving a character,
More informationON THE SECOND MOMENT FOR PRIMES IN AN ARITHMETIC PROGRESSION
ON THE SECOND MOMENT FOR PRIMES IN AN ARITHMETIC PROGRESSION D. A. Goldston and C. Y. Yıldıım 2 Abstact. Assuming the Genealized Riemann Hypothesis, we obtain a lowe bound within a constant facto of the
More informationREPRESENTATION OF A POSITIVE INTEGER BY A SUM OF LARGE FOUR SQUARES. Byeong Moon Kim. 1. Introduction
Korean J. Math. 24 (2016), No. 1, pp. 71 79 http://dx.doi.org/10.11568/kjm.2016.24.1.71 REPRESENTATION OF A POSITIVE INTEGER BY A SUM OF LARGE FOUR SQUARES Byeong Moon Kim Abstract. In this paper, we determine
More informationOn the elliptic curve analogue of the sum-product problem
Finite Fields and Their Applications 14 (2008) 721 726 http://www.elsevier.com/locate/ffa On the elliptic curve analogue of the sum-product problem Igor Shparlinski Department of Computing, Macuarie University,
More informationMATH39001 Generating functions. 1 Ordinary power series generating functions
MATH3900 Generating functions The reference for this part of the course is generatingfunctionology by Herbert Wilf. The 2nd edition is downloadable free from http://www.math.upenn. edu/~wilf/downldgf.html,
More informationUniform Distribution of Zeros of Dirichlet Series
Uniform Distribution of Zeros of Dirichlet Series Amir Akbary and M. Ram Murty Abstract We consider a class of Dirichlet series which is more general than the Selberg class. Dirichlet series in this class,
More informationON THE SUM OF DIVISORS FUNCTION
Annales Univ. Sci. Budapest., Sect. Comp. 40 2013) 129 134 ON THE SUM OF DIVISORS FUNCTION N.L. Bassily Cairo, Egypt) Dedicated to Professors Zoltán Daróczy and Imre Kátai on their 75th anniversary Communicated
More informationOn primitive sets of squarefree integers
On primitive sets of suarefree integers R. Ahlswede and L. Khachatrian Fakultät für Mathematik Universität Bielefeld Postfach 003 3350 Bielefeld and A. Sárközy * Eötvös Loránd University Department of
More informationarxiv: v2 [math.gm] 24 May 2016
arxiv:508.00533v [math.gm] 4 May 06 A PROOF OF THE RIEMANN HYPOTHESIS USING THE REMAINDER TERM OF THE DIRICHLET ETA FUNCTION. JEONWON KIM Abstract. The Dirichlet eta function can be divided into n-th partial
More informationSTRINGS OF CONSECUTIVE PRIMES IN FUNCTION FIELDS NOAM TANNER
STRINGS OF CONSECUTIVE PRIMES IN FUNCTION FIELDS NOAM TANNER Abstract In a recent paper, Thorne [5] proved the existence of arbitrarily long strings of consecutive primes in arithmetic progressions in
More informationUniform Distribution of Zeros of Dirichlet Series
Uniform Distribution of Zeros of Dirichlet Series Amir Akbary and M. Ram Murty Abstract We consider a class of Dirichlet series which is more general than the Selberg class. Dirichlet series in this class,
More informationLaura Chihara* and Dennis Stanton**
ZEROS OF GENERALIZED KRAWTCHOUK POLYNOMIALS Laura Chihara* and Dennis Stanton** Abstract. The zeros of generalized Krawtchouk polynomials are studied. Some interlacing theorems for the zeros are given.
More informationA proof of Selberg s orthogonality for automorphic L-functions
A proof of Selberg s orthogonality for automorphic L-functions Jianya Liu 1, Yonghui Wang 2, and Yangbo Ye 3 Abstract Let π and π be automorphic irreducible cuspidal representations of GL m ) and GL m
More informationTHE 4.36-TH MOMENT OF THE RIEMANN ZETA-FUNCTION
HE 4.36-H MOMEN OF HE RIEMANN ZEA-FUNCION MAKSYM RADZIWI L L Abstract. Conditionally on the Riemann Hypothesis we obtain bounds of the correct order of magnitude for the k-th moment of the Riemann zeta-function
More informationOn some lower bounds of some symmetry integrals. Giovanni Coppola Università di Salerno
On some lower bounds of some symmetry integrals Giovanni Coppola Università di Salerno www.giovannicoppola.name 0 We give lower bounds of symmetry integrals I f (, h) def = sgn(n x)f(n) 2 dx n x h of arithmetic
More informationThe ternary Goldbach problem. Harald Andrés Helfgott. Introduction. The circle method. The major arcs. Minor arcs. Conclusion.
The ternary May 2013 The ternary : what is it? What was known? Ternary Golbach conjecture (1742), or three-prime problem: Every odd number n 7 is the sum of three primes. (Binary Goldbach conjecture: every
More informationA Local-Global Principle for Diophantine Equations
A Local-Global Principle for Diophantine Equations (Extended Abstract) Richard J. Lipton and Nisheeth Vishnoi {rjl,nkv}@cc.gatech.edu Georgia Institute of Technology, Atlanta, GA 30332, USA. Abstract.
More information