There are
5
1
people in a room. What is the largest value of
n
such that the statement "At least
n
people in this room have birthdays falling in the same month" is always true?
Details and Assumptions
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.
Almost. You need to show that n ≥ 6 is impossible, but this is easy; just let five people each having birthdays in the first three months and four each for the rest.
I'm not agreeing with this. I'll explain why. I think the answer is 3, for this reason. There are 52 weeks in the year and we have 51 people. So we have 51 weeks, with each person born in a different week and one empty week (with no one born in that week). Those weeks are then divided into 12 months. At least one of those months will have 4 weeks (say February) and if the empty week is also in that month, then instead of 4 people born in that month, there will 3 people born in that month. (There are actually 53 full or partial weeks in a year, but I don't think the partial week (1 or 2 days) affects the solution.)
Log in to reply
@Jerry Kitich , the problem with your solution is you incorrectly assumed all birthdays are in different weeks. Nowhere in the question does it say this. There is nothing stopping the birthdays from being in the same week of the month, or the same day for that matter.
But i think that 4 must be the correct answer provided that there are at least 4 births in every month, and the statement says for which value of n is this always true. and 5 is not true for every month. If I am wrong, please forgive my lack of logic, and explain it for me, thanks beforehand.
The stipulation that the birthdays are random and independent is unnecessary.
Why did you take floor of 51/12?
Correlating to the pigeonhole principle, we have the people as pigeons and the months as pigeonholes.
12 months, 51 people. 12 x 4 = 48, so if birthdays are equally distributed, 4 people will have a birthday on each month. Since 51 > 48, each month will have at least 4 people with a birthday on it, but there will necessarily be a month with more than 4 people born on it. Since we need the largest value for 'n' and 'n' must be always true, let's assign a new person to each month; not every month will have 5 people having birthdays on it, but 3 other months will.
Simple that we should find maximum value in the minimum case: To get least people in same month, we should distribute equally, so n = 51/12 = 4 + 3/12, remain 3 peoples to distribute -> so in this case, we will get max 5 people in same month.
See also https://en.wikipedia.org/wiki/Pigeonhole_principle?wprov=sfla1
There will always be one month of the years with at least 5 anniversaries.
An almost even distribution would place 4 birthdays on 9 different months and 5 for the 3 others months.
Improbable but not impossible, all are born in the same month so the max would be 51.
Problem Loading...
Note Loading...
Set Loading...
The least number of birthdays in the same month is obtained when the birthdays are evenly distributed by month; that is, there are roughly the same number of birthdays each month. We can determine this smallest number using the Pigeonhole principle .
Note that 5 1 = 4 × 1 2 + 3 , so at bare minimum, there will always be 4 people with birthdays in the same month. There are still 3 people left over, though, and their birthdays must fall in some month of the year. So in reality, there must be at least ⌊ 1 2 5 1 ⌋ + 1 birthdays in at least 1 month.
Therefore the answer is n = 4 + 1 = 5