Counting Two Ways

★ 8/10combinatoricsCountingsequences

Problem

An infinite sequence P ⁣:a1,a2,…P \colon a_1, a_2, \ldots satisfies ai∈N∗a_i \in \mathbb{N}^* and ai⩽ai+1a_i \leqslant a_{i+1}. For k∈N∗k \in \mathbb{N}^*, let Tk(P)T_k(P) be the smallest element of {n∣an⩾k}\{n \mid a_n \geqslant k\}.

1. For the sequence P ⁣:1,3,4,7,…P \colon 1, 3, 4, 7, \ldots, write down T1(P),…,T5(P)T_1(P), \ldots, T_5(P). 2. If Tk(P)=2k−1T_k(P) = 2k - 1 for all kk, find the sum of the first nn terms of PP. 3. Given a20=46a_{20} = 46, find

∑i=120ai+∑j=146Tj(P).\sum_{i=1}^{20}a_i + \sum_{j=1}^{46}T_j(P).

Answer

Solution

Difficulty8/10
Topicscombinatorics, Counting, 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.