Browse · MathNet
PrintChina Southeastern Mathematical Olympiad
China counting and probability
Problem
Let set . Find all positive integer , such that there are at least two different elements and in any subset with 35 elements of , such that or . (posed by Li Shenghong)
Solution
Take , then for any , In the following, we show that . Let , without loss of generality, suppose that .
i. If , by and by Dirichlet's Drawer Theorem, there exist () such that , that is, .
ii. If , by and by Dirichlet's Drawer Theorem, there exist at least () such that , that is, .
iii. If , since we see that there are at least 25 elements in that belong to . There are at most 24 elements in such that . Hence, .
iv. If , since have at most 34 elements, by Dirichlet Drawer Theorem, there exist () such that , that is .
v. If , there are 33 elements . Hence, there exist () such that .
vi. If , if ; if ; if , , there exist () such that . If , , , ..., , , , , ..., ; if , ; if , ; if , , there exist () such that .
i. If , by and by Dirichlet's Drawer Theorem, there exist () such that , that is, .
ii. If , by and by Dirichlet's Drawer Theorem, there exist at least () such that , that is, .
iii. If , since we see that there are at least 25 elements in that belong to . There are at most 24 elements in such that . Hence, .
iv. If , since have at most 34 elements, by Dirichlet Drawer Theorem, there exist () such that , that is .
v. If , there are 33 elements . Hence, there exist () such that .
vi. If , if ; if ; if , , there exist () such that . If , , , ..., , , , , ..., ; if , ; if , ; if , , there exist () such that .
Final answer
1 <= n <= 69
Techniques
Pigeonhole principle