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
- 945 views
- $3.00
Related Questions
- The Span and Uniqueness of Solutions in a Parametric Matrix
- Zariski Topology and Regular Functions on Algebraic Varieties in Affine Space
- ALGEBRA WORD PROBLEM - Trajectory of a NASA rocket
- Algebraic and Graphical Modelling Question
- Foreign Carnival Systems Algebra Problem
- using maclaurin series for tan(x) and equation for length of cable to prove that x=
- Calculus: INFINITE SERIES
- Show that ${(x,\sin(1/x)) : x∈(0,1]} ∪ {(0,y) : y ∈ [-1,1]}$ is closed in $\mathbb{R^2}$ using sequences