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
- 1607 views
- $3.00
Related Questions
- Is $\sum_{i=1}^{\infty}\arctan (\frac{n+1}{n^2+5})$ convergent or divergent?
- Five times the larger of two consecutive odd integers is equal to one more than eight times the smaller. Find the integers.
- Solve this problem using branch and bound algorithm.
- [Precalculus] Sequences and series questions.
- Null sequences three part question
- Populace Model
- Algebra 2 help Please find attachment
- Induced and restricted representation