Let $T_1 = 1$, $T_2 = 2$ and $T_n = (T_{n−1} + T_{n−2})/2$ when $n ≥ 3$. Find a closed form expression for $T_n$ that applies when $n ≥ 3.$

Question

Having trouble finding a closed form expression that applies for all $n$. I tried looking at $T_3, T_4, T_5,$ and $T_6$ to see some pattern but found none. Is there a kind of trick for these problems?

There a re several answers here that would help. – Arnaud D. May 07 '20 at 09:13 — Arnaud D., May 07 '20 at 09:13

score 0 · Accepted Answer · answered May 05 '20 at 21:06

0

One way to solve such a recurrence relation is to find roots of the characteristic equation,

which in this case is $x^2=(x+1)/2$, so the roots are $1$ and $-\frac12$,

so $T_n=A+B\left(-\frac12\right)^n$. Use the fact that $T_1=1$ and $T_2=2$ to solve for $A$ and $B$.

answered May 05 '20 at 21:06

J. W. Tanner

60,406

Can I use T1 = 1 and T2 = 2 even though the equation I'm trying to find only applies to n ≥ 3? – My Boi May 05 '20 at 21:26
Yes, it will apply to the initial conditions as well – J. W. Tanner May 05 '20 at 21:28

Let $T_1 = 1$, $T_2 = 2$ and $T_n = (T_{n−1} + T_{n−2})/2$ when $n ≥ 3$. Find a closed form expression for $T_n$ that applies when $n ≥ 3.$

1 Answers1