A Decreasing Recursion

Problem

A sequence has a1=12a_1 = \dfrac{1}{2} and

an+1=nan+an2n+1,a_{n+1} = \frac{na_n + a_n^2}{n + 1},

and bn=nanb_n = na_n.

1. Prove that {an}\{a_n\} is decreasing. 2. Prove that bn⩽32b_n \leqslant \dfrac{3}{2} for all n∈N∗n \in \mathbb{N}^*.

Answer

Solution

Difficulty7/10
TopicsRecursion, sequences, Induction, Telescoping, inequality

Whiteboard

Your sketch is saved only in this browser. To share it, export your drawing as an image (whiteboard menu → Export as → PNG), then upload that image in the comments below.

Discussion

Ask questions, share alternate solutions, and use LaTeX freely.

0 comments
Log in to join the discussion.

No comments yet.