\(a_1, a_2, a_3, \dots\) is an increasing sequence of natural numbers. It is known that \(a_{a_k} = 3k\) for any \(k\). Find a) \(a_{100}\); b) \(a_{2022}\).
A sequence consists of 19 ones and 49 zeros, arranged in a random order. We call the maximal subsequence of the same symbols a “group”. For example, in the sequence 110001001111 there are five groups: two ones, then three zeros, then one one, then two zeros and finally four ones. Find the mathematical expectation of the length of the first group.
Two players are playing a game. The first player is thinking of a finite sequence of positive integers \(a_1\), \(a_2\), ..., \(a_n\). The second player can try to find the first player’s sequence by naming their own sequence \(b_1\), \(b_2\), ..., \(b_n\). After this, the first player will give the result \(a_1b_1 + a_2b_2 + ...+a_nb_n\). Then the second player can say another sequence \(c_1\), \(c_2\), ..., \(c_n\) to get another answer \(a_1c_1+ a_2c_2 + ... +a_nc_n\) from the first player. Find the smallest number of sequences the second player has to name to find out the sequence \(a_1\), \(a_2\), ..., \(a_n\).