A Staircase Sequence

Problem

Let {an}\{a_n\} be a geometric sequence with positive common ratio, partial sums SnS_n, a1=1a_1 = 1, and S2=a31S_2 = a_3 - 1.

1. Find SnS_n. 2. Define a sequence {bn}\{b_n\} by

bn={k,n=ak,bn1+2k,ak<n<ak+1,b_n = \begin{cases} k, & n = a_k, \\ b_{n-1} + 2k, & a_k < n < a_{k+1}, \end{cases}

where kk ranges over positive integers greater than 11.

  1. When n=ak+1n = a_{k+1}, prove that bn1akbnb_{n-1} \geqslant a_k \cdot b_n.
  2. Find i=1Snbi\displaystyle\sum_{i=1}^{S_n} b_i.

Answer

Solution

Difficulty8/10
TopicsArithmetic Progression, Geometric Progression, 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.