1986 AMC 12 Problem 17

Attempt Problem 17 of the 1986 AMC 12 below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 1986 AMC 12 solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

17.

A drawer in a darkened room contains 100100 red socks, 8080 green socks, 6060 blue socks and 4040 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 1010 pairs? (A pair of socks is two socks of the same color. No sock may be counted in more than one pair.)
2121
2323
2424
3030
5050
Answer: B
Concepts:pigeonhole principleparityworst case
Small hint:
For each color, at most one selected sock can remain unpaired
Big hint:
Use the parity of the total to sharpen the four-unpaired bound, then construct a near-miss
Solution:
With 2323 selected socks, the number of colors having an odd count must itself be odd, so it is at most 3.3. Thus at most 33 socks are unpaired, leaving at least 2020 socks in 1010 pairs. But 2222 socks do not suffice: color counts 7,5,5,57,5,5,5 produce only 3+2+2+2=93+2+2+2=9 pairs. Therefore the minimum is 23.23.
Thus the correct answer is B.
LIVE by Po-Shen Loh
Programs

LIVE Classes

Self-Paced Classes

Stars

Scholarship

About Us

Who Is Po-Shen Loh?

Email Contact

Newsletter

Jobs

Become a Star

For a more Thought Full world.

© 2026 Expii, Inc.