We study vectors of positive integers such that a finite number of positive linear combinations of their elements results in the sum
of the elements of the vector.
We find a family of vectors such that their sum can be obtained only
by one positive linear combination of their elements and we prove that
this family contains the vectors having minimal sum in function of the
number of their elements.
An open problem in number theory is answered.