166k views
1 vote

a_(1) = 1 \\ a_(n + 1) = \sqrt[]{1 + a_(n)}

Prove by mathematical induction that the sequence is increasing​

2 Answers

1 vote

Trivially, we have


a_2 = √(1+a_1) = \sqrt2 > 1 = a_1

so the base case is satisfied.

Assume
a_k > a_(k-1), so


a_k = \sqrt{1+a_(k-1)} > a_(k-1)

We want to use this to show
a_(k+1) > a_k.
\sqrt x is an increasing function, so from our assumption it follows that


a_(k+1) = √(1 + a_k) > \sqrt{1 + a_(k-1)} = a_k

QED

User Stefan Kamphausen
by
8.8k points
0 votes

Answer + Step-by-step explanation:


a_(1)=1


a_(2)=\sqrt{1+a_(1)} =√(1+1) = √(2)

then


a_(2) \geq a_(1)


\text{suppose}\ a_(n+1) \geq a_(n)\ \text{and prove that} \ a_(n+2)\geq a_(n+1)


a_(n+2)=\sqrt{1+a_(n+1)} \geq \sqrt{1+a_(n)} = a_(n+1)

Then


a_(n+2) \geq a_(n+1)

Then ,according to the principal of mathematical induction:

the sequence (an) is increasing​.

User Andrew Whitaker
by
7.5k points

No related questions found

Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.4m questions

12.2m answers

Categories