Recursive question

  1. 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!!
     
  2. jcsd
  3. HallsofIvy

    HallsofIvy 40,201
    Staff Emeritus
    Science Advisor

    Since you haven't said what what "k" is there is no way to answer this.
     
Know someone interested in this topic? Share a link to this question via email, Google+, Twitter, or Facebook