Post a New Question

Math

posted by on .

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
    Google Fibonacci Sequence

  • 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

Answer This Question

First Name:
School Subject:
Answer:

Related Questions

More Related Questions

Post a New Question