An elegant proof from Erdős

Here’s an elegant proof from Paul Erdős that there are infinitely many primes. It also does more, giving a lower bound on π(N), the number of primes less than N. First, note that every integer n can be written as a product n = r s2 where r and s are integers and r is … Continue reading An elegant proof from Erdős