2008 AIME II Problem 8

Attempt Problem 8 of the 2008 AIME II 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 2008 AIME II solutions, or check the answer key.

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

8.

Let a=π2008.a = \frac{\pi}{2008}. Find the smallest positive integer nn such that 2[cos⁡(a)sin⁡(a)+cos⁡(4a)sin⁡(2a)+cos⁡(9a)sin⁡(3a)+⋯+cos⁡(n2a)sin⁡(na)] \begin{aligned} &2[\cos(a)\sin(a) + \cos(4a)\sin(2a) \\ &\quad {}+ \cos(9a)\sin(3a) \\ &\quad {}+ \cdots + \cos(n^2 a)\sin(na)] \end{aligned} is an integer.
Answer: 251
Concepts:trigonometric identitytelescopingdivisibility
Small hint:
Apply the product-to-sum identity to turn each term into a difference of two sine terms
Big hint:
The sum telescopes to sin⁡(n(n+1)a),\sin(n(n+1)a), which is an integer exactly when n(n+1)n(n+1) is a multiple of 10041004
Solution:
By the product-to-sum identity, 2cos⁡(k2a)sin⁡(ka)=sin⁡(k2a+ka)−sin⁡(k2a−ka)=sin⁡(k(k+1)a)−sin⁡((k−1)ka). \begin{aligned} &2\cos(k^2 a)\sin(ka) \\ &= \sin(k^2 a + ka) \\ &\quad {}- \sin(k^2 a - ka) \\ &= \sin(k(k+1)a) \\ &\quad {}- \sin((k-1)k a). \end{aligned} Summing over k=1k = 1 to n,n, the terms telescope, leaving sin⁡(n(n+1)a)=sin⁡n(n+1)π2008.\sin(n(n+1)a) = \sin\frac{n(n+1)\pi}{2008}.
A sine is an integer only when it is −1,-1, 0,0, or 1,1, that is, when its argument is a multiple of π2.\frac{\pi}{2}. So we need n(n+1)2008\frac{n(n+1)}{2008} to be a multiple of 12,\frac{1}{2}, i.e. n(n+1)n(n+1) is divisible by 1004,1004, where 1004=4⋅2511004 = 4 \cdot 251 and 251251 is prime.
Since nn and n+1n + 1 are coprime, 251251 must divide one of them, so n≥250.n \ge 250. For n=250n = 250 the product 250⋅251250 \cdot 251 is not divisible by 4.4. For n=251n = 251 the product 251⋅252251 \cdot 252 is divisible by 4⋅251=1004.4 \cdot 251 = 1004. The smallest such nn is 251.251.
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.