Browse · MathNet
Print2023 Chinese IMO National Team Selection Test
China 2023 counting and probability
Problem
A nonempty set of integers is called a “beautiful set” if for any and , the set has exactly elements. Prove that: if the intersection of an integer set and any beautiful set is not empty, then contains a beautiful set.
Note: Here represents the greatest integer not exceeding .
Note: Here represents the greatest integer not exceeding .
Solution
For a positive integer , a non-empty set of integers is called an “order strong beautiful set” if and for any and , we have . It is clear that a 2023-order strong beautiful set is a beautiful set. We will prove the following proposition by induction: For any positive integer , if a set of integers has a non-empty intersection with every order strong beautiful set, then contains an order strong beautiful set. Taking in this proposition will imply the original problem.
When , the order 1 strong beautiful sets are the binary subsets of . It is easy to see that the proposition holds in this case. Suppose the proposition holds for . We will prove that it also holds for . First, note that if and are -order strong beautiful sets and is a binary subset of , then the set is an -order strong beautiful set. Let be a set of integers that has a non-empty intersection with every -order strong beautiful set. Consider the sets We claim that there exists a binary subset of such that both and have a non-empty intersection with every -order strong beautiful set. If not, then there exist a binary subset of and -order strong beautiful sets and such that for . As a result, the -order strong beautiful set does not intersect with , which is a contradiction. By the induction hypothesis, contains an -order strong beautiful set , and contains an -order strong beautiful set . Therefore, contains an -order strong beautiful set .
---
Alternative solution.
For a positive integer and an integer , a non-empty set of integers is called an “-th order -basic beautiful set” if and for any and , we have . It is clear that for any integer , any 2023-th order -basic beautiful set is a beautiful set. We will prove the proposition by induction: for any set of integers and any integer , there exists an -th order -basic beautiful set such that either or (where denotes the complement of ). If is true, then the set or its complement contains a beautiful set. Since by assumption, it follows that , and the original problem is solved.
When , by the pigeonhole principle, the set contains at least two elements and that belong to either or . Then is a 1-st order -basic beautiful set, and or . Thus, the proposition holds. Assume that the proposition holds. We will prove that the proposition also holds. For any set of integers and any integer , by the induction hypothesis, there exists an -th order -basic beautiful set , an -th order -basic beautiful set , and an -th order -basic beautiful set , which satisfy that for any , either or . According to the pigeonhole principle, at least two sets among , denoted as and (), are both contained in or . Define , it can be easily verified that is an -th order -basic beautiful set, and either or . Therefore, the proposition holds.
When , the order 1 strong beautiful sets are the binary subsets of . It is easy to see that the proposition holds in this case. Suppose the proposition holds for . We will prove that it also holds for . First, note that if and are -order strong beautiful sets and is a binary subset of , then the set is an -order strong beautiful set. Let be a set of integers that has a non-empty intersection with every -order strong beautiful set. Consider the sets We claim that there exists a binary subset of such that both and have a non-empty intersection with every -order strong beautiful set. If not, then there exist a binary subset of and -order strong beautiful sets and such that for . As a result, the -order strong beautiful set does not intersect with , which is a contradiction. By the induction hypothesis, contains an -order strong beautiful set , and contains an -order strong beautiful set . Therefore, contains an -order strong beautiful set .
---
Alternative solution.
For a positive integer and an integer , a non-empty set of integers is called an “-th order -basic beautiful set” if and for any and , we have . It is clear that for any integer , any 2023-th order -basic beautiful set is a beautiful set. We will prove the proposition by induction: for any set of integers and any integer , there exists an -th order -basic beautiful set such that either or (where denotes the complement of ). If is true, then the set or its complement contains a beautiful set. Since by assumption, it follows that , and the original problem is solved.
When , by the pigeonhole principle, the set contains at least two elements and that belong to either or . Then is a 1-st order -basic beautiful set, and or . Thus, the proposition holds. Assume that the proposition holds. We will prove that the proposition also holds. For any set of integers and any integer , by the induction hypothesis, there exists an -th order -basic beautiful set , an -th order -basic beautiful set , and an -th order -basic beautiful set , which satisfy that for any , either or . According to the pigeonhole principle, at least two sets among , denoted as and (), are both contained in or . Define , it can be easily verified that is an -th order -basic beautiful set, and either or . Therefore, the proposition holds.
Techniques
Pigeonhole principleInduction / smoothingIntegers