There are 365 days in a year. Consider a set S of 2000 people. For each day d ∈ {1, ..., 365}, let nd denote the number of people in S whose birthday lies on day d. Let d∗ denote the day such that nd∗ is maximized, over all possible days (i.e., it’s the day that is the birthday of the largest number of people in S).
What is the minimum possible value for d∗? Justify your answer.
