Birthday problem. Develop a class with appropriate static methods for studying the birthday problem (see EXERCISE 1.4.38).
EXERCISE 1.4.38
Birthday problem. Suppose that people enter an empty room until a pair of people share a birthday. On average, how many people will have to enter before there is a match? Run experiments to estimate the value of this quantity. Assume birthdays to be uniform random integers between 0 and 364.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.