Categories
AIME I Algebra Arithmetic Combinatorics Math Olympiad USA Math Olympiad

Arrangement Problem | AIME I, 2012 | Question 3

Try this beautiful problem from the American Invitational Mathematics Examination, AIME, 2012 based on Arrangement. You may use sequential hints.

Try this beautiful problem from the American Invitational Mathematics Examination, AIME, 2012 based on Arrangement.

Arrangement – AIME 2012


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.

  • is 107
  • is 216
  • is 840
  • cannot be determined from the given information

Key Concepts


Arrangements

Algebra

Number Theory

Check the Answer


Answer: is 216.

AIME, 2012, Question 3

Combinatorics by Brualdi

Try with Hints


Here the number of ways to order the string BBBCCCFFF, such that one B is in first three positions

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.

Then \((3.2)^3={216}\)ways

Subscribe to Cheenta at Youtube


Leave a Reply

Your email address will not be published. Required fields are marked *