Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
