(adsbygoogle = window.adsbygoogle || []).push({}); Guys,[tex] a_{n+1}=3-\frac{1}{a_n} \qquad a_1=1 [/tex]

I'm trying to prove by induction that the sequence given byis increasing and[tex] a_n < 3 \qquad \forall n .[/tex]

Is the following correct? Thank you.

Task #1.

[tex] n = 1 \Longrightarrow a_2=2>a_1 [/tex] is true.

We assume [tex] n = k [/tex] is true. Then,

[tex] 3-\frac{1}{a_{k+1}} > 3-\frac{1}{a_k} [/tex]

[tex] a_{k+2} > a_{k+1} [/tex] is true for [tex] n=k+1 [/tex].

This shows, by mathematical induction, that

[tex] a_{n+1} > a_{n} \qquad \forall n . [/tex]

Task #2

We already know that

[tex] a_1 < 3 [/tex] is true.

We assume [tex] n=k [/tex] is true. Then,

[tex] a_k < 3 [/tex]

[tex] \frac{1}{a_k} > \frac{1}{3} [/tex]

[tex] -\frac{1}{a_k} < -\frac{1}{3} [/tex]

[tex] 3-\frac{1}{a_k} < 3-\frac{1}{3} [/tex]

[tex] a_{k+1} < \frac{8}{3} < 3 [/tex]

[tex] a_{k+1} < 3 [/tex] is true for [tex] n = k+1 [/tex]. Thus,

[tex] a_{n} < 3 \qquad \forall n . [/tex]

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

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!

# Recursive sequence problem: proofs by mathematical induction

Can you offer guidance or do you also need help?

Draft saved
Draft deleted

Loading...

Similar Threads for Recursive sequence problem | Date |
---|---|

Mathematica: Recursive expression | Jun 13, 2013 |

How do I avoid the recursion limit in Mathematica? | Apr 4, 2013 |

Mathematica 8.0 - solve two recursive relations | Nov 12, 2012 |

Matlab recursion (error in book?) | Nov 11, 2012 |

**Physics Forums - The Fusion of Science and Community**