another of the many amazing uses of complex analysis is application to number theory, via Dirichlet series. One can apply the incredible principle of analytic continuation Hurkyl mentioned above to prove dirichlet's theorem on primes in arithmetic progression. here are notes from a course i taught years ago.
433/633: Summary of proof of Dirichlet's theorem
Introduction: Except for 2 and 5, all primes end in 1, 3, 7 or 9. We know there are infinitely many primes, and we could ask if there are infinitely many that end in each of those four integers. This can be phrased as: are there an infinite number of primes p such that p is congruent to a(mod 10), for every a such that gcd(a,10) = 1?
The answer is yes, and the idea for the proof is to show a prime is "equally likely" to have one ending as another, i.e. that given any choice a among the four numbers 1,3,7,9, the proportion of all primes ≤ n, and ending in a, approaches 1/4 as n --> infinity. The actual proof grows out of generalizing the fact that Summation 1/p, summed over all primes p, diverges.
A fancy way to say this is that g(s) = Summation of 1/p^s is asymptotic to log(1/(s-1));
i.e.as s-->1+, g(s) approaches infinity like log(1/(s-1)). Recall this gives a proof that there are infinitely many primes, since otherwise Summation 1/p^s as a finite sum of exponential functions, would be finite everywhere, hence also at s = 1.
Suppose A is a subset of primes consisting say of "half" of all primes in some sense. then we might expect that the sum gA(s) = Sum over A of 1/p^s, would only go to infinity "half as fast" as the full sum of 1/p^s , i.e. we might expect that gA(s) is asymptotic to (1/2) log(1/(s-1)).
Let's turn this intuition around and make this a definition:
I.e. A consists of "half" of all primes if the quotient gA(s)/[(1/2) log(1/(s-1))] approaches 1, as s-->1+, and we write this as gA(s) is asymptotic to
(1/2) log(1/(s-1)).
More generally if A is any subset of primes, we say that A has density k, where 0 ≤ k ≤ 1, if Sum over A of 1/p^s is asymptotic to k log(1/(s-1)).
Easy Remark: If density(A) > 0, then A is infinite.
Dirichlet`s theorem: Given m ≥ 2, and a with gcd(a,m) = 1,
if Pa = {p : p cong to a(mod m)},
then Density (Pa ) = 1/phi(m) > 0, where phi(m) is the number of positive integers less than m and relatively prime to m. In particular there infinitely many primes congruent to a mod m.
the proof method is roughly to apply analytic continuation to the function Summation of 1/p^s, as a function of the complex exponent s!
were these guys not geniuses?