Celebration of Scholars
The Problem with Baseball Hats
Name:
Micole Gauvin
Major: Mathematics and Elementary Education
Hometown: Beloit, WI
Faculty Sponsor:
Mark Snavely
Other Sponsors:
Type of research: Senior thesis
Abstract
A young baseball player stacks n baseball hats by each door to his home. Each time he leaves the house to go practice, he grabs a hat from the stack by the door he exits; when he returns to his home after practice, he leaves his hat on the stack by the door he enters. In our problem we consider how many times, on average, the baseball player will go out to practice and back into his house before the stack of baseball hats by the door he exits runs out. We begin with an examination of two doors starting with n hats by each to determine a formula that calculates how many cycles the boy will run through before he goes to grab a hat as he leaves the house, but instead finds an empty stack. We will then broaden our focus, as we start to consider the implications other nuances/alterations might bring to the problem, looking at what happens when we add an additional door, evaluate the variance surrounding our average, introduce the probability that the boy could lose a hat (or come back with extra!) and etc. Thus we will see the problem with baseball hats as we seek to find the solution to this mathematical problem—though perhaps not quite the solution an actual baseball player (or his mom) might want.