2017 AIME I Problem 7

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

Difficulty rating: 2650

7.

For nonnegative integers aa and bb with a+b6,a + b \le 6, let T(a,b)=(6a)(6b)(6a+b).T(a, b) = \binom{6}{a}\binom{6}{b}\binom{6}{a+b}. Let SS denote the sum of all T(a,b),T(a, b), where aa and bb are nonnegative integers with a+b6.a + b \le 6. Find the remainder when SS is divided by 1000.1000.

Solution:

By the symmetry (6a+b)=(66(a+b)),\binom{6}{a+b} = \binom{6}{6-(a+b)}, substituting c=6abc = 6 - a - b turns the sum into S=a+b+c=6(6a)(6b)(6c).S = \sum_{a+b+c=6} \binom{6}{a}\binom{6}{b}\binom{6}{c}.

Each term counts the ways to choose aa elements from one 66-element set, bb from a second, and cc from a third. Summed over all a+b+c=6,a + b + c = 6, this counts every way to choose 66 elements from the combined 1818-element set, so S=(186)=18564.S = \binom{18}{6} = 18564.

The remainder upon division by 10001000 is 564.564.

← Problem 6Full ExamProblem 8

Problem 7 in Other Years