Maths Olympiad Prep

Library / /15 of 28

Combinatorics Difficulty 7.7 National Olympiad, round 2 Prove it Hong Kong

Suppose all of the 200200 integers lying in between (and including) 11 and 200200 are written on a blackboard. Suppose we choose exactly 100100 of these numbers and circle each one of them. By the score of such a choice, we mean the square of the difference between the sum of the circled numbers and the sum of the non-circled numbers. What is the average of the scores over all possible choices for 100100 numbers?

Solution

The average score is 670000670000.
Let n=100n = 100, and let SS be any subset of {1,2,,2n}\{1, 2, \dots, 2n\} such that S=n|S| = n. There are (2nn)\binom{2n}{n} such sets SS. The score of SS is
(aSabSb)2=(k=12nk2aSa)2=(2n(2n+1)2)24(2n(2n+1)2)aSa+4(aSa)2=n2(2n+1)24n(2n+1)aSa+4aSa2+4a,bSabab. \begin{aligned} \left( \sum_{a \in S} a - \sum_{b \notin S} b \right)^2 &= \left( \sum_{k=1}^{2n} k - 2 \sum_{a \in S} a \right)^2 \\ &= \left( \frac{2n(2n+1)}{2} \right)^2 - 4 \left( \frac{2n(2n+1)}{2} \right) \sum_{a \in S} a + 4 \left( \sum_{a \in S} a \right)^2 \\ &= n^2(2n+1)^2 - 4n(2n+1) \sum_{a \in S} a + 4 \sum_{a \in S} a^2 + 4 \sum_{\substack{a, b \in S \\ a \neq b}} ab. \end{aligned}

SaSa=a=12naSa=a=12na(2n1n1)=n(2n+1)(2n1n1) \sum_{S} \sum_{a \in S} a = \sum_{a=1}^{2n} \sum_{a \in S} a = \sum_{a=1}^{2n} a \binom{2n-1}{n-1} = n(2n+1) \binom{2n-1}{n-1}

S(aSa2+a,bSabab)=a=12naSa2+a,b=1ab2na,bSab=a=12na2(2n1n1)+a,b=1ab2nab(2n2n2)=a=12na2(2n1n1)+a=12na(b=12nba)(2n2n2)=a=12na2[(2n1n1)(2n2n2)]+n(2n+1)(2n2n2)a=12na=n(2n+1)(4n+1)3(2n2n1)+n2(2n+1)2(2n2n2). \begin{align*} \sum_S \left( \sum_{a \in S} a^2 + \sum_{\substack{a, b \in S \\ a \neq b}} ab \right) &= \sum_{a=1}^{2n} \sum_{a \in S} a^2 + \sum_{\substack{a, b=1 \\ a \neq b}}^{2n} \sum_{a, b \in S} ab \\ &= \sum_{a=1}^{2n} a^2 \binom{2n-1}{n-1} + \sum_{\substack{a, b=1 \\ a \neq b}}^{2n} ab \binom{2n-2}{n-2} \\ &= \sum_{a=1}^{2n} a^2 \binom{2n-1}{n-1} + \sum_{a=1}^{2n} a \left( \sum_{b=1}^{2n} b - a \right) \binom{2n-2}{n-2} \\ &= \sum_{a=1}^{2n} a^2 \left[ \binom{2n-1}{n-1} - \binom{2n-2}{n-2} \right] + n(2n+1) \binom{2n-2}{n-2} \sum_{a=1}^{2n} a \\ &= \frac{n(2n+1)(4n+1)}{3} \binom{2n-2}{n-1} + n^2(2n+1)^2 \binom{2n-2}{n-2}. \end{align*}

Therefore, the average score is
n2(2n+1)2+(2nn)1[4n2(2n+1)2(2n1n1)+4n(2n+1)(4n+1)3(2n2n1)+4n2(2n+1)2(2n2n2)]=n2(2n+1)2+(2n2(2n+1)2+2n2(2n+1)(4n+1)3(2n1)+2(n1)n2(2n+1)22n1)=n2(2n+1)3=670000. \begin{align*} & n^2(2n+1)^2 + \left(\frac{2n}{n}\right)^{-1} \left[ -4n^2(2n+1)^2 \binom{2n-1}{n-1} + \frac{4n(2n+1)(4n+1)}{3} \binom{2n-2}{n-1} \right. \\ & \qquad \left. + 4n^2(2n+1)^2 \binom{2n-2}{n-2} \right] \\ &= n^2(2n+1)^2 + \left( -2n^2(2n+1)^2 + \frac{2n^2(2n+1)(4n+1)}{3(2n-1)} + \frac{2(n-1)n^2(2n+1)^2}{2n-1} \right) \\ &= \frac{n^2(2n+1)}{3} \\ &= 670000. \end{align*}

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.