Infinite primes via Fibonacci numbers
A well-known result about Fibonacci numbers says
gcd(Fm, Fn) = Fgcd(m, n)
In words, the greatest common divisor of the mth and nth Fibonacci numbers is the gth Fibonacci number where g is the greatest common divisor of m and n. You can find a proof here.
M. Wunderlich used this identity to create a short, clever proof that there are infinitely many primes.
Suppose on the contrary that there are only k prime numbers, and consider the set of Fibonacci numbers with prime indices: Fp1, Fp2, " Fpk. The Fibonacci theorem above tells us that these Fibonacci numbers are pairwise relatively prime: each pair has greatest common divisor F1 = 1.
Each of the Fibonacci numbers in our list must have only one prime factor. Why? Because we have assumed there are only k prime numbers, and no two of our Fibonacci numbers share a prime factor. But F19 = 4181 = 37*113. We've reached a contradiction, and so there must be infinitely many primes.
Source: M. Wunderlich, Another proof of the infinite primes theorem. American Mathematical Monthly, Vol. 72, No. 3 (March 1965), p. 305.
Here are a couple more unusual proofs that there are infinitely many primes. The first uses a product of sines. The second is from Paul ErdAs. It also gives a lower bound on I(N), the number of primes less than N.