AMC 10 Step by Step

2007 AMC 10B Problem 20

P16-20~3 minPrint

A set of 2525 square blocks is arranged into a 5×55 \times 5 square. How many different combinations of 33 blocks can be selected from that set so that no two are in the same row or column?

Log in to save your progress.
Show solution without answering

Key insight

Choose which 3 rows (10 ways) and which 3 columns (10 ways) the blocks use, then decide which row goes with which column (6 ways): 10 times 10 times 6.

Solution

Three blocks with no two in the same row or column use three different rows and three different columns. So build a choice in three stages.

1. Which rows? Pick 33 of the 55 rows. Leaving out 22 rows is the same as choosing which 33 to keep, and there are 5×42=10\frac{5 \times 4}{2} = 10 ways.
2. Which columns? Same count: 1010 ways.
3. Match them up. Say the rows are r1,r2,r3r_1, r_2, r_3 and the columns are c1,c2,c3c_1, c_2, c_3. The block in row r1r_1 can use any of the 33 columns, the block in row r2r_2 one of the 22 left, and row r3r_3 gets the last one: 3×2×1=63 \times 2 \times 1 = 6 ways.
4. Each set of three blocks comes from exactly one choice of rows, columns and matching, so multiply:
10×10×6=600.10 \times 10 \times 6 = 600.

The answer is (C) 600\boxed{\textbf{(C)}\ 600}.

Why this works

This is like placing three rooks on a chessboard so none attack each other. Splitting the choice into "which rows and columns" and "how they pair up" counts each set of blocks once, so no dividing is needed at the end.

Alternative approach

Pick the blocks one at a time. The first can be any of 2525. The second must avoid the first one's row and column, leaving a 4×44 \times 4 grid: 1616 choices. The third avoids two rows and two columns, leaving 3×3=93 \times 3 = 9. That gives 25×16×9=360025 \times 16 \times 9 = 3600, but each set of three blocks was counted once for every order you could pick them in, 3×2×1=63 \times 2 \times 1 = 6 orders. So the answer is 3600÷6=6003600 \div 6 = 600.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

A valid set of three blocks uses three distinct rows and three distinct columns, and the set is determined by which rows, which columns, and how they are paired up.

  • Choose the 33 rows: (53)=10\binom{5}{3} = 10 ways.
  • Choose the 33 columns: (53)=10\binom{5}{3} = 10 ways.
  • Assign each chosen row to a different chosen column: 3!=63! = 6 ways.

Every combination of blocks arises from exactly one such choice, so the count is
10⋅10⋅6=600.10 \cdot 10 \cdot 6 = 600.

The answer is (C) 600\boxed{\textbf{(C)}\ 600}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.