Maths Olympiad Prep

Track / Stage 3 / 156 of 260 #156 of 1964

Problem 156

AMC 10/12, early questions
Number theory Difficulty 3.5 Multiple choice

Let SS be the set of all numbers which are the sum of the squares of three consecutive integers. Then we can say that
$\text{

Pick one

Official solution

Consider 33 consecutive integers a,b,a, b, and cc. Exactly one of these integers must be divisible by 3; WLOG, suppose aa is divisible by 3. Then a0(mod3),b1(mod3),a \equiv 0 \pmod {3}, b \equiv 1 \pmod{3}, and c2(mod3)c \equiv 2 \pmod{3}. Squaring, we have that a20(mod3),b21(mod3),a^{2} \equiv 0 \pmod{3}, b^{2} \equiv 1 \pmod{3}, and c21(mod3)c^{2} \equiv 1 \pmod{3}, so a2+b2+c22(mod3)a^{2} + b^{2} + c^{2} \equiv 2 \pmod{3}. Therefore, no member of SS is divisible by 3.
Now consider 33 more consecutive integers a,b,a, b, and cc, which we will consider mod 11. We will assign kk such that ak(mod11),bk+1(mod11),a \equiv k \pmod{11}, b \equiv k + 1 \pmod{11}, and ck+2(mod11)c \equiv k + 2 \pmod{11}. Some experimentation shows that when k=4,a4(mod11)k = 4, a \equiv 4 \pmod{11} so a25(mod11)a^{2} \equiv 5 \pmod{11}. Similarly, b5(mod11)b \equiv 5 \pmod{11} so b23(mod11)b^{2} \equiv 3 \pmod{11}, and c6(mod11)c \equiv 6 \pmod{11} so c23(mod11)c^{2} \equiv 3 \pmod{11}. Therefore, a2+b2+c20(mod11)a^{2} + b^{2} + c^{2} \equiv 0 \pmod{11}, so there is at least one member of SS which is divisible by 11. Thus, B\fbox{B} is correct.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.