3

Find an explicit formula for the recursive sequence $a(n+1)=3a(n)-8$ where $a(1)=4$.

Is the formula an=4 and how to prove it by induction I dont really know how to prove it using induction if this were the right answer

Masacroso
  • 29,172
  • 6
  • 30
  • 88

2 Answers2

6

Hint (telescoping instead of induction): the recursion formula can be written as:

$$a_{n+1}-4=3(a_{n}-4)=3^2(a_{n-1}-4)=\cdots=3^{n}(a_1-4)$$

dxiv
  • 74,924
  • 6
  • 63
  • 119
  • 3
    Hmmmm. That part that reads "$\cdots$". Isn't that shorthand for "induction"? – GEdgar Jun 01 '17 at 22:12
  • 1
    @GEdgar Telescoping is common enough that it has its own name, and is generally accepted without the formal base+step proof detail. Related: [When do we use hidden induction?](https://math.stackexchange.com/questions/2042428/when-do-we-use-hidden-induction) – dxiv Jun 01 '17 at 22:16
  • @GEdgar It's how I write my induction all the time :P (though I try to make it obvious) – Simply Beautiful Art Jun 01 '17 at 23:41
3

Let $P(n)$ be the statement $a(n) = 4$. Given $a(1) = 4$ and $P(1)$ is true.

Assume $a(k) = 4$ for some $k\in\mathbb N$. Then $$a(k+1) = 3a(k) - 8 = 12 - 8 = 4$$

So $P(k+1)$ is true.

peterwhy
  • 20,096
  • 4
  • 19
  • 48