I changed the Fibonacci sequence so that the first two terms were 2. I only saw 4 powers of two in this sequence (2, 2, 4, and 16). Is there a fifth power of two in this pattern, and is there an infinite number of powers of two in this pattern?
This discussion board is a place to discuss our Daily Challenges and the math and science
related to those challenges. Explanations are more than just a solution — they should
explain the steps and thinking strategies that you used to obtain the solution. Comments
should further the discussion of math and science.
When posting on Brilliant:
Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
Since it follows the Fibonacci recurrence relation, the general form would be a(21+5)n+b(21−5)n
To get a and b, you need to solve these two equations: a+b=c0a(21+5)+b(21−5)=c1 where c0 is the first term and c1 is the second term
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
I have no idea. I've only reached 2692538.
I got this formula where f0=2 and f1=2: 55+5(21+5)n+55−5(21−5)n where n represents the nth term of the sequence.
Log in to reply
Cool formula... How did you solve for that formula?
Log in to reply
Since it follows the Fibonacci recurrence relation, the general form would be a(21+5)n+b(21−5)n To get a and b, you need to solve these two equations: a+b=c0a(21+5)+b(21−5)=c1 where c0 is the first term and c1 is the second term