Browse · MathNet
PrintSecond Round, March 2019
Netherlands 2019 counting and probability
Problem
We consider sequences consisting of integers. For given , we can partition the numbers of the sequence into groups as follows: goes in the first group, in the second group, and so on until which goes in the -th group. Then goes in the first group again, in the second group, and so on. The sequence is called -composite if this partition has the property that the sums of the numbers in the groups are equal.
The sequence , for instance, is 4-composite as However, this sequence is not 3-composite, as the sums , , and do not give equal outcomes.
a. Give a sequence of 6 distinct integers that is both 2-composite and 3-composite.
b. Give a sequence of 7 distinct integers that is 2-composite, 3-composite, and 4-composite.
c. Find the largest for which there exists a sequence of 99 distinct integers that is -composite. (Give an example of such a sequence and prove that such a sequence does not exist for greater values of .)
The sequence , for instance, is 4-composite as However, this sequence is not 3-composite, as the sums , , and do not give equal outcomes.
a. Give a sequence of 6 distinct integers that is both 2-composite and 3-composite.
b. Give a sequence of 7 distinct integers that is 2-composite, 3-composite, and 4-composite.
c. Find the largest for which there exists a sequence of 99 distinct integers that is -composite. (Give an example of such a sequence and prove that such a sequence does not exist for greater values of .)
Solution
a. An example of a correct sequence is . This sequence consists of six distinct numbers and is 2-composite since . It is also 3-composite since .
b. A possible solution is . This sequence consists of seven distinct integers and is 2-composite since . It is 3-composite since . It is also 4-composite since .
c. The largest for which a -composite sequence of 99 distinct integers exists, is . An example of such a sequence is The 99 integers in the sequence are indeed distinct and we see that , so this sequence is 50-composite.
Now suppose that and that we have a -composite sequence . Consider the group that contains the number . Since and , this group cannot contain any other number beside . Next, consider the group containing the number . Since and , this group cannot contain any other number beside . Hence, the numbers and each form a group by themselves and must therefore have the same value. But this is not allowed since the 99 numbers in the sequence had to be distinct.
b. A possible solution is . This sequence consists of seven distinct integers and is 2-composite since . It is 3-composite since . It is also 4-composite since .
c. The largest for which a -composite sequence of 99 distinct integers exists, is . An example of such a sequence is The 99 integers in the sequence are indeed distinct and we see that , so this sequence is 50-composite.
Now suppose that and that we have a -composite sequence . Consider the group that contains the number . Since and , this group cannot contain any other number beside . Next, consider the group containing the number . Since and , this group cannot contain any other number beside . Hence, the numbers and each form a group by themselves and must therefore have the same value. But this is not allowed since the 99 numbers in the sequence had to be distinct.
Final answer
a) 5, 7, 6, 3, 1, 2 b) 8, 17, 26, 27, 19, 10, 1 c) Largest k is 50; example sequence: 1, 2, ..., 48, 49, 100, 99, 98, ..., 52, 51
Techniques
Coloring schemes, extremal argumentsSums and productsIntegers