Let $n$ be a positive integer and $s>0$ a real number. Must there exist positive real numbers $x_1,x_2,\dots,x_n<s$ such that no nontrivial linear combination of $x_1,x_2,\dots,x_n$ (with rational coefficients) is an integer?
This should be possible by taking the $x_i$'s to be "independent" irrational numbers. But I'm not sure how to prove it formally or what theorem to use.
Assuming the linear combinations you allow have rationals (or integers) multiplying the $x$s there are independent sets. Start with $x_1$ being some irrational. There are only countably many linear combinations of $x_1$, so pick $x_2$ to be some irrational that is not equal to any of them. Now there are only countably many linear combinations of $x_1,x_2$, so pick $x_3$ to be some irrational not equal to any of them. As there are uncountably many irrationals less than $s$ you can find one. Keep going. You can allow the list of $x$s to be countably infinite and the argument still holds.