IMC / 2019 / Problems / Day 2, P8
IMC 2019 · Day 2 · P8
very hardLet be real numbers. For any set let . Assume that the function takes on at least values where runs over all subsets of . Prove that the number of sets for which does not exceed .
Proposed by Fedor Part and Fedor Petrov, St. Petersburg State University
Solution (official)
Choose disctint sets where , and let be all sets so that ; for the sake of contradiction, assume that .
Every set can be identified with a vector of length : the th coordinate in the vector is 1 if . Then , where and stands for the usual scalar product.
For all ordered pairs consider the vector . By the pigeonhole principle, since , there are two pairs and such that . Multiplying this by we get ; that implies . But then , that is, , and our pairs coincide. Contradiction.
How the field did
Score distribution (field cohort)
Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.