# 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
- 670 views
- $3.00

### Related Questions

- Is $\sum_{i=1}^{\infty}\arctan (\frac{n+1}{n^2+5})$ convergent or divergent?
- Algebra Word Problem #1
- Double absolute value equations.
- Algorithm for printing @ symbols
- ALGEBRA WORD PROBLEM - Trajectory of a NASA rocket
- Prove that ${n\choose 2}2^{n-2}=\sum\limits_{k=2}^{n}{n\choose k}{k\choose 2}$ for all $n\geq 2$
- There are a total of 95 coins, quarters and dimes, and the total is $15.35. How many dimes are there ?
- Solving for two unknown angles, from two equations.