A Product Recursion Meets an AP

Problem

Let {an}\{a_n\} be an arithmetic sequence with nonzero common difference and a5=6a_5 = 6, and let {bn}\{b_n\} satisfy b1=3b_1 = 3 and

bn+1=b1b2bn+1.b_{n+1} = b_1b_2\cdots b_n + 1.

1. For n2n \geqslant 2, prove that bn+11bn1=bn\dfrac{b_{n+1} - 1}{b_n - 1} = b_n. 2. Suppose a3>1a_3 > 1 and a3Na_3 \in \mathbb{N}^*, and there exist geometric sequences a3,a5,ak1,ak2,,akna_3, a_5, a_{k_1}, a_{k_2}, \ldots, a_{k_n} of arbitrarily many terms drawn from {an}\{a_n\}. Find a3a_3. 3. Under the conditions of part 2, with a3a_3 at its minimum value, prove that

1b1+1b2++1bn>4(1ak11+1ak21++1akn1).\frac{1}{b_1} + \frac{1}{b_2} + \cdots + \frac{1}{b_n} > 4\left(\frac{1}{a_{k_1} - 1} + \frac{1}{a_{k_2} - 1} + \cdots + \frac{1}{a_{k_n} - 1}\right).

Answer

Solution

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