Skip to main content
OlympiadHQ

Browse · MathNet

Print

China Mathematical Olympiad

China counting and probability

Problem

Given , consider function satisfying both the following conditions: (1) for all ; (2) for all with .

Find the smallest positive integer , such that for any such function there exists a set satisfying and . Remark. For a subset of , we define .
Solution
First, we define a function with Obviously, satisfies condition (1). For any with , if (i) there exists an integer with such that , then ; or (ii) , then also holds. In both cases, satisfies condition (2). If a subset of satisfies , then we have for all , , and . Hence, .

Next, we will show that, for any function satisfying the described conditions, there exists a subset with such that .

Among all the subsets with , choose one such that is maximal. If there are many with being maximal, choose one such that is maximal. The existence of is guaranteed by condition (1). Let , . Note that are pairwise disjoint and . From condition (2), , , .

We make the following assertions: (i) , for all . Otherwise, let , since , , , we have . It is a contradiction to being maximal. (ii) for all , . Otherwise, let then by condition (1), . Let , since , , we have . It is a contradiction to being maximal.

Let , , then by (i) and (ii), are distinct elements of . (iii) for all . Otherwise, let , , then , . However, . It is a contradiction to being maximal.

Therefore, are distinct elements of . In particular, . As , we have and . Let , then and . Overall, the desired smallest integer is 69.
Final answer
69

Techniques

Coloring schemes, extremal argumentsCounting two ways