×

# Prime Sequence

Let $$a_{0}=p$$, where $$p$$ is a prime number and

$$a_{n+1}=2a_{n}+1$$, for $$n=0,1,2...$$

Does there exist a value of $$p$$ such that the sequence consists entirely of prime numbers.

Note by Bruce Wayne
3 years, 11 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

You can surely have sequence of limited numbers which follows your desired pattern as if a(0) = 2, a(1) = 5, a(2) = 11, a(3) = 23, a(4) = 47. But can't obtain infinite sequence as it will break down as soon as unit's digit come to be 5.

As you can observe that prime numbers (except 2 & 5) has their units digits as 1, 3, 7, 9. Now suppose you choose some prime with their unit's digit as 1, 3, 7, 9.

a(0) = 31, a(1) = 63 [breakdown but sometimes number ending with 3 can be a prime number]

a(0) = 53, a(1) = 107, a(2) = 215 [sure breakdown as once you got a number a(n) ending with 7 then the number a(n+1) is ending with 5 and surely composite number.]

You can see examples 7 and 9 on your own according to this observation.

Thank You!

- 3 years, 11 months ago

Thinking differently!!! Good I appreciate your thinking.

- 3 years, 11 months ago