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.
Alessandro Iraci
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
- 755 views
- $3.00
Related Questions
- Prove that ${n\choose 2}2^{n-2}=\sum\limits_{k=2}^{n}{n\choose k}{k\choose 2}$ for all $n\geq 2$
- Linearly independent vector subsets.
- Value Of Investment
- Use Rouche’s Theorem to show that all roots of $z ^6 + (1 + i)z + 1 = 0$ lines inside the annulus $ \frac{1}{2} \leq |z| \leq \frac{5}{4}$
- Algorithm for printing @ symbols
- Custom Solutions to Stewart Calculus Problems, 9th Edition
- Generating set for finitely generated submodule of finitely generated module
- Clock Problem