2014 AMC 12B Problem 23

Attempt Problem 23 of the 2014 AMC 12B below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2014 AMC 12B solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

23.

The number 20172017 is prime. Let S=∑k=062(2014k).S = \sum_{k=0}^{62} \binom{2014}{k}. What is the remainder when SS is divided by 2017?2017?
3232
684684
10241024
15761576
20162016
Answer: C
Concepts:combinationsmodular arithmetictelescoping
Small hint:
Modulo 2017,2017, reduce (2014k)\binom{2014}{k} using 2016≡−1,2016 \equiv -1, 2015≡−2,2015 \equiv -2, and so on
Big hint:
This gives (2014k)≡(−1)k(k+22),\binom{2014}{k} \equiv (-1)^k \binom{k+2}{2}, and the alternating sum telescopes
Solution:
Working modulo 2017,2017, the identity (2014k)⋅k!⋅(2014−k)!=2014!\binom{2014}{k} \cdot k! \cdot (2014-k)! = 2014! together with 2016⋅2015⋯(2015−k)2016 \cdot 2015 \cdots (2015-k) ≡(−1)k(k+2)!\equiv (-1)^k (k+2)! leads to 2(2014k)≡(−1)k⋅(k+2)(k+1)(mod2017), \begin{gathered} 2\binom{2014}{k} \equiv (-1)^k \\ {}\cdot (k+2)(k+1) \pmod{2017}, \end{gathered} so (2014k)≡(−1)k(k+22).\binom{2014}{k} \equiv (-1)^k \binom{k+2}{2}.
Then S≡∑k=062(−1)k(k+22)=1+∑k=131[(2k+22)−(2k+12)]=1+∑k=131(2k+1). \begin{gathered} S \equiv \sum_{k=0}^{62} (-1)^k \binom{k+2}{2} \\ = 1 \\ {}+ \sum_{k=1}^{31}\left[\binom{2k+2}{2} - \binom{2k+1}{2}\right] \\ = 1 + \sum_{k=1}^{31}(2k+1). \end{gathered}
The remaining sum is 3+5+⋯+63=1023,3 + 5 + \cdots + 63 = 1023, so S≡1+1023S \equiv 1 + 1023 =1024(mod2017).= 1024 \pmod{2017}.
Thus, the correct answer is C.
LIVE by Po-Shen Loh
Programs

LIVE Classes

Self-Paced Classes

Stars

Scholarship

About Us

Who Is Po-Shen Loh?

Email Contact

Newsletter

Jobs

Become a Star

For a more Thought Full world.

© 2026 Expii, Inc.