
#1
Dec305, 02:59 PM

P: 40

Suppoese
T(0) = 1 T(n) = T(n1) + root(T(n1)) 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!! 



#2
Dec305, 08:05 PM

Math
Emeritus
Sci Advisor
Thanks
PF Gold
P: 38,904




Register to reply 
Related Discussions  
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  
nonrecursive formula  General Math  3 