A (probably) exact solution to the Birthday Problem
Article
First Online:
Received:
Accepted:
- 330 Downloads
- 4 Citations
Abstract
Given a year with n≥1 days, the Birthday Problem asks for the minimal number Open image in new window
such that in a class of Open image in new window
students, the probability of finding two students with the same birthday is at least 50 percent. We derive heuristically an exact formula for Open image in new window
and argue that the probability that a counter-example to this formula exists is less than one in 45 billion. We then give a new derivation of the asymptotic expansion of Ramanujan’s Q-function and note its curious resemblance to the formula for Open image in new window
.
Keywords
Birthday Problem Ramanujan’s Q-function Asymptotic analysisMathematics Subject Classification (2000)
41A60 60C05 65D10Preview
Unable to display preview. Download preview PDF.
References
- 1.Ahmed, S.E., McIntosh, R.J.: An asymptotic approximation for the birthday problem. Crux Math. 26, 151–155 (2000) Google Scholar
- 2.Berndt, B.C., Rankin, R.A. (eds.): Ramanujan: Essays and Surveys. American Mathematical Society, Providence (2001) MATHGoogle Scholar
- 3.Bernoulli, J.: Ars Conjectandi. Basel (1713). Translation: Wahrscheinlichkeitsrechnung. Verlag von Wilhelm Engelmann, Leipzig (1899) Google Scholar
- 4.Davenport, H.: The Higher Arithmetic, 8th edn. Cambridge University Press, Cambridge (2008) MATHGoogle Scholar
- 5.de Bruijn, N.G.: Asymptotic Methods in Analysis, 3rd edn. Dover, New York (1970) Google Scholar
- 6.Dilcher, K.: Asymptotic behaviour of Bernoulli, Euler, and generalized Bernoulli polynomials. J. Approx. Theory 49, 321–330 (1987) MathSciNetMATHCrossRefGoogle Scholar
- 7.Flajolet, P., Grabner, P.J., Kirschenhofer, P., Prodinger, H.: On Ramanujan’s Q-function. J. Comput. Appl. Math. 58, 103–116 (1995) MathSciNetMATHCrossRefGoogle Scholar
- 8.Gamow, G.: One, Two, Three… Infinity. Viking, New York (1947) Google Scholar
- 9.Graham, R., Knuth, D.E., Patashnik, O.: Concrete Mathematics, 2nd edn. Addison-Wesley, Reading (1994) MATHGoogle Scholar
- 10.Halmos, P.R.: I Want to Be a Mathematician. Springer, New York (1985) CrossRefGoogle Scholar
- 11.Holmes, S.: Random Birthday Applet. Available electronically at http://www-stat.stanford.edu/~susan/surprise/Birthday.html
- 12.Katz, V.J.: A History of Mathematics. Harper Collins, New York (1993) MATHGoogle Scholar
- 13.Knuth, D.E.: The Art of Computer Programming, vol. I, 2nd. edn. Addison-Wesley, Reading (1973) Google Scholar
- 14.Kubina, J.M., Wunderlich, M.C.: Extending Waring’s conjecture to 471,600,000. Math. Comp. 55, 815–820 (1990) MathSciNetMATHGoogle Scholar
- 15.Kuipers, L., Niederreiter, H.: Uniform Distribution of Sequences. Wiley, New York (1974) MATHGoogle Scholar
- 16.Littlewood, J.E.: A Mathematician’s Miscellany. Methuen, London (1953) MATHGoogle Scholar
- 17.Mathis, F.H.: A generalized birthday problem. SIAM Review 33, 265–270 (1991) MathSciNetMATHCrossRefGoogle Scholar
- 18.Ramanujan, S.: Question 294. J. Indian Math. Soc. 3, 128 (1911) Google Scholar
- 19.Ramanujan, S.: On Question 294. J. Indian Math. Soc. 4, 151–152 (1912) Google Scholar
- 20.Singmaster, D.: Sources in Recreational Mathematics. Published electronically at www.g4g4.com/MyCD5/SOURCES/SOURCE4.DOC
- 21.Sloane, N.J.E.: On-Line Encyclopedia of Integer Sequences. Published electronically at http://oeis.org/
- 22.Tsaban, B.: Bernoulli numbers and the probability of a birthday surprise. Discrete Appl. Math. 127, 657–663 (2003) MathSciNetMATHCrossRefGoogle Scholar
- 23.van der Corput, J.G.: Diophantische Ungleichungen. I. Zur Gleichverteilung modulo Eins. Acta. Math. 56, 373–456 (1931) MathSciNetCrossRefGoogle Scholar
- 24.von Mises, R.: Ueber Aufteilungs- und Besetzungs-Wahrscheinlichkeiten. Rev. Fac. Sci. Univ. Istanbul 4, 145–163 (1939) Google Scholar
Copyright information
© Springer Science+Business Media, LLC 2012