Euler's proof combines calculus and combinatorics in a remarkable way to prove that the primes never end! Euler's proof also reveals a deep connection between the primes and the function log(x).