IMC 2019, Day 2, Problem 8
Let 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 .
Original from the official PDF

This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
Proposed by Fedor Part and Fedor Petrov, St. Petersburg State University
Solution. 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 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.
Transcribed from the official solutions, page 2. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.