How Many Recursions Needed to Reach k?

  • Thread starter flying2000
  • Start date
Can you provide more information please?In summary, the conversation discusses a recursive function T(n) and its growth to a specific number k. The function follows the formula T(n) = T(n-1) + root(T(n-1)) and the question is how many recursions are needed for T(n) to reach k. The conversation also mentions the conditions that root(k) < m < c root(k), where c is a constant and m represents the number of times T(n) needs to go to k. Further information is needed to answer the question.
  • #1
flying2000
40
0
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!
 
Physics news on Phys.org
  • #2
flying2000 said:
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.
 

1. How do you determine the number of recursions needed to reach a specific value?

The number of recursions needed to reach a specific value, also known as "k", is determined by the problem or function at hand. It depends on the specific conditions and rules set in the problem, and cannot be generalized.

2. What is the significance of knowing the number of recursions needed to reach a certain value?

Knowing the number of recursions needed to reach a certain value can help in understanding the complexity and efficiency of a problem or function. It can also aid in optimizing algorithms and finding more efficient solutions.

3. Can the number of recursions needed to reach a specific value be calculated beforehand?

In most cases, the number of recursions needed to reach a specific value cannot be calculated beforehand as it depends on the input and conditions of the problem. However, in some cases, it may be possible to calculate it using mathematical analysis.

4. Is there a maximum number of recursions needed to reach a certain value?

The maximum number of recursions needed to reach a certain value is determined by the limitations of the hardware and programming language being used. In theory, there is no limit to the number of recursions, but in practice, there is a limit due to memory and processing constraints.

5. How can we optimize the number of recursions needed to reach a specific value?

The number of recursions needed to reach a specific value can be optimized by using more efficient algorithms and approaches, such as dynamic programming or memoization. It is also important to analyze the problem and find any unnecessary or redundant recursions that can be eliminated.

Similar threads

  • Calculus and Beyond Homework Help
Replies
4
Views
125
  • Calculus and Beyond Homework Help
Replies
2
Views
465
  • Calculus and Beyond Homework Help
Replies
8
Views
116
  • Calculus and Beyond Homework Help
Replies
3
Views
444
  • Calculus and Beyond Homework Help
Replies
1
Views
556
  • Calculus and Beyond Homework Help
Replies
2
Views
151
  • Calculus and Beyond Homework Help
Replies
6
Views
420
  • Calculus and Beyond Homework Help
Replies
2
Views
857
  • Calculus and Beyond Homework Help
Replies
24
Views
672
  • Calculus and Beyond Homework Help
Replies
1
Views
492
Back
Top