Results 1 to 2 of 2

Math Help - Problem with understanding recursion

  1. #1
    Junior Member
    Joined
    May 2009
    Posts
    71

    Problem with understanding recursion

    Find f(1); f(2); f(3); f(4) and f(5) if f(n) is defined recursively by f(0) = 3 and for n = 0; 1; 2 for:

    f(n+1)= f(n)^2 - 2f(n)-2
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Flow Master
    mr fantastic's Avatar
    Joined
    Dec 2007
    From
    Zeitgeist
    Posts
    16,948
    Thanks
    5
    Quote Originally Posted by orendacl View Post
    Find f(1); f(2); f(3); f(4) and f(5) if f(n) is defined recursively by f(0) = 3 and for n = 0; 1; 2 for:

    f(n+1)= f(n)^2 - 2f(n)-2
    In order to understand recursion, you must understand recursion.

    Nevertheless, note that:

    f(0+1) = f(1) = f(0)^2 - 2f(0) - 2 = 3^2 - 2 (3) - 2 = 1

    f(1+1) = f(2) = f(1)^2 - 2f(1) - 2 = 1^2 - 2 (1) - 2 = -3

    etc.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 4
    Last Post: June 17th 2011, 11:58 AM
  2. problem in recursion
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: November 3rd 2009, 09:51 AM
  3. Need help understanding this problem..
    Posted in the Trigonometry Forum
    Replies: 4
    Last Post: April 20th 2009, 06:29 PM
  4. Recursion problem
    Posted in the Discrete Math Forum
    Replies: 5
    Last Post: October 21st 2008, 06:11 AM
  5. Pattern/Recursion for paint can problem
    Posted in the Algebra Forum
    Replies: 1
    Last Post: September 8th 2008, 01:45 AM

Search Tags


/mathhelpforum @mathhelpforum