(adsbygoogle = window.adsbygoogle || []).push({}); [SOLVED] I think of it as hard proof by induction

1. The problem statement, all variables and given/known data

given for the sequence [itex]a_1,a_2,a_3,a_4,...[/itex],[itex]a_1=1[/itex] and that

[tex]a_{n+1}=(a_n+\frac{1}{a_n})^{\lambda}[/tex]

where[itex]\lambda>1[/itex].Prove by mathematical induction that,for [itex]n \geq 2[/itex]

[tex]a_n \geq 2^{g(n)}[/tex]

where [itex]g(n)=\lambda^{n-1}[/itex]

Prove also,for [itex]n \geq 2[/itex]

[tex]\frac{a_{n+1}}{a_n}>2^{(\lambda -1)g(n)}[/tex]

2. Relevant equations

3. The attempt at a solution

well what I tried to do was to consider [itex]a_{n+1}-2^{g(n)}[/itex]

which after simplification gives:

[tex] \frac{(a_n^2+1)^{\lambda}}{a_n^{\lambda}}-2^{g(n)}[/itex]

which I then said should be greater than or equal to zero since the fraction on the left is +ve and 2^g(n) is positive since lambda is >1. Is this a good way to start?

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: I think of it as hard proof by induction

**Physics Forums | Science Articles, Homework Help, Discussion**