Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Prove that there is no arithmetic progression that consists only of primes.

A question that I've been set; I'm guessing it makes use of primes being written in the form 4k+1 and 4k+3? Not sure where to start.

Thanks.

share|improve this question
1  
Play with some special cases. Can you find an arithmetic progression of primes with common difference 1? Why not? What about 2? 3? Can you find an argument that generalizes to any common difference d? –  Qiaochu Yuan Jan 27 '11 at 19:43
add comment

1 Answer

up vote 4 down vote accepted

An arithmetic progression is a sequence of the form $$a,\quad a+b,\quad a+2b,\quad a+3b,\quad a+4b,\quad\ldots, a+nb,\quad\ldots$$ with $b\neq 0$.

If $a$ is not prime, you're done. So suppose $a$ is a prime. Can you find a term later in the sequence that is guaranteed to be a multiple of $a$?

share|improve this answer
    
Thank you, I should have noticed this. A bit too late in the evening to be doing any of this. –  user6323 Jan 28 '11 at 0:00
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.