Suppoese(adsbygoogle = window.adsbygoogle || []).push({});

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!!

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Recursive question

Loading...

Similar Threads - Recursive question | Date |
---|---|

I Formula involving polynomial sequences + recursive reps | Nov 8, 2016 |

I Problem with recursive sequence, sum and divisibility | Oct 8, 2016 |

I Recursion theorem: application in proof | Sep 21, 2016 |

I Notation question | Sep 20, 2016 |

Recursive sequence question | Sep 3, 2014 |

**Physics Forums - The Fusion of Science and Community**