Max Before, Min After

Problem

Let {an}\{a_n\} be an infinite sequence of nonnegative integers. Let AnA_n denote the maximum of the first nn terms, and BnB_n the minimum of the terms after the nnth: Bn=min{an+1,an+2,}B_n = \min\{a_{n+1}, a_{n+2}, \dots\}. Set dn=AnBnd_n = A_n - B_n.

1. If {an}\{a_n\} is 2,1,4,3,2,1,4,3,2, 1, 4, 3, 2, 1, 4, 3, \dots, periodic with period 44 (that is, an+4=ana_{n+4} = a_n for all nn), write down d1,d2,d3,d4d_1, d_2, d_3, d_4. 2. Let dd be a nonnegative integer. Prove that dn=dd_n = -d for all nn if and only if {an}\{a_n\} is an arithmetic sequence with common difference dd. 3. Prove that if a1=2a_1 = 2 and dn=1d_n = 1 for all nn, then every term of {an}\{a_n\} equals 11 or 22, and infinitely many terms equal 11.

Answer

Solution

Difficulty7/10
TopicsArithmetic Progression, Logic, sequences, Extremal Principle

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.