Hostname: page-component-cd9895bd7-fscjk Total loading time: 0 Render date: 2024-12-26T22:47:43.832Z Has data issue: false hasContentIssue false
  • English
  • Français

Calculus meets the birthday problem

Published online by Cambridge University Press:  14 March 2016

Dale K. Hathaway  and
Joshua Barks
Dale K. Hathaway
Affiliation:
Olivet Nazarene University, One University Avenue, Bourbonnais, IL 60914, USAe-mail:[email protected]
Joshua Barks
Affiliation:
Nestle USA, 2501 Beich Rd., Bloomington, IL 61705, USA e-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Extract

What is the likelihood P(n, T) that at least two people in a gathering of n people are born within a given time T of each other? In particular, for T = 24 hours what is the smallest n for which P(n, T) is at least 50%? The well-known classic version of the birthday problem asks for the smallest number of people needed to give a better than 50% chance of at least one birthday match with the assumptions that the birthdays are independently selected from a discrete uniform distribution over 365 days. Using the calculus tool of the limit, we refine two characterisations for P(n, T) and show that they give consistent results with each other and with the classic birthday problem as well. At first thought P(n, 24 hours) should answer the classic birthday question. Yet consider this experiment: suppose Andrea was born at noon on June 1, then potential matching birth times (for the other n - 1 people) with her birth time extend from noon on May 31 to noon on June 2, a period of 48 hours! What this period suggests is that P(n, 24hours) exceeds the classic answer. But, by how much? Read on.

Type
Research Article
Information
The Mathematical Gazette , Volume 100 , Issue 547 , March 2016 , pp. 86 - 92
Copyright
Copyright © Mathematical Association 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Naus, Joseph, An extension of the birthday problem, The American Statistician 22 1 (1968) pp. 27–29.Google Scholar
2.Abramson, Morton and Moser, W. O. J., More birthday surprises, Amer. Math. Monthly 77 8 (1970) pp. 856–858.CrossRefGoogle Scholar
3.Spencer, Neville, Celebrating the birthday problem, Mathematics Teacher 70 4 (1977) pp. 348–353.CrossRefGoogle Scholar
4.Schwarz, Wolf, Comparing continuous and discrete birthday coincidences: ‘same-day’ versus ‘within 24 hours’, The American Statistician 64 1 (2010) pp. 34–36.CrossRefGoogle Scholar
5.Mosteller, Frederick, Understanding the birthday problem, Mathematics Teacher 55 5 (1962) pp. 322–325.CrossRefGoogle Scholar
6.Hathaway, Dale K., A bonanza of birthday bewilderments, Math Horizons 7 (2001) pp. 13–16.CrossRefGoogle Scholar
7.Lawrence M., Lesser, Exploring the birthday problem with spreadsheets, Mathematics Teacher 92 5 (1999) pp. 407–411.Google Scholar
8.Alan, H.Rapoport, Birthday problems – a search for elementary solutions, Math. Gaz. 82 (March 1998) pp. 111–114.Google Scholar