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
- 1817 views
- $3.00
Related Questions
- Does $\lim_{n \rightarrow \infty} \frac{2^{n^2}}{n!}$ exist?
- Representation theory question
- Let $R$ be an integral domain and $M$ a finitely generated $R$-module. Show that $rank(M/Tor(M))$=$rank(M)$
- Calculate the imit of $\sum_{k=0}^{∞} (-1)^k\frac{1}{k!} $
- Algebra Word Problem #1
- Sinusodial graph help (electrical)
- Solve $abc=2(a-2)(b-2)(c-2)$ where $a,b $ and $c$ are integers
- Reverse this equation/function (2d to isometric)