10.12.2012 Views

Prime Numbers

Prime Numbers

Prime Numbers

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

1.5 Exercises 65<br />

1.56. Prove the following theorem relevant to Wilson primes: if g is a<br />

primitive root of the prime p, then the Wilson quotient is given by<br />

<br />

j g<br />

p−1<br />

wp ≡<br />

j=1<br />

p<br />

<br />

g p−1−j (mod p).<br />

Then, using this result, give an algorithm that determines whether p with<br />

primitive root g = 2 is a Wilson prime, but using no multiplications; merely<br />

addition, subtraction, and comparison.<br />

1.57. There is a way to connect the notion of twin-prime pairs with the<br />

Wilson–Lagrange theorem as follows. Let p be an integer greater than 1. Prove<br />

the theorem of Clement that p, p + 2 is a twin-prime pair if and only if<br />

4(p − 1)! ≡−4 − p (mod p(p + 2)).<br />

1.58. How does one resolve the following “Mertens paradox”? Say x is a<br />

large integer and consider the “probability” that x is prime. As we know,<br />

primality<br />

√<br />

can be determined by testing x for prime divisors not exceeding<br />

x. But from Theorem 1.4.2, it would seem that when all the primes less<br />

than √ x are probabilistically sieved out, we end up with probability<br />

<br />

p≤ √ x<br />

<br />

1 − 1<br />

<br />

p<br />

∼ 2e−γ<br />

ln x .<br />

Arrive again at this same estimate by simply removing the floor functions in<br />

(1.46). However, the PNT says that the correct asymptotic probability that<br />

x is prime is 1/ ln x. Note that 2e −γ =1.1229189 ..., so what is a resolution?<br />

It has been said that the sieve of Eratosthenes is “more efficient than<br />

random,” and that is one way to envision the “paradox.” Actually, there has<br />

been some interesting work on ways to think of a resolution; for example, in<br />

[Furry 1942] there is an analysis of the action of the sieve of Eratosthenes on a<br />

prescribed interval [x, x + d], with some surprises uncovered in regard to how<br />

many composites are struck out of said interval; see [Bach and Shallit 1996,<br />

p. 365] for a historical summary.<br />

1.59. By assuming that relation (1.24) is valid whenever the integral<br />

converges, prove that M(x) =O(x 1/2+ɛ ) implies the Riemann hypothesis.<br />

1.60. There is a compact way to quantify the relation between the PNT and<br />

the behavior of the Riemann zeta function. Using the relation<br />

− ζ′ ∞<br />

(s)<br />

= s ψ(x)x<br />

ζ(s) −s−1 dx,<br />

show that the assumption<br />

1<br />

ψ(x) =x + O(x α )

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

Saved successfully!

Ooh no, something went wrong!