# Math Help - Help with recursive method

1. ## 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)

2. Originally Posted by orendacl
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

3. Originally Posted by orendacl
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