- #1

- 10

- 0

For example, the smallest possible arithmetic sequence consisting of five primes is: 5, 11, 17, 23, 29.

By the way, by "smallest possible" I mean that the last term in the sequence must be the smallest possible of all such sequences.

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- Thread starter adityab88
- Start date

- #1

- 10

- 0

For example, the smallest possible arithmetic sequence consisting of five primes is: 5, 11, 17, 23, 29.

By the way, by "smallest possible" I mean that the last term in the sequence must be the smallest possible of all such sequences.

- #2

Gib Z

Homework Helper

- 3,346

- 6

There is no such sequence.

- #3

- 367

- 1

- #4

Gib Z

Homework Helper

- 3,346

- 6

Ill reword it then, There is no such sequence that I can be bothered to find and that has any mathematical value. To find such a sequence all one needs is some programming knowledge and to be really bored.

- #5

arildno

Science Advisor

Homework Helper

Gold Member

Dearly Missed

- 10,025

- 135

So there, I have narrowed it down immensely.

- #6

- 529

- 1

(Actually, it sounds more like a Google problem)

- #7

Gib Z

Homework Helper

- 3,346

- 6

lol adityab88 you google recruit!!!!

- #8

- 14

- 0

To find such a sequence all one needs is some programming knowledge and to be really bored.

What type of programming do we need to solve this sort of mathematical problems? C++ ?

- #9

Gib Z

Homework Helper

- 3,346

- 6

No idea don't ask me lol.

If you want, start a thread here inquiring about this. But not C++ I know.

If you want, start a thread here inquiring about this. But not C++ I know.

- #10

- 14

- 0

Unfortunately, C++ is the only programming language I can use.No idea don't ask me lol.

If you want, start a thread here inquiring about this. But not C++ I know.

Regarding adityab88's question, here is a solution I've just gotten:

1, 11, 31, 61, 101, 151, 211, 281

And it's the smallest possible because 361 is not a prime

- #11

- 1,074

- 1

Unfortunately, C++ is the only programming language I can use.

Regarding adityab88's question, here is a solution I've just gotten:

1, 11, 31, 61, 101, 151, 211, 281

And it's the smallest possible because 361 is not a prime

However this is not an arithmetic sequence because consecutive terms do not differ by one single constant.

ie. 11-1=10, whereas 31-11=20, 61-31=30 etc..

- #12

- 14

- 0

For all terms in the sequence:However this is not an arithmetic sequence because consecutive terms do not differ by one single constant.

ie. 11-1=10, whereas 31-11=20, 61-31=30 etc..

[tex] X_n = X_{n-1} + ( (n-1) * 10 ) [/tex]

Starting from (n = 1), [tex] X_0 = 1 [/tex]

:uhh:

Is my solution too bad?

- #13

- 1,074

- 1

For all terms in the sequence:

[tex] X_n = X_{n-1} + ( (n-1) * 10 ) [/tex]

Starting from (n = 1), [tex] X_0 = 1 [/tex]

:uhh:

Is my solution too bad?

The only thing wrong with it is that it is not an arithmetic sequence.

An arithmetic sequence has terms of the form: a

Where a

- #14

- 10

- 0

i am quite sure you do not need programming equipment.

just your brains will suffice; i am sure of this becuase i saw this question on a maths paper, where computers were not allowed

this is all i have: the difference between the consecutive primes has to be a multiple of 30, i have shown this using some number theory. so, for example, the difference could be 60; a sequence like this (7, 67, 127, ...).

good luck and have fun!

- #15

- 998

- 0

The spacing also can't be 30:

7, 37, ..., 187 doesn't work because 187 = 11*17. But for any prime [itex]p \neq 7[/itex], we have [itex] p \equiv 2k[/itex] (mod 7) for some k, [itex]1 \leq k \leq 6[/itex]. Since 30 mod 7 = 2 that means that p+30q is divisible by 7 for some q, 1<q<=6.

That can be generalized to remove some other spacings too; I'm tired and will figure it out in the morning!

Edit: OK, I lied about figuring it out later!

You can also eliminate all other spacings, except those which are products of 7, in cases for any sequence which does not start with 7. So the sequence has to start with 7, or the spacing is a multiple of 7 (ie. 210, 420, etc.).

A little bit of experimenting then yields the sequence: 7, 157, 307, 457, 607, 757, 907

7, 37, ..., 187 doesn't work because 187 = 11*17. But for any prime [itex]p \neq 7[/itex], we have [itex] p \equiv 2k[/itex] (mod 7) for some k, [itex]1 \leq k \leq 6[/itex]. Since 30 mod 7 = 2 that means that p+30q is divisible by 7 for some q, 1<q<=6.

That can be generalized to remove some other spacings too; I'm tired and will figure it out in the morning!

Edit: OK, I lied about figuring it out later!

You can also eliminate all other spacings, except those which are products of 7, in cases for any sequence which does not start with 7. So the sequence has to start with 7, or the spacing is a multiple of 7 (ie. 210, 420, etc.).

A little bit of experimenting then yields the sequence: 7, 157, 307, 457, 607, 757, 907

Last edited:

- #16

Gib Z

Homework Helper

- 3,346

- 6

Thats top stuff there Data.

- #17

- 10

- 0

The spacing also can't be 30:

7, 37, ..., 187 doesn't work because 187 = 11*17. But for any prime [itex]p \neq 7[/itex], we have [itex] p \equiv 2k[/itex] (mod 7) for some k, [itex]1 \leq k \leq 6[/itex]. Since 30 mod 7 = 2 that means that p+30q is divisible by 7 for some q, 1<q<=6.

That can be generalized to remove some other spacings too; I'm tired and will figure it out in the morning!

Edit: OK, I lied about figuring it out later!

You can also eliminate all other spacings, except those which are products of 7, in cases for any sequence which does not start with 7. So the sequence has to start with 7, or the spacing is a multiple of 7 (ie. 210, 420, etc.).

A little bit of experimenting then yields the sequence: 7, 157, 307, 457, 607, 757, 907

good stuff

how long did it take you to "experiment" and find the final sequence? cause i was looking for it, too, but my experimentation did not really work.

- #18

- 998

- 0

Of course, from what I've done there was no particular reason to confine myself to sequences starting with 7, so it would be fair to consider it a lucky coincidence.

- #19

DaveC426913

Gold Member

- 20,601

- 4,066

What is an "arithmetical sequence"?

- #20

- 998

- 0

An arithmetic sequence is one of the form [itex](n,n+k,n+2k,n+3k,...,n+mk,...)[/itex].

- #21

- 367

- 0

Ah,yes,yes,...About five seconds :tongue:. It makes sense to start at 7; if you can find a sequence starting with 7 that has spacing smaller than 210 (and there's no smaller sequence starting with 7), then that's obviously the smallest one.

To me it makes sense to start with 199 and find "minimum" prime-sequence of 10 terms with spacing 210 :

[tex]

199, 409, 619, 829, 1039, 1249, 1459, 1669, 1879, 2089 [/tex].

But it took me longer time ,about 10 seconds:tongue:

- #22

- 705

- 15

What is an "arithmetical sequence"?

I've written a mini-introduction to arithmetic progressions https://www.physicsforums.com/blogs/edgardo-22482/arithmetic-progressions-mini-introduction-887/ [Broken]

Last edited by a moderator:

- #23

- 27

- 0

are there any non-primes in there?

but even if that is right (i doubt it is, i'm too tired to see the factors i probably should) i cheated b/c i guessed

- #24

- 1,074

- 1

are there any non-primes in there?

but even if that is right (i doubt it is, i'm too tired to see the factors i probably should) i cheated b/c i guessed

51 and 81 are both composite.

- #25

- 27

- 0

haha 9*9 = 81 yep im tired

Any idea where i could get a description of the concepts they are talking about? (I don't want to hijack the thread)

- #26

- 998

- 0

Any idea where i could get a description of the concepts they are talking about? (I don't want to hijack the thread)

All I used for this problem was a little bit of modular arithmetic.

Last edited:

Share:

- Replies
- 11

- Views
- 6K

- Replies
- 2

- Views
- 2K