Skip to main content
OlympiadHQ

Browse · MathNet

Print

XXIV OBM

Brazil counting and probability

Problem

Show that we cannot form more than binary sequences of length so that any two differ in at least positions.
Solution
Let , be two binary sequences. Define as the number of positions and differ.

Lemma. satisfies the triangle inequality, that is, for all binary sequences , , .

Proof. and differ in positions, so they coincide in positions. Of these positions, in at most positions and differ, so , and coincide in at least positions. So .

Define the sphere with center as the set of binary sequences such that . Let be a set of binary sequences of length so that any two differ in at least positions and , two binary sequences from . If the spheres with centers and have an intersection, then and are at distance at most . So and for all sequences in the intersection . Each sequence belongs to at most spheres with center in , because if belongs to more spheres then there are two sequences and such that they differ with in the same positions. This means that , contradiction.

The number of sequences in each sphere is . Since each pair of spheres can intersect and each sequence belongs to at most spheres,

Techniques

Counting two waysPigeonhole principleColoring schemes, extremal arguments