Skip to main content
OlympiadHQ

Browse · MathNet

Print

Brazilian Math Olympiad

Brazil counting and probability

Problem

33 friends are collecting stickers for a 2011-sticker album. A distribution of stickers among the 33 friends is incomplete when there is a sticker that no friend has. Determine the least with the following property: every distribution of stickers among the 33 friends such that, for any two friends, there are at least stickers both don't have, is incomplete.
Solution
Since , consider the example where for , and . Notice that for and for and . Thus , and therefore .

Now we prove that the minimum value of is, in fact, . First, notice that if then . Suppose that . Then one of the sets, say , has more than elements, that is, . But . But , contradiction. Hence . So, , and there exists sixteen stickers that none of the 33 friends have.

---

Alternative solution.

We will prove that in another way. The example for is the same from the previous solution. Again, number the stickers from 1 to 2011 and let be the set of the stickers that the friend does not have, . Consider all pairs such that . If for every sticker there is a friend that has it, that is, then for each there exists such that . So each belongs to at most 32 sets and, hence, there exist at most pairs . On the other hand, since there exists at least pairs . Therefore, if then
Final answer
1890

Techniques

Counting two waysPigeonhole principleColoring schemes, extremal arguments