Maths Olympiad Prep

Library / Junior Turkish Mathematical Olympiad /8 of 19

Junior Turkish Mathematical Olympiad

Number theory Difficulty 4.0 AIME Prove it Turkey

Determine the number of positive integers nn for which (n+15)(n+2010)(n + 15)(n + 2010) is a perfect square.

Solution

Let m2=n2+2025n+2010⋅15m^2 = n^2 + 2025n + 2010 \cdot 15 where mm is a positive integer. Then (2n+2m+2025)(2n−2m+2025)=19952(2n + 2m + 2025)(2n - 2m + 2025) = 1995^2. Hence n=(A+B−4050)/4n = (A + B - 4050)/4 and m=(A−B)/4m = (A - B)/4

where AA and BB are integers such that AB=19952AB = 1995^2, A>BA > B and A+B>4050A + B > 4050. Since 19952≡1(mod4)1995^2 \equiv 1 \pmod 4, these formulas always give integer values for mm and nn.
Let f(x)=x+19952xf(x) = x + \frac{1995^2}{x}. Then f(x2)−f(x1)=(x2−x1)(1−19952x1x2)>0f(x_2) - f(x_1) = (x_2 - x_1)\left(1 - \frac{1995^2}{x_1x_2}\right) > 0 for x2>x1>1995x_2 > x_1 > 1995.
The first divisor of 19952=32⋅52⋅72⋅1921995^2 = 3^2 \cdot 5^2 \cdot 7^2 \cdot 19^2 after 19951995 is A=2025=32⋅5⋅72A = 2025 = 3^2 \cdot 5 \cdot 7^2 for which f(A)>4050f(A) > 4050 fails. The next one A=2527=7⋅192A = 2527 = 7 \cdot 19^2 and hence all the greater divisors satisfy f(A)>4050f(A) > 4050. The answer is ((2+1)4−1)/2−1=39((2+1)^4 - 1)/2 - 1 = 39.

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

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