recursive question


by flying2000
Tags: recursive
flying2000
flying2000 is offline
#1
Dec3-05, 02:59 PM
P: 40
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!!
Phys.Org News Partner Science news on Phys.org
Simplicity is key to co-operative robots
Chemical vapor deposition used to grow atomic layer materials on top of each other
Earliest ancestor of land herbivores discovered
HallsofIvy
HallsofIvy is offline
#2
Dec3-05, 08:05 PM
Math
Emeritus
Sci Advisor
Thanks
PF Gold
P: 38,879
Quote 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.


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
non-recursive formula General Math 3