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

Let me Join!
Dismiss

Harvard-MIT Mathematics Tournament #0irl

Harvard-MIT Mathematics TournamentHard

From module Chinese Remainder Theorem

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.
TrigonometryCartesian coordinatesRecurrence relationsFermat / Euler / Wilson theoremsChinese remainder theorem

Problem

Problem: Let C\mathcal{C} be the hyperbola y2−x2=1y^{2}-x^{2}=1. Given a point P0P_{0} on the xx-axis, we construct a sequence of points (Pn)\left(P_{n}\right) on the xx-axis in the following manner: let ℓn\ell_{n} be the line with slope 1 passing through PnP_{n}, then Pn+1P_{n+1} is the orthogonal projection of the point of intersection of ℓn\ell_{n} and C\mathcal{C} onto the xx-axis. (If Pn=0P_{n}=0, then the sequence simply terminates.) Let NN be the number of starting positions P0P_{0} on the xx-axis such that P0=P2008P_{0}=P_{2008}. Determine the remainder of NN when divided by 2008.

← Back to all problems