How Many Recursions Needed to Reach k?

[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]

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.