Olympiad Maths Prep

Library / /15 of 55

Number theory Difficulty 5.4 AIME, harder Prove it Ukraine

For which positive integers n2n \ge 2, there exist nn odd (not necessarily different) numbers a1,a2,,ana_1, a_2, \dots, a_n such that
a12+a22++an2a_1^2 + a_2^2 + \dots + a_n^2 is a square of some positive integer?

Solution

Clearly, square of an integer number can give a remainder of 00, 11 or 44 modulo 88. Therefore, only for nn of the form 8k+r8k + r, where r{0,1,4}r \in \{0, 1, 4\}, such numbers can exist. Let us show how they can be constructed.

n=4t, a1==an1=1, an=(2t1): n = 4t,\ a_1 = \dots = a_{n-1} = 1,\ a_n = (2t-1):
a12+a22++an2=(4t1)12+(2t1)2=(2t)2. a_1^2 + a_2^2 + \dots + a_n^2 = (4t-1) \cdot 1^2 + (2t-1)^2 = (2t)^2.

n=8t+1, a1==an1=1, an=(2t1): n = 8t + 1,\ a_1 = \dots = a_{n-1} = 1,\ a_n = (2t-1):
a12+a22++an2=(8t)12+(2t1)2=(2t+1)2. a_1^2 + a_2^2 + \dots + a_n^2 = (8t) \cdot 1^2 + (2t-1)^2 = (2t+1)^2.

Looking for a route rather than 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 and solution reproduced as published; topic and difficulty added by this site.