I am needing help with this 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 f n+1 = ( f n ) 2 + ( f n-1 ) 3
Follow Math Help Forum on Facebook and Google+
Just follow the directions.
Exactly where is your difficulty? Given: .
Find: . . .
View Tag Cloud