MathDB
1990 AMC 12 #29

Source:

December 31, 2011
AMC

Problem Statement

A subset of the integers 1,2,...,1001, 2, ..., 100 has the property that none of its members is 3 times another. What is the largest number of members such a subset can have?
<spanclass=latexbold>(A)</span> 50<spanclass=latexbold>(B)</span> 66<spanclass=latexbold>(C)</span> 67<spanclass=latexbold>(D)</span> 76<spanclass=latexbold>(E)</span> 78 <span class='latex-bold'>(A)</span>\ 50 \qquad<span class='latex-bold'>(B)</span>\ 66 \qquad<span class='latex-bold'>(C)</span>\ 67 \qquad<span class='latex-bold'>(D)</span>\ 76 \qquad<span class='latex-bold'>(E)</span>\ 78