10.12.2012 Views

Prime Numbers

Prime Numbers

Prime Numbers

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

1.4 Analytic number theory 45<br />

bound on ζ(σ + it) could be given as a nontrivial power of t. For example, the<br />

Riemann zeta function can be bounded on the critical line σ =1/2, as<br />

ζ(1/2+it) =O(t 1/6 ),<br />

when t ≥ 1; see [Graham and Kolesnik 1991]. The exponent has been<br />

successively reduced over the years; for example, [Bombieri and Iwaniec 1986]<br />

established the estimate O t9/56+ɛ and [Watt 1989] obtained O t89/560+ɛ .<br />

The Lindelöf hypothesis is the conjecture that ζ(1/2 +it) =O(tɛ ) for any<br />

ɛ>0. This conjecture also has consequences for the distribution of primes,<br />

such as the following result in [Yu 1996]: If pn denotes the n-th prime, then<br />

on the Lindelöf hypothesis,<br />

<br />

pn≤x<br />

(pn+1 − pn) 2 = x 1+o(1) .<br />

The best that is known unconditionally is that the sum is O x23/18+ɛ for any<br />

ɛ>0, a result of D. Heath-Brown. A consequence of Yu’s conditional theorem<br />

is that for each ɛ>0, the number of integers n ≤ x such that the interval<br />

(n, n+n ɛ ) contains a prime is ∼ x. Incidentally, there is a connection between<br />

the Riemann hypothesis and the Lindelöf hypothesis: The former implies the<br />

latter.<br />

Though not easy, it is possible to get numerically explicit estimates via<br />

exponential sums. A recent tour de force is the paper [Ford 2002], where it is<br />

shown that<br />

|ζ(σ + it)| ≤76.2t 4.45(1−σ)3/2<br />

ln 2/3 t,<br />

for 1/2 ≤ σ ≤ 1andt≥2. Such results can lead to numerically explicit zerofree<br />

regions for the zeta function and numerically explicit bounds relevant to<br />

various prime-number phenomena.<br />

As for additive problems with primes, one may consider another important<br />

class of exponential sums, defined by<br />

En(t) = <br />

e 2πitp , (1.35)<br />

p≤n<br />

where p runs through primes. Certain integrals involving En(t) over finite<br />

domains turn out to be associated with deep properties of the prime numbers.<br />

In fact, Vinogradov’s proof that every sufficiently large odd integer is the<br />

sum of three primes starts essentially with the beautiful observation that the<br />

number of three-prime representations of n is precisely<br />

R3(n) =<br />

1<br />

=<br />

0<br />

<br />

n≥p,q,r ∈P<br />

1<br />

E<br />

0<br />

3 n(t)e −2πitn dt.<br />

e 2πit(p+q+r−n) dt (1.36)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!