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 be viewed only if
- The questioner was satisfied and accepted the answer, or
- The answer was disputed, but the judge evaluated it as 100% correct.
Alessandro Iraci
1.6K
The answer is accepted.
Join Matchmaticians Affiliate Marketing
Program to earn up to 50% commission on every question your affiliated users ask or answer.
- answered
- 576 views
- $3.00
Related Questions
- Find $n$ such that $\lim _{x \rightarrow \infty} \frac{1}{x} \ln (\frac{e^{x}+e^{2x}+\dots e^{nx}}{n})=9$
- Prove that $tan x +cot x=sec x csc x$
- Population Equations
- How do you go about solving this question?
- Internal Rate of Return vs Discount Rate
- Center of algebra of functions
- using maclaurin series for tan(x) and equation for length of cable to prove that x=
- Stuck on this and need the answer for this problem at 6. Thanks