# 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.

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
- 241 views
- $3.00

### Related Questions

- Root of $x^2+1$ in field of positive characteristic
- Find $\int x \sqrt{1-x}dx$
- Allocation of Price and Volume changes to a change in Rate
- Can enough pizza dough be made to cover the surface of the earth?
- Solving for two unknown angles, from two equations.
- using maclaurin series for tan(x) and equation for length of cable to prove that x=
- Let $R$ be an integral domain and $M$ a finitely generated $R$-module. Show that $rank(M/Tor(M))$=$rank(M)$
- Fields and Galois theory