Browse · MathNet
PrintSELECTION EXAMINATION
Greece counting and probability
Problem
Let . We want to make a partition of the set into three subsets , and mutually disjoint with and such that the sums of their elements , and , respectively, are equal. Examine if that is possible, in the following cases (α) ; (β) ; (γ) . (A. Fellouris)
Solution
(α) If that is possible, for , then for the sum of the elements of we get , that is, is a multiple of . But Hence we cannot apply the wanted partition.
(β) For we have: . We observe that consists of the set and from successive six-folds of the form: We partition the set into three subsets with equal sums of their elements , and . Taking in mind that The wanted partition is feasible by taking the sets:
(γ) For we have: . As in (β) we observe that consists of and from successive six-folds of the form: First we partition into three subsets with equal sums of their elements , and . Since for all we have , the wanted partition is possible by taking
(β) For we have: . We observe that consists of the set and from successive six-folds of the form: We partition the set into three subsets with equal sums of their elements , and . Taking in mind that The wanted partition is feasible by taking the sets:
(γ) For we have: . As in (β) we observe that consists of and from successive six-folds of the form: First we partition into three subsets with equal sums of their elements , and . Since for all we have , the wanted partition is possible by taking
Final answer
For n equal to two thousand fourteen: impossible. For n equal to two thousand fifteen: possible; an explicit partition exists using six number blocks. For n equal to two thousand eighteen: possible; an explicit partition exists using six number blocks.
Techniques
Coloring schemes, extremal argumentsIntegersOther