Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

counting and probability senior

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
Suppose that you wish to draw one pair of socks from the drawer. Then you would pick socks (one of each kind, plus one). Notice that in the worst possible situation, you will continue to draw the same sock, until you get pairs. This is because drawing the same sock results in a pair every of that sock, whereas drawing another sock creates another pair. Thus the answer is .
Final answer
23