Proof of a lattice paths conjecture connected to the tennis ball problem

We give a short history of the so-called tennis ball problem, and discuss its relation to lattice path enumeration. We also prove a conjecture related to a solution of the symmetric case, namely when the number of balls removed each turn is exactly half the number inserted.