Difference between revisions of "1995 AHSME Problems/Problem 11"
(I'm getting the old AMC 12 box now.) |
(→Solution) |
||
(7 intermediate revisions by 4 users not shown) | |||
Line 8: | Line 8: | ||
==Solution== | ==Solution== | ||
− | For condition (i), the restriction is put on a; N<4000 if a<4, and | + | *For condition (i), the restriction is put on <math>a</math>; <math>N<4000</math> if <math>a<4</math>, and <math>N \ge 6</math> if <math>a \ge 6</math>. Therefore, <math>a=4,5</math>. |
+ | *For condition (ii), the restriction is put on <math>d</math>; it must be a multiple of <math>5</math>. Therefore, <math>d=0,5</math>. | ||
+ | *For condition (iii), the restriction is put on <math>b</math> and <math>c</math>. The possible ordered pairs of <math>b</math> and <math>c</math> are <math>(3,4)</math>, <math>(3,5)</math>, <math>(3,6)</math>, <math>(4,5), (4,6),</math> and <math>(5,6),</math> and there are <math>6</math> of them. Alternatively, we are picking from the four digits 3, 4, 5, 6, and for every combination of two, there is exactly one way to arrange them in increasing order, so we have <math>\binom{4}{2} = 6</math> choices for <math>b</math> and <math>c</math> when we consider them together. | ||
− | + | Multiplying the possibilities for each restriction, <math>2 \cdot 2 \cdot 6=24\Rightarrow \mathrm{(C)}</math>. | |
− | + | ==See also== | |
+ | {{AHSME box|year=1995|num-b=10|num-a=12}} | ||
− | + | [[Category:Introductory Combinatorics Problems]] | |
− | + | {{MAA Notice}} | |
− |
Latest revision as of 09:37, 30 March 2023
Problem
How many base 10 four-digit numbers, , satisfy all three of the following conditions?
(i) (ii) is a multiple of 5; (iii) .
Solution
- For condition (i), the restriction is put on ; if , and if . Therefore, .
- For condition (ii), the restriction is put on ; it must be a multiple of . Therefore, .
- For condition (iii), the restriction is put on and . The possible ordered pairs of and are , , , and and there are of them. Alternatively, we are picking from the four digits 3, 4, 5, 6, and for every combination of two, there is exactly one way to arrange them in increasing order, so we have choices for and when we consider them together.
Multiplying the possibilities for each restriction, .
See also
1995 AHSME (Problems • Answer Key • Resources) | ||
Preceded by Problem 10 |
Followed by Problem 12 | |
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.