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](https://matchmaticians.com/storage/user/100977/thumb/matchmaticians-ee0kis-file-1-avatar-512.jpg)
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
- 685 views
- $3.00
Related Questions
- Calculate the imit of $\sum_{k=0}^{∞} (-1)^k\frac{1}{k!} $
- Calculus: INFINITE SERIES
- MAT-144 Assignment
- Algebra 2 problem about a ticket system
- How to parameterize an equation with 3 variables
- Find $x$, if $\sqrt{x} + 2y^2 = 15$ and $\sqrt{4x} − 4y^2 = 6$.
- Zariski Topology and Regular Functions on Algebraic Varieties in Affine Space
- There are a total of 95 coins, quarters and dimes, and the total is $15.35. How many dimes are there ?