Maths Olympiad Prep

Library / /5 of 6

Combinatorics Difficulty 5.7 AIME, harder Prove it Brazil

Show that we cannot form more than 40964096 binary sequences of length 2424 so that any two differ in at least 88 positions.

Solution

Let pp, qq be two binary sequences. Define d(p,q)d(p, q) as the number of positions pp and qq differ.

Lemma. dd satisfies the triangle inequality, that is, d(p,q)d(p,r)+d(r,q)d(p, q) \le d(p, r) + d(r, q) for all binary sequences pp, qq, rr.

Proof. pp and rr differ in d(p,r)d(p, r) positions, so they coincide in 24d(p,r)24 - d(p, r) positions. Of these positions, in at most d(q,r)d(q, r) positions qq and rr differ, so pp, qq and rr coincide in at least 24d(p,r)d(q,r)24 - d(p, r) - d(q, r) positions. So d(p,q)d(p,r)+d(r,q)d(p, q) \le d(p, r) + d(r, q).

Define the sphere with center pp as the set of binary sequences qq such that d(p,q)4d(p, q) \le 4. Let SS be a set of binary sequences of length 2424 so that any two differ in at least 88 positions and p1p_1, p2p_2 two binary sequences from SS. If the spheres with centers p1p_1 and p2p_2 have an intersection, then p1p_1 and p2p_2 are at distance at most 4+4=84 + 4 = 8. So d(p1,p2)=8d(p_1, p_2) = 8 and for all sequences qq in the intersection d(p1,q)=d(p2,q)=4d(p_1, q) = d(p_2, q) = 4. Each sequence qq belongs to at most 24/4=624 / 4 = 6 spheres with center in SS, because if qq belongs to more spheres then there are two sequences q1q_1 and q2q_2 such that they differ with qq in the same positions. This means that d(q1,q2)<d(q1,q)+d(q,q2)=8d(q_1, q_2) < d(q_1, q) + d(q, q_2) = 8, contradiction.

The number of sequences in each sphere is (240)+(241)+(242)+(243)+(244)\binom{24}{0} + \binom{24}{1} + \binom{24}{2} + \binom{24}{3} + \binom{24}{4}. Since each pair of spheres can intersect and each sequence belongs to at most 66 spheres,
S((240)+(241)+(242)+(243)+16(244))224    S4096224    S4096 |S| \cdot \left( \binom{24}{0} + \binom{24}{1} + \binom{24}{2} + \binom{24}{3} + \frac{1}{6} \binom{24}{4} \right) \le 2^{24} \\ \iff |S| \cdot 4096 \le 2^{24} \iff |S| \le 4096

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.