You want to find the minimal m such that, given the sequence

,

covers all residues mod k (where k is the number of bottles). This is equivalent to saying that covers all residues mod k (via shifting by 1).

But...we have a problem. If k = 3, is always congruent to 0 or 1 mod 3. Thoughts?