Combinatorial Probability Exercises
Uploaded by
gby014752Combinatorial Probability Exercises
Uploaded by
gby014752Common questions
Powered by AIStirling’s formula, n! ≈ √(2πn)(n/e)^n, helps approximate large factorials. In the coin toss, the probability follows a binomial distribution B(26,0.5), while for cards, it follows a hypergeometric distribution. Stirling's approximation shows that the card's distribution leads to a higher probability due since combinatorial constraints reduce variability compared to independent events in coin tosses .
The probability that no two people share the same birthday is given by the formula 365/365 × 364/365 × ... × (365-n+1)/365. To find the n where the probability that at least two people share a birthday exceeds 1/2, solve 1 - [365!/(365^n * (365-n)!)] > 1/2. Experimentally, n = 23 satisfies this condition .
Apply Bayes' Theorem: Let A be the event of having the disease, and B be a positive test result. P(A|B) = P(B|A)P(A) / P(B). P(B|A) = 0.95, P(A) = 0.005, and P(B) = P(B|A)P(A) + P(B|¬A)P(¬A) = 0.95(0.005) + 0.01(0.995). This results in P(A|B) ≈ 0.32 .
The inclusion-exclusion principle accounts for overlapping cases among potential key arrangements, allowing accurate calculation of at least one key on the correct hook by summing probabilities of each individual correct placement and subtracting probabilities for overlaps of these placements, ensuring all cases where keys are correctly placed are considered .
For each of Celia's 100 feet, she must put on a sock before she puts on a shoe, which can be done in 2 distinct ways for each foot. Hence, for all 100 feet, the total number of ways is 2^100 .
The probability that at least one person shares your birthday is given by 1 - (364/365)^n, where n is the number of people. Solving for n ≥ 1/2 gives n ≈ 253 to ensure crossing the 1/2 threshold of probability for this scenario .
The probability that the second ball is red given the first is blue is given by (m/n+m-1), as withdrawing a blue ball first changes the total count and color composition for the second draw .
The expression for pn(0), the probability that no key is on its correct hook, is given by the number of derangements D_n out of n keys, which can be computed using D_n = n! [Σ(−1)^k/k! for k = 0 to n]. This results in pn(0) = D_n/n! = (1-1/1!+1/2!-1/3!+...+(-1)^n/n!).
The probability can be computed using the multinomial coefficient to count the ways to arrange these results, given by (9 choose 3, 2, 2, 1, 1, 0) = 9!/(3! * 2! * 2! * 1! * 1! * 0!) = 2520. The probability is then this number divided by the total possible outcomes of 6^9, giving a probability of 2520/10,077,696 ≈ 0.00025 .
There are 11! ways to order the letters of ABSTEMIOUSLY since it consists of 11 distinct letters. To count the arrangements where A and B are always together, treat them as a single unit. This reduces the problem to arranging 10 units, yielding 10! arrangements. Since A and B can be arranged in 2! ways within their unit, the total number of arrangements is 10! * 2! = 725,760 .