recursive question

flying2000

Suppoese

T(0) = 1
T(n) = T(n-1) + root(T(n-1))

how many recursion does T(n) need to grow to the number k?
can I get this? root(k) < m < c root(k)
c is constant and m is the times we need for T(n) goes to k.

Any help appreciated!!

HallsofIvy

Quote by flying2000

Suppoese
T(0) = 1
T(n) = T(n-1) + root(T(n-1))
how many recursion does T(n) need to grow to the number k?
can I get this? root(k) < m < c root(k)
c is constant and m is the times we need for T(n) goes to k.
Any help appreciated!!

Since you haven't said what what "k" is there is no way to answer this.

Similar discussions for: recursive question
Thread	Forum	Replies
Recursive Relations.	Set Theory, Logic, Probability, Statistics	0
recursive definition	Calculus & Beyond Homework	3
recursive algorithm	Calculus & Beyond Homework	6
recursive question	General Math	1
non-recursive formula	General Math	3

flying2000	recursive question Suppoese T(0) = 1 T(n) = T(n-1) + root(T(n-1)) how many recursion does T(n) need to grow to the number k? can I get this? root(k) < m < c root(k) c is constant and m is the times we need for T(n) goes to k. Any help appreciated!!