# Math

posted by .

How would I solve this part of the Fibonacci sequence piecewise function?

f(n) = f(n-1)+f(n-2) if n > 1. Thanks

• Math -

n = 4

• Math -

What do you mean solve it ?
f(0) = 1
f(1) = 1
f(2) = 2
f(3) = 1+2 = 3
f(4) = 2+3 = 5
f(5) = 3+5 = 8
f(6) = 5+8 = 13
f(7) = 8+13 = 21

• Math -

and on and on

• Math -

I'm being asked to solve f(4) = f(4-1) + f(4-2). The answers is 3, but I don't know how to get to that answer. Thanks

• Math -

f(4) = f(3)+f(2) = 3 + 2 = 5
as I showed you above.

• Math -

The answer is not 3 but 5

## Similar Questions

1. ### math

There is no function equation for the Fibonacci numbers, you have to use a Recursion formula. F(n) = F(n-1) + F(n-2) for n>2 and F(1)=1, F(2)=1 what is the equation for the fibonacci sequence
2. ### Math

F25= 75,025 and F26= 121,393 where Fn is the nth term in the Fibonacci sequence. Find F27. I do not understand the Fibonacci sequence, could someone help me with my question and explain it to me please.
3. ### Computer Science - MATLAB

One interesting property of a Fibonacci sequence is that the ratio of the values of adjacent members of the sequence approach a number called “the golden ratio” or PHI. Create a program that accepts the first two numbers of a Fibonacci …
4. ### Pre-Calc

Find three examples of the Fibonacci sequence in nature. Write a paragraph for each example. For each example, address the following questions: How does the example relate to the Fibonacci sequence?
5. ### Math

flickr.(dotcom)/photos/77304025@N07/6782789880/ Create a function that closely gives the graph given below. The function may be a piecewise function but it does not necessarily have to be a piecewise function. a. Give a brief narrative …
6. ### Math

Create a function that closely gives the graph given in the link. The function may be a piecewise function but it does not necessarily have to be a piecewise function. a. Give a brief narrative explaining what you did to create your …
7. ### Fibonacci sequence

The Fibonacci sequence a1=1,a2=1,a3=2,a4=3,a5=5,a6=8… is defined recursively using the formulas a1=a2=1 and an+2=an+an+1 for all n≥1. Find the greatest common divisor of a484 and a2013.
8. ### Math (fibonacci

A sequence of numbers is called a Fibonacci-type sequence if each number (after for the first two) is the sum of the two numbers which precede it. For example, 1, 1, 2, 3, 5, 8 ... is a Fibonacci- type sequence. If 1985, x, y, 200 …
9. ### Fibonacci Sequence

The sequence < un > is defined by the recurrence Un+1 = 3Un+1\5Un+3 initial condition of u1 = 1: Need to show un in terms of Fibonacci / Lucas numbers
10. ### Maths

The Fibonacci sequence 1, 1, 2, 3, 5, 8, 13, 21, ... starts with two 1s, and each term afterwards is the sum of its two predecessors. Which one of the ten digits is the last to appear in the units position of a number in the Fibonacci …

More Similar Questions