1. Limited time only! Sign up for a free 30min personal 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!!
     
    Last edited: Dec 3, 2005
  2. jcsd
  3. Dec 3, 2005 #2

    uart

    User Avatar
    Science Advisor

    You can bound it with a continous function.

    Try solving dy/dx = sqrt(y) with y(0)=1, you can show that this function is bigger than T but gives a pretty good bound. Solving the above gives c=2 as the constant you're looking for.

    BTW: Maybe I'm just dumb but I had to read you post about three times before I figured out that by "root" you meant square root or sqrt or [tex]\sqrt(.)[/tex].
     
    Last edited: Dec 3, 2005
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Recursive question
  1. Bernoulli Recursions (Replies: 2)

  2. Integral: recursion (Replies: 12)

  3. Simple recursion (Replies: 3)

Loading...