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

### Related Questions

- Algebra 1 Word Problem #3
- Fluid Mechanics - algebra
- Evaluate $\int \ln(\sqrt{x+1}+\sqrt{x}) dx$
- Root of $x^2+1$ in field of positive characteristic
- Sequences undergrad
- Graph Equation from Test
- Let $f(x,y,z)=(x^2\cos (yz), \sin (x^2y)-x, e^{y \sin z})$. Compute the derivative matrix $Df$.
- True or false