How can I prove that $a_n \le 2$ with induction for given progression?

61 Views Asked by At

When given progression is: $$ {a_n}_{+1} = \frac{(a_n)^2}{4} + 1$$ $\forall n \in \mathbb{N}$ and $a_1 = 0$

3

There are 3 best solutions below

7
On BEST ANSWER

hint

For the step $n+1$ (assuming that $a_n \le 2$)

$$a_{n+1}=\frac{(a_n)^2}{4}+1\le \frac{(2)^2}{4}+1=2$$

Now you just have to show that is valid for $n=1$.

2
On

Is $a_1 \le 2$? If $a_n \le 2$, is it true that $a_{n+1} \le 2$? What's $2^2$? What's $1+1$?

6
On

$$\begin{array} {rl} \text{Assumption} & a_n \in [0 ~ .. 2] \\ \text{Therefore} & a_n{}^2 \in [? ~ .. ?] \\ \text{Therefore} & \frac 14 a_n{}^2 + 1 \in [? ~ .. ?] \\ \text{Therefore} & a_{n + 1} \in [? ~ .. ?] \\ \end{array}$$

Figure out the $?$.