Skip to main content
OlympiadHQ

Browse · harp

Print

smc

counting and probability senior

Problem

A subset of the integers has the property that none of its members is 3 times another. What is the largest number of members such a subset can have?
(A)
(B)
(C)
(D)
Solution
Notice that inclusion of the integers from to is allowed as long as no integer between and inclusive is within the set. This provides a total of = 67 solutions. Further analyzation of the remaining integers between and , we notice that we can include all the numbers except (as including would force us to remove both and ) to obtain the maximum number of solutions. Thus, , yielding our answer,
Final answer
D