Number theoryDifficulty 4.9AIMEProve itUnited States
Problem: Find the sum of all positive integers n such that 1+2+⋯+n divides 15[(n+1)2+(n+2)2+⋯+(2n)2].
Solution
Solution: Answer: 64 We can compute that 1+2+⋯+n=2n(n+1) and (n+1)2+(n+2)2+⋯+(2n)2=62n(2n+1)(4n+1)−6n(n+1)(2n+1)=6n(2n+1)(7n+1), so we need 3(n+1)15(2n+1)(7n+1)=n+15(2n+1)(7n+1) to be an integer. The remainder when (2n+1)(7n+1) is divided by (n+1) is 6, so after long division we need n+130 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
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.