Subcontests
(5)\sum_{i=1}^{k} b_i = k \cdot b_k + \sum_{j=b_{k+1}}^{n} a_j, sequences
Let m,n be positive integers. Consider a sequence of positive integers a1,a2,...,an that satisfies m = a_1 \ge a_2\ge ... \ge a_n \ge 1. Then define, for 1\le i\le m, bi= # \{ j \in \{1, 2, ... , n\}: a_j \ge i\},
so bi is the number of terms aj of the given sequence for which a_j \ge i.
Similarly, we define, for 1\le j \le n, cj= # \{ i \in \{1, 2, ... , m\}: b_i \ge j\} , thus cj is the number of terms bi in the given sequence for which b_i \ge j.
E.g.: If a is the sequence 5,3,3,2,1,1 then b is the sequence 6,4,3,1,1.
(a) Prove that aj=cj for 1 \le j \le n.
(b) Prove that for 1\le k \le m: ∑i=1kbi=k⋅bk+∑j=bk+1naj.