Results 1 to 3 of 3

Math Help - Help with recursive method

  1. #1
    Junior Member
    Joined
    May 2009
    Posts
    71

    Help with recursive method

    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)= 3^(f(n)/3)
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Banned
    Joined
    May 2009
    Posts
    471
    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)= 3^(f(n)/3)
    Let n=0, then f(0+1)=f(1)=3^{f(0)/3}=3^{3/3}=3^1=3

    Continue by letting n=1,2,3,4
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Member
    Joined
    Jun 2009
    Posts
    220
    Thanks
    1
    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)= 3^(f(n)/3)

    f(1) = 3^{\frac{f(0)}{3}} = 3^{\frac{3}{3}} = ??

    f(2) = 3^{\frac{f(1)}{3}} = ??

    etc.

    EDIT: too slow again
    Last edited by pomp; July 19th 2009 at 10:37 AM.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Bisection method recursive
    Posted in the Math Software Forum
    Replies: 8
    Last Post: May 27th 2010, 07:56 PM
  2. Primitive Recursive vs Recursive Functions
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: January 29th 2009, 07:32 AM
  3. Replies: 2
    Last Post: August 17th 2008, 12:02 PM
  4. Replies: 3
    Last Post: November 3rd 2007, 01:43 PM
  5. Replies: 0
    Last Post: January 4th 2007, 01:29 PM

Search Tags


/mathhelpforum @mathhelpforum