Difference between revisions of "2001 AMC 12 Problems/Problem 12"
Soyamyboya (talk | contribs) (→Solution 1) |
(→Solution 4) |
||
Line 46: | Line 46: | ||
===Solution 4=== | ===Solution 4=== | ||
Take a good-sized sample of consecutive integers; for example, the first 25 positive integers. Determine that the numbers 3, 4, 6, 8, 12, 16, 18, 21, and 24 exhibit the properties given in the question. 25 is a divisor of 2000, so there are <math>\frac{9}{25}*2000=800</math> numbers satisfying the given conditions between 1 and 2000. Since 2001 is a multiple of 3, add 1 to 800 to get <math>800+1=\boxed{\textbf{(B)}\ 801}</math>. | Take a good-sized sample of consecutive integers; for example, the first 25 positive integers. Determine that the numbers 3, 4, 6, 8, 12, 16, 18, 21, and 24 exhibit the properties given in the question. 25 is a divisor of 2000, so there are <math>\frac{9}{25}*2000=800</math> numbers satisfying the given conditions between 1 and 2000. Since 2001 is a multiple of 3, add 1 to 800 to get <math>800+1=\boxed{\textbf{(B)}\ 801}</math>. | ||
+ | |||
+ | ===Solution 5=== | ||
+ | Since the least common multiple of 3,4,5 is 60, we know the pattern will repeat itself in 60 multiples. | ||
+ | |||
+ | So start with a 1 to 60 matrix, cross out all 5 multiples and box all 3 multiples not crossed out, and underbrace all 4 multiples not crossed out and not boxed. | ||
+ | |||
+ | Then count all the boxed or underbraced numbers, we find 24 of them. | ||
+ | |||
+ | So the for every 60 numbers, there will be 24 numbers 2/5 numbers fit the pattern, so pick 801 which is the closest answer by multiple 2/5 to 2001. | ||
+ | |||
+ | \[ | ||
+ | \begin{bmatrix} | ||
+ | 1 & 2 & \boxed{3} & \underbrace{4} & \cancel{5} & \boxed{6} & 7 & \underbrace{8} & \boxed{9} & \cancel{10}\\ | ||
+ | 11 & \boxed{12} & 13 & 14 & \cancel{15} & \underbrace{16} & 17 & \boxed{18} & 19 & \cancel{20}\\ | ||
+ | \boxed{21} & 22 & 23 & \boxed{24} & \cancel{25} & 26 & \boxed{27} & \underbrace{28} & 29 & \cancel{30}\\ | ||
+ | 31 & \underbrace{32} & \boxed{33} & 34 & \cancel{35} & \boxed{36} & 37 & 38 & \boxed{39} & \cancel{40}\\ | ||
+ | 41 & \boxed{42} & 43 & \underbrace{44} & \cancel{45} & 46 & 47 & \boxed{48} & 49 & \cancel{50}\\ | ||
+ | \boxed{51} & \underbrace{52} & 53 & \boxed{54} & \cancel{55} & \underbrace{56} & \boxed{57} & 58 & 59 & \cancel{60}\\ | ||
+ | \end{bmatrix} | ||
+ | \] | ||
== See Also == | == See Also == |
Revision as of 13:03, 22 April 2018
- The following problem is from both the 2001 AMC 12 #12 and 2001 AMC 10 #25, so both problems redirect to this page.
Contents
Problem
How many positive integers not exceeding are multiples of or but not ?
Solution 1
Out of the numbers to four are divisible by and three by , counting twice. Hence out of these numbers are multiples of or .
The same is obviously true for the numbers to for any positive integer .
Hence out of the numbers to there are numbers that are divisible by or . Out of these , the numbers , , , , and are divisible by . Therefore in the set there are precisely numbers that satisfy all criteria from the problem statement.
Again, the same is obviously true for the set for any positive integer .
We have , hence there are good numbers among the numbers to . At this point we already know that the only answer that is still possible is , as we only have numbers left.
By examining the remaining by hand we can easily find out that exactly of them match all the criteria, giving us good numbers. This is correct.
Solution 2
We can solve this problem by finding the cases where the number is divisible by or , then subtract from the cases where none of those cases divide . To solve the ways the numbers divide or we find the cases where a number is divisible by and as separate cases. We apply the floor function to every case to get , , and . The first two floor functions were for calculating the number of individual cases for and . The third case was to find any overlapping numbers. The numbers were , , and , respectively. We add the first two terms and subtract the third to get . The first case is finished.
The second case is more or less the same, except we are applying and to . We must find the cases where the first case over counts multiples of five. Utilizing the floor function again on the fractions , , and yields the numbers , , and . The first two numbers counted all the numbers that were multiples of either four with five or three with five less than . The third counted the overlapping cases, which we must subtract from the sum of the first two. We do this to reach . Subtracting this number from the original numbers procures .
Solution 3
First find the number of such numbers between 1 and 2000 (inclusive) and then add one to this result because 2001 is a multiple of 3.
There are numbers that are not multiples of . are not multiples of or , so numbers are.
Solution 4
Take a good-sized sample of consecutive integers; for example, the first 25 positive integers. Determine that the numbers 3, 4, 6, 8, 12, 16, 18, 21, and 24 exhibit the properties given in the question. 25 is a divisor of 2000, so there are numbers satisfying the given conditions between 1 and 2000. Since 2001 is a multiple of 3, add 1 to 800 to get .
Solution 5
Since the least common multiple of 3,4,5 is 60, we know the pattern will repeat itself in 60 multiples.
So start with a 1 to 60 matrix, cross out all 5 multiples and box all 3 multiples not crossed out, and underbrace all 4 multiples not crossed out and not boxed.
Then count all the boxed or underbraced numbers, we find 24 of them.
So the for every 60 numbers, there will be 24 numbers 2/5 numbers fit the pattern, so pick 801 which is the closest answer by multiple 2/5 to 2001.
\[ \begin{bmatrix}
1 & 2 & \boxed{3} & \underbrace{4} & \cancel{5} & \boxed{6} & 7 & \underbrace{8} & \boxed{9} & \cancel{10}\\ 11 & \boxed{12} & 13 & 14 & \cancel{15} & \underbrace{16} & 17 & \boxed{18} & 19 & \cancel{20}\\ \boxed{21} & 22 & 23 & \boxed{24} & \cancel{25} & 26 & \boxed{27} & \underbrace{28} & 29 & \cancel{30}\\ 31 & \underbrace{32} & \boxed{33} & 34 & \cancel{35} & \boxed{36} & 37 & 38 & \boxed{39} & \cancel{40}\\ 41 & \boxed{42} & 43 & \underbrace{44} & \cancel{45} & 46 & 47 & \boxed{48} & 49 & \cancel{50}\\ \boxed{51} & \underbrace{52} & 53 & \boxed{54} & \cancel{55} & \underbrace{56} & \boxed{57} & 58 & 59 & \cancel{60}\\
\end{bmatrix} \]
See Also
2001 AMC 12 (Problems • Answer Key • Resources) | |
Preceded by Problem 11 |
Followed by Problem 13 |
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 | |
All AMC 12 Problems and Solutions |
2001 AMC 10 (Problems • Answer Key • Resources) | ||
Preceded by Problem 25 |
Followed by Last Question | |
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 | ||
All AMC 10 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.