Prove that sum of 2010 vectors is $\neq 0$ if these vector create a set with lengths numbers $\{1,2,\ldots,2010\}$

Question

A set $V$ has 2010-vectors: $V=\{v_{1}, \ldots,v_{2010}\}$ and these vectors create another set with the lengths of these vectors: $B=\{1,2,\ldots,2010\}$. Each vector is parallel to one of $2$ given concurrent lines (see picture). Prove that the sum of these vectors is${}\neq 0$ regardless of their directions.

For me this is strange. Why are those two concurrent lines given ?

Thanks for help :) I will try to do solve this problem even if it is strange.

Answer 1

My interpretation: The two given lines give us two unit vectors $\vec{u}$ and $\vec{v}$ that are not parallel (i.e. linearly independent). Then the constraints are that for all $n$ the vector $\vec{w}_n$ of length $n$, $n=1,2,\ldots,2010,$ has to be one of the four possibilities: $n\vec{u}$, $-n\vec{u}$, $n\vec{v}$ or $-n\vec{v}$.

Hint (assuming that I correctly guessed what the question is about): The sum of the lengths is an odd number.

Spoiler solution:

Let the starting point of the first vector be $P$, and place the vectors after each other as in the usual vector addition. The end points of all the vectors will lie at some point of the form $P_{k,\ell}=P+ k\vec{u}+\ell\vec{v}$. Color the point $P_{k,\ell}$ black, if $k+\ell$ is even and color it white, if $k+\ell$ is odd - i.e. chessboard style. Because the sum $1+2+3+\cdots+2010=1005\cdot2011$ is an odd number, after all the vectors have been placed, the last one ends at a white point. Therefore it cannot end at $P$.