2007 AIME I Problem 10

Below is the professionally curated solution for Problem 10 of the 2007 AIME I, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2007 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:arrangements with restrictionscombinationscasework

Difficulty rating: 2990

10.

In the 6×46 \times 4 grid shown, 1212 of the 2424 squares are to be shaded so that there are two shaded squares in each row and three shaded squares in each column. Let NN be the number of shadings with this property. Find the remainder when NN is divided by 1000.1000.

Solution:

Shade three of the six rows in column 1:1: (63)=20\binom{6}{3} = 20 ways. Let kk be the number of rows shaded in both columns 11 and 2;2; column 22 can then be chosen in (3k)(33k)\binom{3}{k}\binom{3}{3-k} ways. After these two columns, kk rows are complete with two shaded squares, 62k6 - 2k rows have one, and kk rows have none.

The empty rows must be shaded in both columns 33 and 4.4. Column 33 takes those kk rows plus 3k3 - k of the 62k6 - 2k singly-shaded rows, in (62k3k)\binom{6-2k}{3-k} ways, and column 44 is then forced: it must cover the empty rows and exactly the singly-shaded rows skipped by column 3.3.

Summing, N=20k=03(3k)(33k)(62k3k)=20(20+54+18+1)=1860,N = 20\sum_{k=0}^{3} \binom{3}{k}\binom{3}{3-k}\binom{6-2k}{3-k} = 20(20 + 54 + 18 + 1) = 1860, so the remainder is 860.860.

← Problem 9Full ExamProblem 11

Problem 10 in Other Years