Number theoryDifficulty 4.8AIMEProve itUnited States
Problem: Find the largest positive integer n such that 1+2+3+⋯+n2 is divisible by 1+2+3+⋯+n.
Solution
Solution: The statement is 2n(n+1)∣2n2(n2+1)⇔n+1∣n(n2+1)=n3+n. But n+1 also divides (n+1)(n2−n+2)=n3+n+2, so n+1 must divide 2. Hence, n cannot be greater than 1. And n=1 clearly works, so that is the answer.
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.