Difference between revisions of "2008 AMC 8 Problems/Problem 22"
(→Solution 3) |
(→Solution 3) |
||
Line 31: | Line 31: | ||
==Solution 3== | ==Solution 3== | ||
− | So we know the largest <math>3</math> digit number is <math>999</math> and the lowest is <math>100</math>. This means <math>\dfrac{n}{3} \ge 100 \rightarrow n \ge 300</math> but <math>3n \le 999 \rightarrow n \le 333</math>. So we have the set <math>{300, 301, 302, \cdots, 330, 331, 332, 333}</math> for <math>n</math>. Now we have to find the multiples of <math>3</math> suitable for <math>n</math>, or else <math>\dfrac{n}{3}</math> will be a decimal. Only numbers <math>{300, 303, \cdots, 333}</math> are counted. We can divide by <math>3</math> to make the difference <math>1</math> again, getting <math>{100, 101 \cdots , 111}</math>. Due to it being inclusive, we have <math>111-100+1 =\boxed{\textbf{(A)} 12}</math> | + | So we know the largest <math>3</math> digit number is <math>999</math> and the lowest is <math>100</math>. This means <math>\dfrac{n}{3} \ge 100 \rightarrow n \ge 300</math> but <math>3n \le 999 \rightarrow n \le 333</math>. So we have the set <math>{300, 301, 302, \cdots, 330, 331, 332, 333}</math> for <math>n</math>. Now we have to find the multiples of <math>3</math> suitable for <math>n</math>, or else <math>\dfrac{n}{3}</math> will be a decimal. Only numbers <math>{300, 303, \cdots, 333}</math> are counted. We can divide by <math>3</math> to make the difference <math>1</math> again, getting <math>{100, 101 \cdots , 111}</math>. Due to it being inclusive, we have <math>111-100+1 =\boxed{\textbf{(A) } 12}</math> |
==Video Solution by OmegaLearn== | ==Video Solution by OmegaLearn== |
Revision as of 23:41, 29 August 2023
Contents
[hide]Problem
For how many positive integer values of are both and three-digit whole numbers?
Solution 1
Instead of finding n, we find . We want and to be three-digit whole numbers. The smallest three-digit whole number is , so that is our minimum value for , since if , then . The largest three-digit whole number divisible by is , so our maximum value for is . There are whole numbers in the closed set , so the answer is .
- ColtsFan10
Solution 2
We can set the following inequalities up to satisfy the conditions given by the question, , and . Once we simplify these and combine the restrictions, we get the inequality, . Now we have to find all multiples of 3 in this range for to be an integer. We can compute this by setting , where . Substituting for in the previous inequality, we get, , and there are integers in this range giving us the answer, .
- kn07
==
Solution 3
So we know the largest digit number is and the lowest is . This means but . So we have the set for . Now we have to find the multiples of suitable for , or else will be a decimal. Only numbers are counted. We can divide by to make the difference again, getting . Due to it being inclusive, we have
Video Solution by OmegaLearn
https://youtu.be/rQUwNC0gqdg?t=230
See Also
2008 AMC 8 (Problems • Answer Key • Resources) | ||
Preceded by Problem 21 |
Followed by Problem 23 | |
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 AJHSME/AMC 8 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.