Second Fibonacci Sequence problem?

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?

#FibonacciNumbers #Fibonacci

Note by Phillip Williams
6 years, 6 months ago

No vote yet
1 vote

  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:

  • 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.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. 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 1

paragraph 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×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

I have no idea. I've only reached 2692538.

Phillip Williams - 6 years, 6 months ago

I got this formula where f0=2f_{0}=2 and f1=2f_{1}=2: 5+55(1+52)n+555(152)n\dfrac{5+\sqrt{5}}{5}\left(\dfrac{1+\sqrt{5}}{2}\right)^n+\dfrac{5-\sqrt{5}}{5}\left(\dfrac{1-\sqrt{5}}{2}\right)^n where nn represents the nthnth term of the sequence.

Marc Vince Casimiro - 6 years, 6 months ago

Log in to reply

Cool formula... How did you solve for that formula?

Phillip Williams - 6 years, 6 months ago

Log in to reply

Since it follows the Fibonacci recurrence relation, the general form would be a(1+52)n+b(152)na\left(\dfrac{1+\sqrt{5}}{2}\right)^n + b\left(\dfrac{1-\sqrt{5}}{2}\right)^n To get aa and bb, you need to solve these two equations: a+b=c0a+b=c_{0}a(1+52)+b(152)=c1a\left(\frac{1+\sqrt{5}}{2}\right)+b\left(\frac{1-\sqrt{5}}{2}\right)=c_{1} where c0c_{0} is the first term and c1c_{1} is the second term

Marc Vince Casimiro - 6 years, 6 months ago
×

Problem Loading...

Note Loading...

Set Loading...