Skip to main content
OlympiadHQ

Browse · MathNet

Print

China Western Mathematical Olympiad

China counting and probability

Problem

Let be a subset satisfying the following condition: For any three elements in , there exist two of them and , such that or . Determine, with proof, the maximum value of , where denotes the number of elements of . (posed by Feng Zhigang)
Solution
One can check that satisfies the condition, and .

Suppose that , and let be the elements of , where . We first prove that for all ; otherwise, we have for some , then any two of these three integers do not have any multiple relationship, which contradicts the assumption.

It follows from the inequality above that , , , , which is a contradiction!

Hence, the maximum value of is .
Final answer
21

Techniques

Coloring schemes, extremal arguments