Wednesday
July 30, 2014

Homework Help: Math

Posted by Shadow on Saturday, March 2, 2013 at 8:33pm.

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

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

Answer this Question

First Name:
School Subject:
Answer:

Related Questions

Pre-Calc - Find three examples of the Fibonacci sequence in nature. Write a ...
math - There is no function equation for the Fibonacci numbers, you have to use ...
Math - F25= 75,025 and F26= 121,393 where Fn is the nth term in the Fibonacci ...
Fibonacci sequence - The Fibonacci sequence a1=1,a2=1,a3=2,a4=3,a5=5,a6=8 is ...
Math - Create a function that closely gives the graph given in the link. The ...
Math - flickr.(dotcom)/photos/77304025@N07/6782789880/ Create a function that ...
math-calculus - the absolute value function g(x) = |5-x| can be written as a ...
Computer Science - MATLAB - One interesting property of a Fibonacci sequence is ...
Computer Science - MATLAB - I guess it was skipped One interesting property of a...
Calculus - flickr.(dotcom)/photos/77304025@N07/6782789880/ Create a function ...

Search
Members