Maths Olympiad Prep

Track / Stage 4 / 215 of 340 #955 of 2444

Problem 955

AMC 12 late, AIME early
Number theory Difficulty 4.8 Find the answer HMMT February

Find the smallest positive integer nn such that 12+22+32+42++n21^{2}+2^{2}+3^{2}+4^{2}+\cdots+n^{2} is divisible by 100.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Next problem →

Official solution

The sum of the first nn squares equals n(n+1)(2n+1)/6n(n+1)(2 n+1) / 6, so we require n(n+1)(2n+1)n(n+1)(2 n+1) to be divisible by 600=2425600=24 \cdot 25. The three factors are pairwise relatively prime, so one of them must be divisible by 25 . The smallest nn for which this happens is n=12n=12 (2n+1=25)(2 n+1=25), but then we do not have enough factors of 2 . The next smallest is n=24(n+1=25)n=24(n+1=25), and this works, so 24 is the answer.

Source: Omni-MATH, licensed Apache-2.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.