Reordering a Geometric Sequence

Problem

A finite geometric sequence {an}\{a_n\} has NN terms (N⩾3N \geqslant 3), first term a1>0a_1 > 0, and common ratio q∈(0,1)q \in (0, 1). Its terms are rearranged into a sequence {bn}\{b_n\} such that

aibi⩾ajbjwhenever 1⩽i<j⩽N.a_i b_i \geqslant a_j b_j \qquad \text{whenever } 1 \leqslant i < j \leqslant N.

1. For N=3N = 3, list all valid sequences {bn}\{b_n\}. 2. Does there exist a valid {bn}\{b_n\} with bk−12≠bk−2bkb_{k-1}^2 \neq b_{k-2}b_k for every 3⩽k⩽N3 \leqslant k \leqslant N? Explain. 3. If a valid {bn}\{b_n\} is chosen uniformly at random, find the probability that it is itself geometric.

Answer

Solution

Difficulty9/10
Topicscombinatorics, Geometric Progression, Counting, 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.