MathDB

Problems(1)

well balanced sets, floor function recursive sequence

Source: 7th Gulf Math Olympiad 2019 GMO p4

12/31/2019
Consider the sequence (an)n1(a_n)_{n\ge 1} defined by an=na_n=n for n{1,2,3.4,5,6}n\in \{1,2,3.4,5,6\}, and for n7n \ge 7: an=a1+a2+...+an12a_n={\lfloor}\frac{a_1+a_2+...+a_{n-1}}{2}{\rfloor} where x{\lfloor}x{\rfloor} is the greatest integer less than or equal to xx. For example : 2.4=2,3=3{\lfloor}2.4{\rfloor} = 2, {\lfloor}3{\rfloor} = 3 and π=3{\lfloor}\pi {\rfloor}= 3.
For all integers n2n \ge 2, let Sn={a1,a1,...,an}{rn}S_n = \{a_1,a_1,...,a_n\}- \{r_n\} where rnr_n is the remainder when a1+a2+...+ana_1 + a_2 + ... + a_n is divided by 33. The minus - denotes the ''remove it if it is there'' notation. For example : S4=2,3,4S_4 = {2,3,4} because r4=1r_4= 1 so 11 is removed from {1,2,3,4}\{1,2,3,4\}. However S5={1,2,3,4,5}S_5= \{1,2,3,4,5\} betawe r5=0r_5 = 0 and 00 is not in the set {1,2,3,4,5}\{1,2,3,4,5\}. 1. Determine S7,S8,S9S_7,S_8,S_9 and S10S_{10}. 2. We say that a set SnS_n for n6n\ge 6 is well-balanced if it can be partitioned into three pairwise disjoint subsets with equal sum. For example : S6={1,2,3,4,5,6}={1,6}{2,5}{3,4}S_6 = \{1,2,3,4,5,6\} =\{1,6\}\cup \{2,5\}\cup \{3,4\} and 1+6=2+5=3+41 +6 = 2 + 5 = 3 + 4. Prove that S7,S8,S9S_7,S_8,S_9 and S10S_{10} are well-balanced . 3. Is the set S2019S_{2019} well-balanced? Justify your answer.
combinatoricsalgebrafloor functionfunction