5
$\begingroup$

I've got following recursive sequence: $$ a_n=\frac13(10-2a_{n-1}) $$ With $ a_0=3$

I have found following expression:

$$ a_n=3+ \sum_{n=0}^n{2^{n-1}\cdot\frac{5}{3^n}\cdot (-1)^n} $$

Is there maybe a better form? Thank you for your help! I would appreciate hints

$\endgroup$
3
  • $\begingroup$ Assuming your summation formula is correct, rewrite $2^{n-1}$ as $\frac{2^n}{2}$ and combine all the powers. You should get a familiar looking expression. $\endgroup$
    – dgeyfman
    Commented Aug 14, 2023 at 15:30
  • 3
    $\begingroup$ Your sum uses $n$ as both the index and the upper limit. You should fix that so they use different variables. $\endgroup$ Commented Aug 14, 2023 at 15:37
  • 3
    $\begingroup$ Also, hint: let $a_n = b_n +k$. Can you find a value of $k$ such that the recursion for $b_n$ is particularly simple? $\endgroup$ Commented Aug 14, 2023 at 15:44

1 Answer 1

4
$\begingroup$

Let $\,b_n=a_n-2\;\;$ for any $\,n\in\Bbb N\cup\{0\}\,.\;\;\left(\implies\color{brown}{b_0=1}\,\right)$

From $\,a_n=\dfrac{10-2a_{n-1}}3\;\;\forall n\in\Bbb N\;,\;$ we get that

$b_n+2=\dfrac{10-2\left(b_{n-1}+2\right)}3\;\;\;\forall n\in\Bbb N\;,$

$b_n=\dfrac{6-2b_{n-1}}3-2\;\;\;\forall n\in\Bbb N\;,$

$b_n=-\dfrac23b_{n-1}\;\;\;\forall n\in\Bbb N\;.$

Consequently ,

$b_n=-\dfrac23b_{n-1}=\left(-\dfrac23\right)^{\!2}\!b_{n-2}=\ldots=\left(-\dfrac23\right)^{\!n}\!b_0=\left(-\dfrac23\right)^{\!n}\;\;,$

$a_n=2+b_n=2+\left(-\dfrac23\right)^{\!n}\;\;$ for any $\,n\in\Bbb N\cup\{0\}\,.$

$\endgroup$
2
  • $\begingroup$ Thank you for your help! $\endgroup$
    – Arthr
    Commented Aug 15, 2023 at 6:59
  • $\begingroup$ @Arthr, you are welcome ! $\endgroup$
    – Angelo
    Commented Aug 15, 2023 at 7:44

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .