Show that an infinite arithmetic progression of unequal terms cannot consist entirely of primes.
Solution
Let the difference be d. Take any term b > 1. Then b terms later we get b + bd = b(d+1) which is not a prime.
© John Scholes
jscholes@kalva.demon.co.uk
1 Nov 2003
Last corrected/updated 1 Nov 03