I am asked to find the largest number of elements that a set of integers from 1 through 100 can have so that no one element in the set is divisible by another. I was told a "hint:" Imagine all the numbers 1--100 in the form (2^k) * m where k ≥ 0 and m is odd. I have DONE this for nearly all the integers 1--100 but cannot see a viable pattern. I don`t want the answer to this question just help interpreting the hint or maybe some insight into a nother way to solve it. Any help would be great. Thanks!

Need a hint? Click here.

Click here for the complete solution.