Explore BrainMass
Share

Explore BrainMass

    Recursion

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    4. Find f(2), f(3), f(4), and f(5) if f is defined recursively by f(0) = f(1) = 1 and for n = 1,2, ...
    a) f(n + 1) = f(n) - f(n - 1).
    b) f(n + 1) = f(n)f(n - I).
    c) f(n + 1) = f(n)^2 + f(n - 1)^3.
    d) f(n + 1) = f(n)/f(n - 1).

    © BrainMass Inc. brainmass.com October 10, 2019, 1:53 am ad1c9bdddf
    https://brainmass.com/math/discrete-structures/recursion-functions-353218

    Solution Summary

    Recursion is exemplified.

    $2.19