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
- 1771 views
- $3.00
Related Questions
- Would the Equation $s⋅G=P1+e⋅P2$ Reveal Hidden Points $P1$ and $P2$ on an Elliptic Curve?
- Find rational numbers A & B given the attached formula
- Algebra 1 Word Problem #3
- Why does $ \sum\limits_{n=1}^{\infty } 2^{2n} \times \frac{(n!)^2}{n(2n+1)(2n)!} =2 $ ?
- How does the change in $b$ in the quadratic formula $ax^2+bx+c$ move the parabola in an inverted version of the quadratic function?
- Infinite Geometric Series
- Representation theory quick question
- Donald is 6 years older than Sophia. In 4 years the sum of their ages will be 74. How old is Donald now?