AMC 10 · 2016 · #20

Grade 7 algebra
combinations-basiccombinatorial-identity easier-related-problemconvert-to-algebra ↑ Prerequisites: combinations-basic
📏 Long solution 💡 4 insights
Problem
Expand (a+b+c+d+1)^N and combine like terms. Among all the combined terms, count only the ones that contain every one of a, b, c, d raised to a positive power. For the special value of N that makes this count exactly 1001, find N.

Pick an answer.

(A)
9
(B)
14
(C)
16
(D)
17
(E)
19

AMC 10 2016 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.

How to solve
Strategy Make a Systematic List

Each combined term is built by choosing one of the five pieces a,b,c,d,1 from each of the N factors, so a term is fully described by how many factors contributed each piece. Tool #4 (Introduce a Variable) names those five counts and turns 'count the terms' into 'count whole-number solutions of i+j+k+l+m=N.' Tool #9 (Solve an Easier Related Problem) removes the awkward 'each variable at least once' rule by subtracting one from each variable's count, leaving a clean all-nonnegative version. Tool #2 (Make a Systematic List), in its stars-and-bars form, counts those solutions in one shot as C(N, 4). Finally tool #6 (Guess and Check) finds the N with C(N, 4)=1001, helped by noticing 1001=7· 11· 13.

1STEP 1

Describe one qualifying term

Each factor donates one of a, b, c, d, 1, so a term is a^ib^jc^kd^l1^m where the five exponent counts add up to N.

a^ib^jc^kd^l1^m, i+j+k+l+m=N
2STEP 2

Turn the condition into an equation

A term qualifies only when i, j, k, l are each at least 1 (m may be 0), so the count equals the number of solutions of i+j+k+l+m=N.

i+j+k+l+m=N, i,j,k,l ≥ 1, m ≥ 0
3STEP 3

Strip out the 'at least one' rule

Give each of a, b, c, d its required 1 up front via i'=i-1, etc.; every variable is now 0 or more and the total drops to N-4.

i'+j'+k'+l'+m=N-4, i',j',k',l',m ≥ 0
4STEP 4

Count the solutions with stars and bars

With N-4 stars and 4 bars in a row, the bars split the stars into 5 groups; choosing which 4 of the N positions are bars gives C(N, 4).

C((N-4)+4, 4)=C(N, 4)
5STEP 5

Solve the count equation for N

We need C(N, 4)=1001. Since 1001=7· 11· 13, try N=14: C(14, 4)=(14· 13· 12· 11)/24=1001, and C(N, 4) only grows, so N=14.

C(14, 4)=(14· 13· 12· 11)/24=1001 → N=14=(B)
Answer
14
Check C(14, 4)=1001 directly: 14· 13· 12· 11=24024 and 24024/24=1001. Because C(N, 4) strictly increases with N, no other choice works: C(9, 4)=126 is far too small, while C(16, 4)=1820, C(17, 4)=2380, and C(19, 4)=3876 all overshoot 1001. So only N=14 gives exactly 1001 qualifying terms, confirming (B) and ruling out the other choices.
💡Key takeaway

Each term is just a tally of how many factors give each letter, so counting the terms turns into a stars-and-bars count of C(N, 4), and C(14, 4)=1001 gives N=14.

  • Describe one qualifying term
  • Turn the condition into an equation
  • Strip out the 'at least one' rule
  • Count the solutions with stars and bars
  • Solve the count equation for N