Maths Olympiad Prep

Library / /1 of 2

Algebra Difficulty 6.5 National Olympiad Prove it United States

Problem:
Find a positive integer NN and a1,a2,,aNa_{1}, a_{2}, \ldots, a_{N}, where ak=1a_{k}=1 or ak=1a_{k}=-1 for each k=1,2,,Nk=1,2, \ldots, N, such that
a113+a223+a333++aNN3=20162016, a_{1} \cdot 1^{3}+a_{2} \cdot 2^{3}+a_{3} \cdot 3^{3}+\cdots+a_{N} \cdot N^{3}=20162016,
or show that this is impossible.

Solution

Solution:
It is possible, as long as the sum SS desired is a multiple of 4848, with N=S/6N = S / 6, which in this case is 33603363360336, and the aka_{k} repeats the 8-term pattern 1,1,1,1,1,1,1,1-1, 1, 1, -1, 1, -1, -1, 1.

Use the observation that if f(x)f(x) is a degree-kk polynomial, then for any constant hh, the difference f(x+h)f(x)f(x+h)-f(x) will be a degree-(k1)(k-1) polynomial. If we iterate this process three times, we can find a way to manipulate consecutive cubes to always get a constant.

More precisely, let
c0,c1,c2,c3,c4,c5,c6,c7, c_{0}, c_{1}, c_{2}, c_{3}, c_{4}, c_{5}, c_{6}, c_{7}, \ldots
be consecutive cubes. In other words, cm=(m+u)3c_{m} = (m+u)^{3} for some fixed starting integer uu. Then the differences
c1c0,c3c2,c5c4,c7c6, c_{1}-c_{0}, \quad c_{3}-c_{2}, \quad c_{5}-c_{4}, \quad c_{7}-c_{6}, \ldots
will be quadratic functions; i.e., if we define am:=cm+1cma_{m} := c_{m+1} - c_{m}, then ama_{m} is a quadratic function of mm (depending on the parameter uu, as well), and the differences are a0,a2,a4,a6,a_{0}, a_{2}, a_{4}, a_{6}, \ldots Continuing, we see that the differences
a2a0,a6a4, a_{2}-a_{0}, \quad a_{6}-a_{4}, \ldots
will be a linear sequence; i.e., bm:=am+2amb_{m} := a_{m+2} - a_{m} is a linear function of mm (with parameter uu), and our differences are b0,b4,b_{0}, b_{4}, \ldots Finally, the sequence
b4b0,b12b8, b_{4}-b_{0}, \quad b_{12}-b_{8}, \ldots
is constant, no matter what the parameter uu equals! We have
b4b0=a6a4(a2a0)=a6a4a2+a0=c7c6c5+c4c3+c2+c1c0, b_{4}-b_{0} = a_{6}-a_{4} - (a_{2}-a_{0}) = a_{6}-a_{4}-a_{2}+a_{0} = c_{7}-c_{6}-c_{5}+c_{4}-c_{3}+c_{2}+c_{1}-c_{0},
and since this is constant, we can compute it using any value of uu. Taking u=3u = -3, the constant must equal
433322+1303+(1)3+(2)3(3)3=48. 4^{3}-3^{3}-2^{2}+1^{3}-0^{3}+(-1)^{3}+(-2)^{3}-(-3)^{3}=48.
In other words, if we define
su:=u3+(u+1)3+(u+2)3(u+3)3+(u+4)3(u+5)3(u+6)3+(u+7)3, s_{u} := -u^{3} + (u+1)^{3} + (u+2)^{3} - (u+3)^{3} + (u+4)^{3} - (u+5)^{3} - (u+6)^{3} + (u+7)^{3},
then su=48s_{u} = 48 for all values of uu.

Since 20162016=4200424820162016 = 420042 \cdot 48, we can easily write 2016201620162016 as a sum of 420042420042 8-element sum/differences of 4200428=3360336420042 \cdot 8 = 3360336 consecutive cubes:
20162016=k=0420041s8k+1= 13+23+3343+536373+8393+103+113123+133143143+15333603293+33603303+33603353+33603363. \begin{aligned} 20162016 = \sum_{k=0}^{420041} s_{8k+1} = &\ -1^{3} + 2^{3} + 3^{3} - 4^{3} + 5^{3} - 6^{3} - 7^{3} + 8^{3} \\ & -9^{3} + 10^{3} + 11^{3} - 12^{3} + 13^{3} - 14^{3} - 14^{3} + 15^{3} \\ & \cdots \\ & -3360329^{3} + 3360330^{3} + \cdots -3360335^{3} + 3360336^{3}. \end{aligned}

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.