Find the smallest positive integer n such that 12+22+32+42+⋯+n2 is divisible by 100.
A number or a short expression. Spacing and $ signs are ignored.
Solution
The sum of the first n squares equals n(n+1)(2n+1)/6, so we require n(n+1)(2n+1) to be divisible by 600=24⋅25. The three factors are pairwise relatively prime, so one of them must be divisible by 25 . The smallest n for which this happens is n=12(2n+1=25), but then we do not have enough factors of 2 . The next smallest is n=24(n+1=25), and this works, so 24 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: Omni-MATH,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.