Purchase Solution

Fibonacci Sequences

Not what you're looking for?

Ask Custom Question

Let (f_k) be the Fibonacci sequence, show that:

a) For every integer n>= 0, we have f_4(n+1) = 3f_4n+1 + 2f_4n

b) Use a) in order to prove by induction that ∀n є N, 3 | f_4n

Purchase this Solution
Solution Summary

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

Solution Preview

Hi, here is the solution...

Let (f_k) be the fibonacci sequece.

the Fibonacci numbers form a sequence defined by

f_k = { 0, if k=0
1, if k=1
f_(k-1)+f_(k-2) if k>1

f_k= 0,1,1,2,3,5,8,13,21.........

Here, f_0 =0, f_1=1, f_2=1

a) For every integer ...

Purchase this Solution
Free BrainMass Quizzes
Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Probability Quiz

Some questions on probability

Graphs and Functions

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

Solving quadratic inequalities

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

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.

View More Free Quizzes
Related BrainMass Solutions

  • Fibonacci Sequences

    Fibonacci Sequences are investigated.

  • Fibonacci Sequences, Convergence and Limits

    52776 Fibonacci Sequences, Convergence and Limits (a) find the first 12 terms of the Fibonacci sequence Fn defined by the Fibonacci relationship Fn=Fn-1+Fn-2 where F1=1, F2=1.

  • 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 Numbers and Golden Rule

    The recurrence formula of Fibonacci sequences can be written as: f_n+1 - f_n - f_n-1 = 0 Searching for solutions of form f_n = C*r^n

  • Sequences and recursive definitions

    For Exercises #1-3, decide whether the sequences described are subsequences of the Fibonacci sequence, that is, their members are some or all of the members, in the right order, of the Fibonacci sequence. 1.

  • Fibonacci Sequence Problem

    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?

  • Proofs of the Fibonacci Sequence

    Part 1 Recall that the Fibonacci sequences is: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, . . .

  • Sequences

    This provides several examples of working with sequences, as well as a few examples of solving equations

  • Hogatt's Theorem Proof

    Therefore: The integer can be expressed as a sum of Fibonacci numbers (see assumption: m is smaller than k). So But if m is a sum of Fibonacci numbers and Fn is a Fibonacci number, then k is sum of Fibonacci numbers as well. Q.E.D.

View More Related Solutions