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: 1234567901
/100000000000
Step-by-step explanation:
Convert the decimal number to a fraction by placing the decimal number over a power of ten. Since there are 11 numbers to the right of the decimal point, place the decimal number over 10
∧11
(
100000000000
)
. Next, add the whole number to the left of the decimal.
1234567901
/100000000000
Answer:
56 cm
Step-by-step explanation:
We need ro find the GCD of these numbers. In finding the GCD, we list the multiples of the number, beginning with the smallest number. Here, the
The factors of 616=2*2*2*7*11
The factors of 448 =2*2*2*2*2*2*7
Common factors in both are 2*2*2*7=56
Therefore, the greatest possible length is 56 cm
Answer:

Step-by-step explanation:
Given the differential model
![\dfrac{dP}{dt}=k[M-P(t)]](https://tex.z-dn.net/?f=%5Cdfrac%7BdP%7D%7Bdt%7D%3Dk%5BM-P%28t%29%5D)
We are required to solve the equation for P(t).


Answer:
-4g-3
------------
g+2
Step-by-step explanation:
g+1 5g+4
------------- - ------------------
g+2 g+2
Since the denominators are the same, subtract the numerators
g+1 - (5g+4)
Distribute the negative sign
g+1 -5g-4
-4g-3
Put this back over the denominator
-4g-3
------------
g+2