Prime Number Arithmetic Progression

AI Thread Summary
The discussion focuses on finding the least possible value of the largest term in an arithmetic progression of seven distinct prime numbers. Participants explore various strategies, emphasizing the importance of avoiding common differences that lead to multiples of small primes, particularly 5 and 3. Suggestions include using a common difference of 10 or multiples of 6 to maximize the chances of generating longer sequences of primes. The conversation also highlights the necessity of considering primes that are congruent to 1 and 5 modulo 6 to improve the likelihood of forming valid progressions. Overall, the challenge lies in balancing the arithmetic properties of primes with the constraints of arithmetic progressions.
FeDeX_LaTeX
Science Advisor
Messages
436
Reaction score
13
"Determine the least possible value of the largest term in an arithmetic progression of seven distinct primes."

I really have no clue what to do here. Is there a general tactic that you can use to do this, other than trial and error? Some experimenting gives you these of arithmetic progressions:

5, 11, 17, 23, 29
5, 17, 29, 41, 53
7, 19, 31, 43
3, 7, 11
41, 47, 53, 59
61, 67, 73, 79
7, 37, 67, 97, 127, 157
107, 137, 167, 197, 227, 257
53, 113, 173, 233, 293, 353

I haven't found one that gives me a string of 7 primes yet and I've just been looking at primes under 100.

Of course there are general rules to follow when finding the strings that I spotted (shouldn't add a number to a prime which will land you on a multiple of 5, such as adding 12 to a prime excluding 2).

EDIT: Okay, I think I know how to solve this problem. If I had 4, 6 or 8, I'll never get a streak longer than 5, but if I choose a difference of +10 (or a multiple of 10), I might find one more easily.
 
Last edited:
Physics news on Phys.org
Remember, Prime Numbers except 2 or 3 can be expressed as 6k±1.
 
AGNuke said:
Remember, Prime Numbers except 2 or 3 can be expressed as 6k±1.

Thanks for this. So would it be worthwhile to only consider the primes that are 1 and 5 (mod 6)?
 
I assume that it would better help you to determine the prime number and thus the relevant progression.

Start from k=1, we get 5 and 7. Both are Primes.
k=2, we get 11 and 13.
k=3, we get 17 and 19.
k=4, we get 23 and 25, not a prime. And so on...

It may help you to get a proper listing, like it is probable that AP can be formed with common difference of 6, 12...

You can also look for Prime Generating Programs, if you want I can give you one.
 
Last edited:
But I thought that the required arithmetic progression here had to have a common difference that was a multiple of 10? All primes (except 2) are odd, and if you add a common difference that is a multiple of 6 to an odd prime, you will quickly end up with a multiple 5 and you will be unable to get an AP longer than 5 terms.
 
If the difference is 10 which is 1 mod 3 you get a number divisible by 3 at every third step. So you need to include 3 into the difference, it must be at least 2*3*5=30. That is 3 mod 7 and you will bump into a multiple of 7 in every 7th step...

ehild
 
I tried to combine those 2 formulas but it didn't work. I tried using another case where there are 2 red balls and 2 blue balls only so when combining the formula I got ##\frac{(4-1)!}{2!2!}=\frac{3}{2}## which does not make sense. Is there any formula to calculate cyclic permutation of identical objects or I have to do it by listing all the possibilities? Thanks
Since ##px^9+q## is the factor, then ##x^9=\frac{-q}{p}## will be one of the roots. Let ##f(x)=27x^{18}+bx^9+70##, then: $$27\left(\frac{-q}{p}\right)^2+b\left(\frac{-q}{p}\right)+70=0$$ $$b=27 \frac{q}{p}+70 \frac{p}{q}$$ $$b=\frac{27q^2+70p^2}{pq}$$ From this expression, it looks like there is no greatest value of ##b## because increasing the value of ##p## and ##q## will also increase the value of ##b##. How to find the greatest value of ##b##? Thanks
Back
Top