A Supremum of a Trig Recurrence

Problem

A sequence {an}\{a_n\} satisfies a1=1a_1=1, a2=6a_2=6, and for n3n\geqslant 3,

an={an1+sinan1,an1an2,an1+cosan1,an1<an2.a_n=\begin{cases}a_{n-1}+\sin a_{n-1},&a_{n-1}\geqslant a_{n-2},\\ a_{n-1}+\cos a_{n-1},&a_{n-1}<a_{n-2}.\end{cases}

Determine, with proof, whether {an}\{a_n\} has a supremum, and if so, find it.

Answer

Solution

Difficulty8/10
Topicstrigonometry, Limits, Monotonicity, Recursion, sequences

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.