Maths Olympiad Prep

Library / /45 of 84

, 2014

Combinatorics Difficulty 5.3 AIME, harder Prove it United States

Problem:
Let S={100,99,98,,99,100}S = \{-100, -99, -98, \ldots, 99, 100\}. Choose a 50-element subset TT of SS at random. Find the expected number of elements of the set {x:xT}\{|x| : x \in T\}.

Solution

Solution:
Let us solve a more generalized version of the problem: Let SS be a set with 2n+12n+1 elements, and partition SS into sets A0,A1,,AnA_{0}, A_{1}, \ldots, A_{n} such that A0=1|A_{0}| = 1 and A1=A2==An=2|A_{1}| = |A_{2}| = \cdots = |A_{n}| = 2. (In this problem, we have A0={0}A_{0} = \{0\} and Ak={k,k}A_{k} = \{k, -k\} for k=1,2,,100k = 1, 2, \ldots, 100.) Let TT be a randomly chosen mm-element subset of SS. What is the expected number of AkA_{k}'s that have a representative in TT?

For k=0,1,,nk = 0, 1, \ldots, n, let wk=1w_{k} = 1 if TAkT \cap A_{k} \neq \emptyset and 00 otherwise, so that the number of AkA_{k}'s that have a representative in TT is equal to k=0nwk\sum_{k=0}^{n} w_{k}. It follows that the expected number of AkA_{k}'s that have a representative in TT is equal to

E[w0+w1++wn]=E[w0]+E[w1]++E[wn]=E[w0]+nE[w1] \mathrm{E}\left[w_{0} + w_{1} + \cdots + w_{n}\right] = \mathrm{E}\left[w_{0}\right] + \mathrm{E}\left[w_{1}\right] + \cdots + \mathrm{E}\left[w_{n}\right] = \mathrm{E}\left[w_{0}\right] + n\, \mathrm{E}\left[w_{1}\right]

since E[w1]=E[w2]==E[wn]\mathrm{E}\left[w_{1}\right] = \mathrm{E}\left[w_{2}\right] = \cdots = \mathrm{E}\left[w_{n}\right] by symmetry.

Now E[w0]\mathrm{E}\left[w_{0}\right] is equal to the probability that TA0T \cap A_{0} \neq \emptyset, that is, the probability that the single element of A0A_{0} is in TT, which is m/(2n+1)m/(2n+1). Similarly, E[w1]\mathrm{E}\left[w_{1}\right] is the probability that TA1T \cap A_{1} \neq \emptyset, that is, the probability that at least one of the two elements of A1A_{1} is in TT. Since there are (2n1m)\binom{2n-1}{m} mm-element subsets of SS that exclude both elements of A1A_{1}, and there are (2n+1m)\binom{2n+1}{m} mm-element subsets of SS in total, we have that

E[w1]=1(2n1m)(2n+1m)=1(2nm)(2nm+1)2n(2n+1) \mathrm{E}\left[w_{1}\right] = 1 - \frac{\binom{2n-1}{m}}{\binom{2n+1}{m}} = 1 - \frac{(2n-m)(2n-m+1)}{2n(2n+1)}

Putting this together, we find that the expected number of AkA_{k}'s that have a representative in TT is
m2n+1+n(2nm+1)(2nm)2(2n+1) \frac{m}{2n+1} + n - \frac{(2n-m+1)(2n-m)}{2(2n+1)}

In this particular problem, we have n=100n = 100 and m=50m = 50, so substituting these values gives our answer of 8825201\frac{8825}{201}.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.