Find the minimum common difference for an increasing sequence of 6 prime numbers
MCD for an increasing arithmetic sequence of 6 primes
0
$\begingroup$
modular-arithmetic
-
0When you write, "common difference", is it fair to assume you mean for the primes to be in an arithmetic progression? – 2012-05-17
-
0Sorry about it How do I find the minimum common difference for an increasing sequence of 6 primes. I have not tried anything yet and I was just wondering on how to approach this question. Yes, I meant that the primes have to be in a sequence like 2,3,5,7,11,13 etc. Sorry about that – 2012-05-17
-
1I think you have missed my point. What do you mean by "common" in the phrase, "common difference"? Does the sequence $2,3,5,7,11,13$ that you gave have a common difference? Anyway, when you have figured out what you mean, why not try to solve something simpler first, say, 3 prime numbers instead of 6; if you succeed with that, think about 4 prime numbers, then 5, consider the patterns you are finding, I'm sure you'll be able to work out an answer for 6 (and if not you can come back here and show what you were able to do and we'll go on from there). – 2012-05-18