Difference between revisions of "1990 AHSME Problems/Problem 29"
| Line 1: | Line 1: | ||
| + | == Problem == | ||
| + | |||
| + | A subset of the integers <math>1,2,\cdots,100</math> has the property that none of its members is 3 times another. What is the largest number of members such a subset can have? | ||
| + | |||
| + | <math>\text{(A) } 50\quad | ||
| + | \text{(B) } 66\quad | ||
| + | \text{(C) } 67\quad | ||
| + | \text{(D) } 76\quad | ||
| + | \text{(E) } 78</math> | ||
| + | |||
| + | == Solution == | ||
| + | <math>\fbox{E}</math> | ||
| + | |||
| + | == See also == | ||
| + | {{AHSME box|year=1990|num-b=28|num-a=29}} | ||
| + | |||
| + | [[Category: Intermediate Number Theory Problems]] | ||
{{MAA Notice}} | {{MAA Notice}} | ||
Revision as of 14:31, 29 September 2014
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?
Solution
See also
| 1990 AHSME (Problems • Answer Key • Resources) | ||
| Preceded by Problem 28 |
Followed by Problem 29 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30 | ||
| All AHSME Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
