Squares in arithmetic progressions and infinitely many primes

Andrew Granville

Published 2017-08-23Version 1

We give a new proof that there are infinitely many primes, relying on van der Waerden's theorem for coloring the integers, and Fermat's theorem that there cannot be four squares in an arithmetic progression. We go on to discuss where else these ideas have come together in the past.