olymmath

ISL 2022 C5

Let m,n⩾2m, n \geqslant 2 be integers, let XX be a set with nn elements, and let X1,X2,…,XmX_{1}, X_{2}, \ldots, X_{m} be pairwise distinct non-empty, not necessary disjoint subsets of XX. A function f:X→f: X \rightarrow {1,2,…,n+1}\{1,2, \ldots, n+1\} is called nice if there exists an index kk such that ∑x∈Xkf(x)>∑x∈Xif(x) for all i≠k\sum_{x \in X_{k}} f(x)>\sum_{x \in X_{i}} f(x) \text { for all } i \neq k Prove that the number of nice functions is at least nnn^{n}. (Germany)

Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.

Official text: IMO 2022 Shortlist booklet, page 7.

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

These problems have the most words in common with this statement.

Locator isl/2022/c5 · Tag G4CJYMQ3CP · Edit this page on GitHub · Keys: j next, k previous