People are arriving at a party one at a time. while waiting for more people to arrive they entertain themselves by comparing their birthdays. let x be the number of people needed to obtain a birthday match, i. e., before person x arrives there are no two people with the same birthday, but when person x arrives there is a match. find the pmf of x.

=(k−1)*P(X>k−1) or (k−1)365k(365k−1)(k−1)!

Step-by-step explanation:

First of all, we need to find PMF

Let X = k represent the case in which there is no birthday match within (k-1) people

However, there is a birthday match when kth person arrives

Hence, there is 365^k possibilities in birthday arrangements

Supposing (k-1) dates are placed on specific days in a year

Pick one of k-1 of them & make it the date of the kth person that arrives, then:

The CDF is P(X≤k)=(1−(365k)k)/!365k, so the can obtain the PMF by  

P(X=k) =P (X≤k) − P(X≤k−1)=(1−(365k)k!/365^k)−(1−(365k−1)(k−1)!/365^(k−1))=

(k−1)/365^k * (365k−1) * (k−1)!

=(k−1)*(1−P(X≤k−1))

=(k−1)*P(X>k−1)

definitely a. the others have almost all data points on one side of the line.

step-by-step explanation:

after 1 year: 221 deer

step-by-step explanation:

30% of 170 is 51. 170+51=221