Answer:
=(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)
Answer:
$1968
Step-by-step explanation:
It will depreciate by 10% 4 times, which means that the result in the end will be <em>$3000 * (100% - 10%) * (100% - 10%) * (100% - 10%) * (100% - 10%)</em>, or, put simply, <em>x = $3000 * (0.9)⁴</em>.
Power: x = $3000 * 0.6561
Multiply: x = 1968.3 ≈ $1968
