1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Recursive question

  1. Dec 3, 2005 #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. Dec 3, 2005 #2

    HallsofIvy

    User Avatar
    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 this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?
Similar Discussions: Recursive question
  1. Recursive Serieses (Replies: 2)

  2. Convergence Recursive (Replies: 6)

  3. Recursive Definition (Replies: 2)

Loading...