Problem:
Let v1,v2,…,vm be vectors in Rn, such that each has a strictly positive first coordinate. Consider the following process. Start with the zero vector w=(0,0,…,0)∈Rn. Every round, choose an i such that 1≤i≤m and w⋅vi≤0, and then replace w with w+vi.
Show that there exists a constant C such that regardless of your choice of i at each step, the process is guaranteed to terminate in C rounds. The constant C may depend on the vectors v1,…,vm.
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.