Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 2017 / Problems / Day 1, P4

IMC 2017 · Day 1 · P4

very hard

There are nn people in a city, and each of them has exactly 1000 friends (friendship is always symmetric). Prove that it is possible to select a group SS of people such that at least n/2017n/2017 persons in SS have exactly two friends in SS.

(Proposed by Rooholah Majdodin and Fedor Petrov, St. Petersburg State University)

Solution (official)

Let d=1000d = 1000 and let 0<p<10 < p < 1. Choose the set SS randomly such that each people is selected with probability pp, independently from the others.

The probability that a certain person is selected for SS and knows exactly two members of SS is q=(d2)p3(1p)d2.q = \binom{d}{2} p^3 (1 - p)^{d-2}. Choose p=3/(d+1)p = 3/(d+1) (this is the value of pp for which qq is maximal); then q=(d2)(3d+1)3(d2d+1)d2==27d(d1)2(d+1)3(1+3d2)(d2)>27d(d1)2(d+1)3e3>12017.\begin{align*} q &= \binom{d}{2} \left( \frac{3}{d+1} \right)^3 \left( \frac{d-2}{d+1} \right)^{d-2} = \\ &= \frac{27 d (d-1)}{2 (d+1)^3} \left( 1 + \frac{3}{d-2} \right)^{-(d-2)} > \frac{27 d (d-1)}{2 (d+1)^3} \cdot e^{-3} > \frac{1}{2017}. \end{align*} Hence, E(S)=nq>n2017\mathsf{E} \bigl( |S| \bigr) = nq > \frac{n}{2017},

so there is a choice for SS when S>n2017|S| > \frac{n}{2017}.

How the field did

contestants scored
315
average (of 10)
1.43
solved (≥ 80%)
11.1%
near-0 (≤ 10%)
80.6%
discrimination
0.52

Score distribution (field cohort)

Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.

Similar problems

IMC 2021 · Day 1 · P2mediumavg 5.4/10 · solved 39% · near-0 19% · disc 0.46
IMC 1999 · Day 2 · P8mediumavg 5.6/10 · solved 49% · near-0 32% · disc 0.58
IMC 2008 · Day 1 · P6very hardavg 1.3/10 · solved 11% · near-0 82% · disc 0.47
IMC 2003 · Day 2 · P10very hardavg 2.2/10 · solved 12% · near-0 67% · disc 0.46