Join the USAMO Guide Discord Server. Regular updates are posted there!

Let me Join!
Dismiss

Harvard-MIT Mathematics Tournament #0iod

Harvard-MIT Mathematics TournamentHard

From module Roots of Unity (Advanced)

Community difficultyNo ratings yetBe the first to rate this problem.
Understand the scale
Scale 0.5: Easiest math competition problems, often solvable even for early middle school students without experience. 1: Problems strictly for beginners, often at a moderate middle school level. 1.5: Problems for stronger beginner students, on the level of the middling problems in most middle school contests. 2: For motivated beginners, harder questions from the previous categories. 2.5: More advanced beginner problems, hardest questions from previous categories. 3: Early intermediate problems that require more creative thinking. 3.5: Tougher early intermediate problems that consistently stretch into higher-level creative thinking or conceptual knowledge. 4: Intermediate-level problems. 4.5: Upper intermediate problems approaching the upper bound for non-invitational sprint math competitions. 5: More difficult AIME problems or simple proof-based Olympiad-style problems. 6: High-level AIME-styled questions or introductory Olympiad-level questions. 7: Tougher Olympiad-level questions, may require more technical knowledge. 8: High-level Olympiad-level questions. 9: Expert Olympiad-level questions. 9.5: The hardest problems appearing on Olympiads which the strongest students could reasonably solve. 10: Historically notorious problems, generally unsuitable for even very hard competitions because they are exceedingly tedious, long, and difficult.
Roots of unityPolynomial operations

Problem

Problem: Suppose that ω\omega is a primitive 2007th2007^{\text{th}} root of unity. Find (22007−1)∑j=1200612−ωj\left(2^{2007}-1\right) \sum_{j=1}^{2006} \frac{1}{2-\omega^{j}}.

For this problem only, you may express your answer in the form m⋅nk+pm \cdot n^{k}+p, where m,n,km, n, k, and pp are positive integers. Note that a number zz is a primitive nthn^{\text{th}} root of unity if zn=1z^{n}=1 and nn is the smallest number amongst k=1,2,…,nk=1,2, \ldots, n such that zk=1z^{k}=1.

← Back to all problems