2012 AIME I Problem 3

Below is the professionally curated solution for Problem 3 of the 2012 AIME I, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2012 AIME I solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:derangementscasework

Difficulty rating: 2400

3.

Nine people sit down for dinner where there are three choices of meals. Three people order the beef meal, three order the chicken meal, and three order the fish meal. The waiter serves the nine meals in random order. Find the number of ways in which the waiter could serve the meal types to the nine people so that exactly one person receives the type of meal ordered by that person.

Solution:

Choose the one person served correctly (99 ways); by symmetry say they ordered beef. The remaining meals — 22 beef, 33 chicken, and 33 fish — must go to the other 88 people (22 beef, 33 chicken, and 33 fish orderers) with nobody matched. Track where the 22 leftover beef meals go: to chicken or fish orderers.

If both go to the same group, say to two of the three chicken orderers (3+3=63 + 3 = 6 ways counting both groups), then the third chicken orderer must receive fish, the three fish orderers must take the three chicken meals, and the two beef orderers take the remaining fish: everything is forced. If one goes to a chicken orderer and one to a fish orderer (33=93 \cdot 3 = 9 ways), the other two chicken orderers must take fish and the other two fish orderers must take chicken, leaving one chicken and one fish meal to split between the two beef orderers (22 ways).

The total is 9(6+92)=216.9\,(6 + 9 \cdot 2) = 216.

← Problem 2Full ExamProblem 4

Problem 3 in Other Years