Question

In: Statistics and Probability

We have n people and K floors: what is the chance that 1)all people get off...

We have n people and K floors: what is the chance that 1)all people get off in the smae floor? 2)at least one in evey floor?3)P( floor 3 is empty)?4)p(2 people get out in the first floor and 3 people or mpre get off in the second floor)

Solutions

Expert Solution

Answer 1: All people get off on the same floor:

Probability of choosing any single floor = 1/k

Since there are n people so Required probability = KC1 x (1/k)^n

2) Atleast one get on each floor = 1-(one floor is empty + 2 floors are empty .....k floors are empty)

= 1- (Kc1 x (1-1/k)^n + Kc2 x (1- 1/k)^n.............+Kck x (1-1/k)^n)

= 1- (1-1/k)^n X ((2^k)) ( 1 + 1

= ( k^n - ((k-1)^n X (2^k )))/ k^n

Answer 3: Floor 3 is empty = Kc1 x Q^n ( Q= 1- P = 1- 1/k )

= Kc1 x (1-1/k)^n

Answer 4: p(2 people get out in the first floor and 3 people or more get off in the second floor)=

p(2 people get out in the first floor) x p(3 people or mpre get off in the second floor)

p(2 people get out in the first floor)= Kc1 x (1/k)^2

p(3 people or more get off in the second floor)= K-1c1 x ((1/k-1)^3 + (1/k-1)^4.................+ (1/k-1)^n-2 )

   =K-1c1 x ( 1- ( (1/k-1)^1 + (1/k-1)^2 )

Therefore, p(2 people get out in the first floor) x p(3 people or mpre get off in the second floor)=

Kc1 x (1/k)^2 x K-1c1 x ( 1- ( (1/k-1)^1 + (1/k-1)^2 )

  


Related Solutions

A group of n people get on an elevator at Floor 0. There are m floors...
A group of n people get on an elevator at Floor 0. There are m floors besides Floor 0. Each person uniformly randomly chooses one of those m floors to stop at. (All choices are independent, and no one gets on the elevator after Floor 0.) The elevator stops at a floor if at least one person has chosen to stop there. Let X be the number of stops that the elevator makes after Floor 0. (a) What is E[X]?...
Given an array A[1..n], with distinct values and k with 1 ≤ k ≤ n. We...
Given an array A[1..n], with distinct values and k with 1 ≤ k ≤ n. We want to return the k smallest element of A[1.....n], in non-decreasing order. For example: A = [5, 4, 6, 2, 10] and k = 4, the algorithm returns [2, 4, 5, 6]. There are at least the following four approaches: a. heapify A and then extract k elements one by one b. sort the array (e.g. using MergeSort or HeapSort) and then read the...
Let S_k(n) = 1^k + 2^k + ··· + n^k for n, k ≥ 1. Then,...
Let S_k(n) = 1^k + 2^k + ··· + n^k for n, k ≥ 1. Then, S_4(n) is given by S_4(n)= n(n+1)(2n+1)(3n^2 +3n−1)/ 30 Prove by mathematical induction.
At central hospital, there is a 27% chance that a patient will get an infection. We...
At central hospital, there is a 27% chance that a patient will get an infection. We take a random sample of 25 patients. Find the following probabilities. (round all answers to 4 decimal places) a. What is the probability that 3 or fewer of the patients will get an infection? b. Find the probability that more than 10 of the patients will get an infection. c. How likely is it that less than 6 would get an infection? d. Compute...
What are all the values of k for which the series [(k^3+2)*(e^-k)]^n converges from n=0 to...
What are all the values of k for which the series [(k^3+2)*(e^-k)]^n converges from n=0 to n=infinity?
1. prove s(n, k) = s(n − 1, k − 1) − (n − 1)s(n −...
1. prove s(n, k) = s(n − 1, k − 1) − (n − 1)s(n − 1, k). 2. What is ∑n k=0 s(n, k)?
We have all heard the saying, "You have one chance to make a good first impression"....
We have all heard the saying, "You have one chance to make a good first impression". If we were going to analyze this in social psychology terms, what would we say? What is the source of most of your knowledge about impression management? Minimum 300 words...thanks!
Suppose that n guests all have an identical key to get into a conference, which is...
Suppose that n guests all have an identical key to get into a conference, which is given to the front desk of the venue. As they are leaving, the keys are given back in a random order. What is the probability that no guest gets back their original key?
4. Here is a fact about permutations: (**) nPk = n!/(n-k)!, for all k € ≤...
4. Here is a fact about permutations: (**) nPk = n!/(n-k)!, for all k € ≤ n. Let’s prove this via mathematical induction for the fixed case k=3. (i) Write clearly the statement (**) we wish to prove. Be sure your statement includes the phrase “for all n” . (ii) State explicitly the assumption in (**) we will thus automatically make about k=2. (iii) Now recall that to prove by induction means to show that If mPk = m!/(m-k)! is...
What are the significance of bandstructure (E-k) plots? Which information we can get from E-k plots...
What are the significance of bandstructure (E-k) plots? Which information we can get from E-k plots (obtained from DFT analyses) for materials? Please explain in details with some relevant diagrams or plots.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT