Skip to main content
OlympiadHQ

Browse · MathNet

Print

37th Iranian Mathematical Olympiad

Iran counting and probability

Problem

Let be positive integers such that . Find the maximum number of binary sequences of length such that by fixing any arbitrary bits, the achieved sequences do not produce all binary sequences of length . For example if , we can only have one sequence, otherwise they will differ in at least one bit which means that fixing that bit produces all binary sequences of length 1.
Solution
Let the answer be . We will prove by induction on that Case is obvious.

Assume that is the maximum set of the desired sequences and let be the set of all binary sequences of length . Define the sets as follows: Clearly, . Because we can't choose bits from the last bits of the sequences that produce all the binary sequences of length , we have . Now consider the set . If , we can fix bits from the last bits to produce all sequences of length . So because of the definition of , by fixing these bits and the first bit, all sequences of length are produced, which is a contradiction. So we have By induction and using Pascal's identity we get For the equality example, simply choose all binary sequences with at most zeros. This way, by fixing any bits, the sequence with zeros will never be produced and we're done. ■
Final answer
sum_{i=0}^{k-1} binom(n,i)

Techniques

Coloring schemes, extremal argumentsInduction / smoothingRecursion, bijection