Fibonacci Sequence: 1, 1, 2, 3, 5, 8

  • Thread starter Thread starter gtfitzpatrick
  • Start date Start date
  • Tags Tags
    Sequence
Click For Summary

Homework Help Overview

The discussion revolves around the Fibonacci sequence, specifically its definition and the derivation of a general formula for its terms. Participants are tasked with writing out the first six terms and proving a specific formula related to the sequence.

Discussion Character

  • Exploratory, Mathematical reasoning, Problem interpretation

Approaches and Questions Raised

  • Participants discuss the initial terms of the Fibonacci sequence and express confusion regarding the proof of the formula. Some question whether the proof requires using the first six terms or if it focuses solely on the general formula. Others suggest looking for power law solutions to the recursion relation.

Discussion Status

There is active engagement with various interpretations of the problem. Some participants have provided guidance on finding a general solution through characteristic equations, while others express uncertainty about the correctness of the proposed formula. No consensus has been reached regarding the approach to proving the formula.

Contextual Notes

Participants are navigating the requirements of the homework, including the need to prove a formula that may not align with their understanding of the Fibonacci sequence. The discussion reflects a mix of initial conditions and the exploration of mathematical properties related to the sequence.

gtfitzpatrick
Messages
372
Reaction score
0
the Fibonacci sequence is defined by

a1 = a2 = 1, a(n+2)] = an + a(n+1).

write out the first 6 terms of the sequence and prove that an = 1/[tex]\sqrt{5}[/tex][ ((1+[tex]\sqrt{}5[/tex])/2)^2 - ((1-[tex]\sqrt{}5[/tex])/2)^2]
 
Physics news on Phys.org
the first 6 terms are 1,1,2,3,5,8 but from here where do i go proving this... totally lost
 
wait do i have to use the first 6 terms or do you think they just want me to prove it?
Thanks for any replies
 
gtfitzpatrick said:
wait do i have to use the first 6 terms or do you think they just want me to prove it?
Thanks for any replies

You've got the first 6 terms just fine. To find the general solution look for power law solutions an=r^n of your recursion relation. Put an=r^n into your recursion relation and solve for r. You should get a quadratic and two solutions. What are they?
 
gtfitzpatrick said:
the Fibonacci sequence is defined by

a1 = a2 = 1, a(n+2)] = an + a(n+1).

write out the first 6 terms of the sequence and prove that an = 1/[tex]\sqrt{5}[/tex][ ((1+[tex]\sqrt{}5[/tex])/2)^2 - ((1-[tex]\sqrt{}5[/tex])/2)^2]


This can't be the right formula for an. It varies with n, while your formula above is a constant.
 
The characteristic equation is [tex]r^{2}-r-1=0[/tex]

The roots are [tex]\frac {1+ \sqrt{5}}{2} , \frac {1- \sqrt{5}}{2}[/tex]

The general solution is then [tex]a_{n} = \alpha (\frac {1+ \sqrt{5}}{2})^{n} + \beta ({\frac{1- \sqrt{5}}{2})^n[/tex]

Then use the initial conditions, namely a0=1 and a1=1 to find [tex]\alpha[/tex] and [tex]\beta[/tex]
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 17 ·
Replies
17
Views
3K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K