A set of square blocks is arranged into a square. How many different combinations of blocks can be selected from that set so that no two are in the same row or column?
- A)
- B)
- C)
- D)
- E)
Answer
C
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 of the rows. Leaving out rows is the same as choosing which to keep, and there are ways.
2. Which columns? Same count: ways.
3. Match them up. Say the rows are and the columns are . The block in row can use any of the columns, the block in row one of the left, and row gets the last one: ways.
4. Each set of three blocks comes from exactly one choice of rows, columns and matching, so multiply:
The answer is .
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 . The second must avoid the first one's row and column, leaving a grid: choices. The third avoids two rows and two columns, leaving . That gives , but each set of three blocks was counted once for every order you could pick them in, orders. So the answer is .
The trap
Picking blocks one after another (25, then 16, then 9) and forgetting that the order of picking does not matter, which gives 3600.
Concise solution
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 rows: ways.
- Choose the columns: ways.
- Assign each chosen row to a different chosen column: ways.
Every combination of blocks arises from exactly one such choice, so the count is
The answer is .
Review in the AoPS books
- Introduction to Counting & Probability, Chapter 1: Counting Is Arithmetic
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques (§2.5)
- Intermediate Counting & Probability, Chapter 4: Constructive Counting and 1-1 Correspondences (§4.4, §4.5, §4.6)
- Introduction to Counting & Probability, Chapter 3: Correcting for Overcounting (§3.2, §3.4)
Techniques
Map the objects to something easier to count · Set up the equation/formula and compute; no special trick needed