Maths Olympiad Prep

Library / /245 of 740

, 2018

Number theory Difficulty 4.9 AIME Prove it United States

Problem:
Find the sum of all positive integers nn such that 1+2++n1+2+\cdots+n divides
15[(n+1)2+(n+2)2++(2n)2]. 15\left[(n+1)^2+(n+2)^2+\cdots+(2 n)^2\right] .

Solution

Solution:
Answer: 64
We can compute that 1+2++n=n(n+1)21+2+\cdots+n=\frac{n(n+1)}{2} and (n+1)2+(n+2)2++(2n)2=2n(2n+1)(4n+1)6n(n+1)(2n+1)6=n(2n+1)(7n+1)6(n+1)^2+(n+2)^2+\cdots+(2 n)^2=\frac{2 n(2 n+1)(4 n+1)}{6}-\frac{n(n+1)(2 n+1)}{6}=\frac{n(2 n+1)(7 n+1)}{6}, so we need 15(2n+1)(7n+1)3(n+1)=5(2n+1)(7n+1)n+1\frac{15(2 n+1)(7 n+1)}{3(n+1)}=\frac{5(2 n+1)(7 n+1)}{n+1} to be an integer. The remainder when (2n+1)(7n+1)(2 n+1)(7 n+1) is divided by (n+1)(n+1) is 6, so after long division we need 30n+1\frac{30}{n+1} to be an integer. The solutions are one less than a divisor of 30 so the answer is
1+2+4+5+9+14+29=64 1+2+4+5+9+14+29=64

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.