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

### Related Questions

- Find $\int x \sqrt{1-x}dx$
- Integral of trig functions
- Attempting to make a formula/algorithm based on weighted averages to find how much equipment we need to maintain.
- Minimizing the cost of building a box
- How do you do absolute value equations with inequalities?
- Compounding interest of principal P, where a compounding withdrawal amount W get withdrawn from P before each compounding of P.
- Prove that ${n\choose 2}2^{n-2}=\sum\limits_{k=2}^{n}{n\choose k}{k\choose 2}$ for all $n\geq 2$
- Get area of rotated polygon knowing all coordinates and angle.