Difference between revisions of "1986 AHSME Problems/Problem 17"
m |
m (→Problem) |
||
Line 9: | Line 9: | ||
\textbf{(B)}\ 23\qquad | \textbf{(B)}\ 23\qquad | ||
\textbf{(C)}\ 24\qquad | \textbf{(C)}\ 24\qquad | ||
− | \textbf{(D)}\ 30\qquad</math> | + | \textbf{(D)}\ 30\qquad |
+ | \textbf{(E)}\ 50 </math> | ||
==Solution== | ==Solution== |
Revision as of 02:37, 24 October 2014
Problem
A drawer in a darkened room contains red socks, green socks, blue socks and black socks. A youngster selects socks one at a time from the drawer but is unable to see the color of the socks drawn. What is the smallest number of socks that must be selected to guarantee that the selection contains at least pairs? (A pair of socks is two socks of the same color. No sock may be counted in more than one pair.)
Solution
See also
1986 AHSME (Problems • Answer Key • Resources) | ||
Preceded by Problem 16 |
Followed by Problem 18 | |
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.