Posted by Shadow on .
How would I solve this part of the Fibonacci sequence piecewise function?
f(n) = f(n1)+f(n2) if n > 1. Thanks

Math 
Shadow,
n = 4

Math 
Damon,
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 
Damon,
and on and on
Google Fibonacci Sequence 
Math 
Shadow,
I'm being asked to solve f(4) = f(41) + f(42). The answers is 3, but I don't know how to get to that answer. Thanks

Math 
Damon,
f(4) = f(3)+f(2) = 3 + 2 = 5
as I showed you above. 
Math 
Damon,
The answer is not 3 but 5