![]() |
Ivars Peterson's MathTrek |
The reason the number is as low as 23 is that you aren't looking for a specific match. It doesn't have to be two particular people or a given date. Any match involving any date or any two people is enough to create a coincidence. Indeed, there are 253 different pairings possible among 23 people, any of which could lead to a match.
So, in a typical classroom of 25 to 30 students, there's bound to be at least one pair of students with the same birthday. Indeed, it's an entertaining classroom exercise to check for such coincidences.
Here's an interesting variant of the birthday problem. Suppose the instructor asks each student in succession to call out his or her birthday. On average, how many students would need to do so before there's a match with someone else in the classroom?
Again, the answer can be surprisingly small. There's a 50-50 chance of getting a match after only seven students announce their birthdays in a class of 40 and after just three in a class of 86.
James E. Nymann of the University of Texas at El Paso provided a derivation of the relevant probabilities in an article in a 1975 issue of Mathematics Magazine. He determined the probability that, in a group of n people, at least one pair have the same birthday with at least one such pair among the first k people.
In the following table, n is the number of students and k(n) is the smallest value for which the probability of a match is greater than 50:50.
| n | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 31 | 33 | 36 | 40 | 46 | 54 | 66 | 86 | 128 | 254 |
| k(n) | 20 | 17 | 15 | 14 | 13 | 12 | 11 | 10 | 9 | 8 | 7 | 6 | 5 | 4 | 3 | 2 | 1 |
Copyright © 2005 by Ivars Peterson
References:
Alexanderson, G.L., and P. Ross. 2005. Twentieth-century gems from Mathematics Magazine. Mathematics Magazine 78(April):110-123.
Nymann, J.E. 1975. Another generalization of the birthday problem. Mathematics Magazine 48:46-47.
Peterson, I. 1998. Birthday surprises. MAA Online (Nov. 23).
You can learn more about the problem at http://mathworld.wolfram.com/BirthdayProblem.html (Wolfram Research) and http://www.studyworksonline.com/cda/content/explorations/0,,NAV2-76_SEP949,00.shtml (StudyWorks! Online).
Simulations of the birthday problem can be found at http://www-stat.stanford.edu/~susan/surprise/Birthday.html (Stanford University) and http://www.mste.uiuc.edu/java/java/birthday/birthday.html (University of Illinois at Urbana-Champaign).