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.4 Analytic number theory 33<br />

particular can be calculated using various enhancements, such as arithmetic<br />

progression-based products and polynomial evaluation, as discussed in<br />

Chapter 8.8. For example, it is known that for p =2 40 +5,<br />

(p − 1)! ≡−1 − 533091778023p (mod p 2 ),<br />

as obtained by polynomial evaluation of the relevant factorial [Crandall et al.<br />

1997]. This p is therefore not a Wilson prime, yet it is of interest that in this<br />

day and age, machines can validate at least 12-digit primes via application of<br />

Lagrange’s converse of the classical Wilson theorem.<br />

In searches for these rare primes, some “close calls” have been encountered.<br />

Perhaps the only importance of a close call is to verify heuristic beliefs about<br />

the statistics of such as the Fermat and Wilson quotients. Examples of the<br />

near misses with their very small (but alas nonzero) quotients are<br />

p = 76843523891, qp(2) ≡−2(modp),<br />

p = 12456646902457, qp(2) ≡ 4(modp),<br />

p = 56151923, wp ≡−1(modp),<br />

p = 93559087, wp ≡−3(modp),<br />

and we remind ourselves that the vanishing of any Fermat or Wilson quotient<br />

modulo p would have signaled a successful “strike.”<br />

1.4 Analytic number theory<br />

Analytic number theory refers to the marriage of continuum analysis with the<br />

theory of the (patently discrete) integers. In this field, one can use integrals,<br />

complex domains, and other tools of analysis to glean truths about the natural<br />

numbers. We speak of a beautiful and powerful subject that is both useful in<br />

the study of algorithms, and itself a source of many interesting algorithmic<br />

problems. In what follows we tour a few highlights of the analytic theory.<br />

1.4.1 The Riemann zeta function<br />

It was the brilliant leap of Riemann in the mid-19th century to ponder an<br />

entity so artfully employed by Euler,<br />

ζ(s) =<br />

∞<br />

n=1<br />

1<br />

, (1.17)<br />

ns but to ponder with powerful generality, namely, to allow s to attain complex<br />

values. The sum converges absolutely for Re(s) > 1, and has an analytic<br />

continuation over the entire complex plane, regular except at the single point<br />

s = 1, where it has a simple pole with residue 1. (That is, (s−1)ζ(s) is analytic<br />

in the entire complex plane, and its value at s = 1 is 1.) It is fairly easy to<br />

see how ζ(s) can be continued to the half-plane Re(s) > 0: For Re(s) > 1we

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

Saved successfully!

Ooh no, something went wrong!