Picks that force a divisor
You choose distinct integers from . What is the smallest number of picks that guarantees two of the chosen numbers satisfy "one divides the other"?
Show hints (3)+
- Write each number as a power of 2 times an odd number.
- Numbers with the same odd part divide one another.
- Look at the top half for a large divisor-free set.
Answer
Reveal answer →Final answer
16
Create a free account to see the full worked solution and track your progress.
Interview format: Trading Aptitude Tests, Systematic & Data-Driven Trading