Problem:
On a board the following six vectors are written:
Given two vectors and on the board, a move consists of erasing and and replacing them with and . After some number of moves, the sum of the six vectors on the board is . Find, with proof, the maximum possible length of .
, 2022
Solution
Solution:
For a construction, note that one can change
and similarly for and . Then .
For the bound, argue as follows: let the vectors be , be any unit vector, and , where the sum is over all vectors on the board. We claim that is invariant. Indeed, we have
Also, at the beginning we have . Therefore we must always have . Thus, by the Cauchy-Schwarz inequality we have
But since is arbitrary, this implies that ; otherwise we could pick 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.