Subcontests
(5)Picking Representatives of Sets
Let S={1,2,…,2014}. For each non-empty subset T⊆S, one of its members is chosen as its representative. Find the number of ways to assign representatives to all non-empty subsets of S so that if a subset D⊆S is a disjoint union of non-empty subsets A,B,C⊆S, then the representative of D is also the representative of one of A, B, C.Warut Suksompong, Thailand Increasing Sums of Digits
For a positive integer m denote by S(m) and P(m) the sum and product, respectively, of the digits of m. Show that for each positive integer n, there exist positive integers a1,a2,…,an satisfying the following conditions: S(a_1) < S(a_2) < \cdots < S(a_n) \text{ and } S(a_i) = P(a_{i+1}) (i=1,2,\ldots,n). (We let an+1=a1.)Problem Committee of the Japan Mathematical Olympiad Foundation