Suppoese(adsbygoogle = window.adsbygoogle || []).push({});

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!!

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Recursive question

**Physics Forums | Science Articles, Homework Help, Discussion**