Try this beautiful problem from the American Invitational Mathematics Examination, AIME, 2012 based on Arrangement.
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.
Arrangements
Algebra
Number Theory
But try the problem first...
Answer: is 216.
AIME, 2012, Question 3
Combinatorics by Brualdi
First hint
Here the number of ways to order the string BBBCCCFFF, such that one B is in first three positions
Second Hint
one C is in 4th to 6th positions, and one F is for last three positions. There are (3)(3)(3)=27 ways for first 3. Then for next two, 2 ways.
Final Step
Then \((3.2)^3={216}\)ways
Math Olympiad Program... taught by Olympians and researchers