Learn / Library / Brainteasers
A dividing pair
You choose distinct whole numbers from to . What is the smallest count of chosen numbers that guarantees that one of them divides another?
Checking an answer needs JavaScript. The hint and the solution open without it.
Hint
Group the numbers by their largest odd divisor.
Solution
- Write each number as with odd; there are possible odd parts , from to .
- Numbers with the same odd part form a chain such as , , , , in which the smaller always divides the larger.
- So among any numbers, share an odd part and one divides the other.
- The numbers from to contain no such pair, because is larger than , so numbers are not enough.
- So the answer is .
Answer: