AMC 10 · 2014 · #23

Grade 11 number-theory
modular-arithmeticcombinations-basictriangular-numberscombinatorial-identityprime-numbers easier-related-problempattern-recognition ↑ Prerequisites: modular-arithmeticcombinations-basic
📏 Long solution 💡 4 insights
Problem
Many binomial coefficients from one huge row are added and reduced by a prime. Find the remainder.

Pick an answer.

(A)
32
(B)
684
(C)
1024
(D)
1576
(E)
2016
How to solve
Strategy Solve an Easier Related Problem

C(2014, 62) has more than a hundred digits, so nothing can be computed head-on. The one exploitable fact is that 2014≡ -3 (mod 2017): the top of the binomial is a tiny negative number. Writing C(2014, k) as a product of k descending factors over k! (Tool #15) and replacing each factor by its residue turns every giant term into the tiny triangular number C(k+2, 2) with an alternating sign — a genuinely easier related problem (Tool #9). What is left is a 63-term alternating sum of triangular numbers, which splits into a lone first term plus 31 neighbouring pairs (Tool #7, Tool #16); each pair collapses to a single odd number by an exact algebraic identity, not by reading a pattern off a short list. Summing the resulting odd numbers (Tool #5) gives a number that must finally be checked to lie below 2017 before it can be called the remainder (Tool #3).

1STEP 1

Shrink the top index modulo 2017

The top index shrinks to something small.

2014-i ≡ -(3+i) (mod 2017), gcd(k!, 2017)=1 for 0 ≤ k ≤ 62
2STEP 2

Write the binomial as a descending product

The coefficient is a descending product.

C(2014, k) = (2014 · 2013…(2014-k+1))/k! = (Π_i=0^k-1(2014-i))/k!
3STEP 3

Collapse each term to a triangular number

Each term collapses to a triangular number.

C(2014, k) ≡ (-1)^k (k+1)(k+2)/2 = (-1)^kC(k+2, 2) (mod 2017), 0 ≤ k ≤ 62
4STEP 4

Rewrite the whole sum

The whole sum rewrites with alternating signs.

S ≡ Σ_k=0⁶²(-1)^kC(k+2, 2) = 1-3+6-10+…+2016 (mod 2017)
5STEP 5

Pair neighbours using an exact identity

Pairing neighbours leaves the odd numbers.

S ≡ 1 + Σ_j=1³¹[C(2j+2, 2)-C(2j+1, 2)] = 1 + Σ_j=1³¹(2j+1) = 1+3+5+…+63
6STEP 6

Add the odd numbers

They add to a perfect square, 1024.

1+3+5+…+63 = 16 · 64 = 32² = 1024
7STEP 7

Confirm this is the remainder

It is already in range, choice (C).

S ≡ 1024 (mod 2017), 0 ≤ 1024 < 2017 → r = 1024 = (C)
Answer
1024
Spot-check the key congruence on small k, where both sides can be computed. For k=1: C(2014, 1)=2014=2017-3≡ -3, and (-1)¹C(3, 2)=-3. For k=2: C(2014, 2)=(2014 · 2013)/2≡(-3)(-4)/2=6=C(4, 2). Now check the pairing formula against a short truncation done by hand: stopping at k=2 gives 1-3+6=4, and the Step 5 recipe gives 1+3=4; stopping at k=4 gives 1-3+6-10+15=9, and the recipe gives 1+3+5=9. Both match (m+1)² for a stop at k=2m, and k=62 is m=31, giving 32²=1024. Finally the answer is a plausible size: it sits inside [0,2017) as a remainder must, and it is not near 0 or 2016, so no massive cancellation was silently assumed.
💡Key takeaway

Because 2014 is only 3 below the prime 2017, every huge binomial shrinks to a small triangular number with an alternating sign, and pairing neighbours turns the whole sum into 1+3+5+…+63=32².

  • Shrink the top index modulo 2017
  • Write the binomial as a descending product
  • Collapse each term to a triangular number
  • Rewrite the whole sum
  • Pair neighbours using an exact identity
  • Add the odd numbers
  • Confirm this is the remainder