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
What i've gathered so far is the first 10 numbers in the sequence are 5, the next 10 numbers are equal to (2*previous number) + 3, so 13, and so on for every 10 terms. (correct?)

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:
  1. The questioner was satisfied with and accepted the answer, or
  2. The answer was evaluated as being 100% correct by the judge.
View the answer
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.