Maths Olympiad Prep

Library / /854 of 860

Algebra Difficulty 6.0 AIME, harder Find the answer

On a board the following six vectors are written: (1,0,0),(1,0,0),(0,1,0),(0,1,0),(0,0,1),(0,0,1)(1,0,0), \quad(-1,0,0), \quad(0,1,0), \quad(0,-1,0), \quad(0,0,1), \quad(0,0,-1). Given two vectors vv and ww on the board, a move consists of erasing vv and ww and replacing them with 12(v+w)\frac{1}{\sqrt{2}}(v+w) and 12(vw)\frac{1}{\sqrt{2}}(v-w). After some number of moves, the sum of the six vectors on the board is uu. Find, with proof, the maximum possible length of uu.

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

Solution

For a construction, note that one can change (1,0,0),(1,0,0)(2,0,0),(0,0,0)(1,0,0),(1,0,0)(1,0,0),(-1,0,0) \rightarrow(\sqrt{2}, 0,0),(0,0,0) \rightarrow(1,0,0),(1,0,0) and similarly for (0,1,0),(0,1,0)(0,1,0),(0,-1,0) and (0,0,1),(0,0,1)(0,0,1),(0,0,-1). Then u=(2,2,2)u=(2,2,2). For the bound, argue as follows: let the vectors be v1,,v6,n=(x,y,z)v_{1}, \ldots, v_{6}, n=(x, y, z) be any unit vector, and S=i(nvi)2S=\sum_{i}\left(n \cdot v_{i}\right)^{2}, where the sum is over all vectors on the board. We claim that SS is invariant. Indeed, we have (n12(v+w))2+(n12(vw))2=(nv+nw2)2+(nvnw2)2=2(nv)2+2(nw)22=(nv)2+(nw)2\left(n \cdot \frac{1}{\sqrt{2}}(v+w)\right)^{2}+\left(n \cdot \frac{1}{\sqrt{2}}(v-w)\right)^{2} =\left(\frac{n \cdot v+n \cdot w}{\sqrt{2}}\right)^{2}+\left(\frac{n \cdot v-n \cdot w}{\sqrt{2}}\right)^{2} =\frac{2(n \cdot v)^{2}+2(n \cdot w)^{2}}{2} =(n \cdot v)^{2}+(n \cdot w)^{2}. Also, at the beginning we have S=2x2+2y2+2z2=2S=2x^{2}+2y^{2}+2z^{2}=2. Therefore we must always have S=2S=2. Thus, by the Cauchy-Schwarz inequality we have nu=nvii(nvi)26=12=23n \cdot u=\sum n \cdot v_{i} \leq \sqrt{\sum_{i}\left(n \cdot v_{i}\right)^{2}} \sqrt{6}=\sqrt{12}=2\sqrt{3}. But since nn is arbitrary, this implies that u23|u| \leq 2\sqrt{3}; otherwise we could pick n=u/un=u /|u| and reach a contradiction.

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.