Determine the Closed Form of a Recurrance Relation
Using this iteration method, I need to figure out the closed form for this reccurance relation:
T(n) = 2T(n - 10) + 3, for n > 11, T(n) = 5 for n <= 10
The answer is to be expressed exactly, using equality and not a bound or asymptomatic notation.
you can assume the following:
- n = 10l +1 for some positive integer l
- the expression does not need to be completely simplified, you can use either or both n and l in the solution
5 5 5 5 5 5 5 5 5 5 13 13 13 13 13 13 13 13 13 13 29 29 29 29 29 29 29 29 29 29 ...
Help in finding the closed form of this relation? preferably in terms of n , l and maybe both?
Answer
Answers can only be viewed under the following conditions:
- The questioner was satisfied with and accepted the answer, or
- The answer was evaluated as being 100% correct by the judge.

1.7K
The answer is accepted.
Join Matchmaticians Affiliate Marketing
Program to earn up to a 50% commission on every question that your affiliated users ask or answer.
- answered
- 1063 views
- $3.00
Related Questions
- Solve summation problem: $\sum_{k=1}^{n} \tfrac{2k+1}{k^{2}(k+1)^2 } $
- Free Body Diagram: determine the vertical reaction at the left hand beam support.
- Need to figure distance between two points/lines.
- Let $f(x,y,z)=(x^2\cos (yz), \sin (x^2y)-x, e^{y \sin z})$. Compute the derivative matrix $Df$.
- MAT-144 Assignment
- Algebra 2 problem about a ticket system
- Find $\lim _{x \rightarrow 0} x^{x}$
- Existence of a Divergent Subsequence to Infinity in Unbounded Sequences