Difference between revisions of "1986 AHSME Problems/Problem 17"
m (→Problem) |
Mathisfun04 (talk | contribs) (→Solution) |
||
| Line 13: | Line 13: | ||
==Solution== | ==Solution== | ||
| − | + | {{solution}} | |
== See also == | == See also == | ||
Revision as of 19:26, 21 December 2016
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
This problem needs a solution. If you have a solution for it, please help us out by adding it.
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. 
