Maths Olympiad Prep

Library / /155 of 377

Number theory Difficulty 5.0 AIME, harder Prove it United States

Problem:

For a positive integer nn, let θ(n)\theta(n) denote the number of integers 0x<20100 \leq x < 2010 such that x2nx^{2} - n is divisible by 20102010. Determine the remainder when n=02009nθ(n)\sum_{n=0}^{2009} n \cdot \theta(n) is divided by 20102010.

Solution

Solution:

Answer: 335335

Let us consider the sum n=02009nθ(n)(mod2010)\sum_{n=0}^{2009} n \cdot \theta(n) \pmod{2010} in another way. Consider the sum 02+12+22++20092(mod2010)0^{2} + 1^{2} + 2^{2} + \cdots + 2009^{2} \pmod{2010}. For each 0n<20100 \leq n < 2010, in the latter sum, the term nn appears θ(n)\theta(n) times, so the sum is congruent to n=02009nθ(n)\sum_{n=0}^{2009} n \cdot \theta(n). In other words,
n=02009nθ(n)=n=02009n2=(2009)(2009+1)(22009+1)6(1)20106(1)=335(mod2010) \sum_{n=0}^{2009} n \cdot \theta(n) = \sum_{n=0}^{2009} n^{2} = \frac{(2009)(2009+1)(2 \cdot 2009+1)}{6} \equiv (-1) \cdot \frac{2010}{6} \cdot (-1) = 335 \pmod{2010}

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.