Consider the sequence (an)n≥1 defined by an=n for n∈{1,2,3.4,5,6}, and for n≥7: an=⌊2a1+a2+...+an−1⌋
where ⌊x⌋ is the greatest integer less than or equal to x. For example : ⌊2.4⌋=2,⌊3⌋=3 and ⌊π⌋=3.For all integers n≥2, let Sn={a1,a1,...,an}−{rn} where rn is the remainder when a1+a2+...+an is divided by 3. The minus − denotes the ''remove it if it is there'' notation. For example : S4=2,3,4 because r4=1 so 1 is removed from {1,2,3,4}. However S5={1,2,3,4,5} betawe r5=0 and 0 is not in the set {1,2,3,4,5}.
1. Determine S7,S8,S9 and S10.
2. We say that a set Sn for n≥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} and 1+6=2+5=3+4. Prove that S7,S8,S9 and S10 are well-balanced .
3. Is the set S2019 well-balanced? Justify your answer. combinatoricsalgebrafloor functionfunction