Birthday Combinatorics
What is the smallest possible integer value of such that in any group of persons, there are always at least 10 persons who have the same birthdays?
Assume that there are exactly 365 different possible birthdays/
The answer is 1648.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
Relevant wiki: Pigeonhole Principle
By Pigeonhole Principle, 2 n − 1 0 = 3 6 5 × 9 + 1
Simplifying yields n = 1 6 4 8