Purchase Solution

Fibonacci Sequence Problem

Not what you're looking for?

Ask Custom Question

The problem is

Take any of the generalizations about the Fibonacci Numbers that we have considered, and investigate what happens if the sequence is formed by two different starting numbers but continues in the same way by adding successive pairs of terms. For example, you might form a new pseudo-Fibonacci sequence in this way:
2, 5, 7, 12, 19, 31, 50, 81, 131,.....

a) Does the generalization still hold? Why or why not?
b) Can you generalize for all Fibonacci-type sequences?
======

I have 3 generalizations:
1) f_n = 2f_(n-1) - f_(n-3)
2) f_(n+4) + f_(n+1) = 2f_(n+3)
3) summation from of f_i where i from 1 to n = f_(n+2) - 1

Note that: "f_n" means f sub n

I tried them out. The 1st and 2nd generalization still holds, but the 3rd one doesn't hold. So, my answer for question a) is "yes" for 1) and 2) but "no" for my 3 rd generalization. My instructor said that I am wrong. And she said that if I look, for example, at # 3 more carefully there is a generalization but I have to "tweak" it a bit but that is because the numbers I start with are different. I don't see what she meant by tweaking it. Anyway, can you help me with this problem in details please?

Attachments
Purchase this Solution
Solution Preview

Hello and thank you for posting your question to Brainmass!
The solution is attached below in two files. the files are identical in content, only differ in format. The first is in MS Word XP Format, while the other is in Adobe pdf format. Therefore you can choose the format that is ...

Purchase this Solution
Free BrainMass Quizzes
Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Probability Quiz

Some questions on probability

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

View More Free Quizzes
Related BrainMass Solutions

  • Fibonacci Sequence Proofs, Pascal's Triangle and Binomial Coefficients

    43809 Fibonacci Sequence Proofs, Pascal's Triangle and Binomial Coefficients Practice problem 1 Fn is the Fibonacci sequence (f0 = 0, f1 = 1, fn+1 = fn + fn-1).

  • Fibonacci sequence

    Fibonacci sequence is expressed.

  • Proofs of the Fibonacci Sequence

    The expert provides proofs of the Fibonacci Sequence.

  • Sequences and recursive definitions

    The first five values are 1, 1, 2, 3, 5, which so far form a subsequence of the Fibonacci sequence. 3. The original problem posed by Fibonacci concerned pairs of rabbits. Two rabbits do not breed until they are two months old.

  • Fibonacci Sequences

    101598 Fibonacci Sequences Fibonacci posed the following problem: Suppose that rabbits live forever and that every month each pair produces a new pair which becomes productive at age 2 months.

  • Fibonacci Sequence and Pascal's Triangle

    60783 Fibonacci Sequence and Pascal's Triangle Describe how the Fibonacci sequence can be found in Pascal's triangle, then illustrate it using Pascal's triangle. Please see the attached file.

  • Induction Problem with Fibonacci Numbers

    25816 Induction Problem with Fibonacci Numbers The Fibonacci recurrence is F(0) = F(1) = 1, and F(n) = F(n-1) + F(n-2), for n > 1 The values F(0), F(1), F(2), ... form the sequence of Fibonacci numbers, in which each number after the first two is

  • Fibonacci Sequences

    A Fibonacci sequence is investigated. The integer function are solved in order to prove by inductions.

  • Fibonacci recurrence

    10324 Mathematical Induction - Fibonacci Recurrence Prove that the Fibonacci sequence can be obtained by the recurrence relationship. See attached file for full problem description. Please see the attached file.

View More Related Solutions