Expand your knowledge base with the help of IDNLearn.com's extensive answer archive. Ask your questions and receive accurate, in-depth answers from our knowledgeable community members.
Sagot :
Answer:
a) 0.000016 = 0.0016% probability of selecting and finding that all three bags are overweight.
b) 0.729 = 72.9% probability of selecting and finding that all three bags are satisfactory
Step-by-step explanation:
The condition of the bags in the sample is independent of the other bags, which means that the binomial probability distribution is used to solve this question.
Binomial probability distribution
The binomial probability is the probability of exactly x successes on n repeated trials, and X can only have two outcomes.
[tex]P(X = x) = C_{n,x}.p^{x}.(1-p)^{n-x}[/tex]
In which [tex]C_{n,x}[/tex] is the number of different combinations of x objects from a set of n elements, given by the following formula.
[tex]C_{n,x} = \frac{n!}{x!(n-x)!}[/tex]
And p is the probability of X happening.
a) What is the probability of selecting and finding that all three bags are overweight?
2.5% are overweight, which means that [tex]p = 0.025[/tex]
3 bags means that [tex]n = 3[/tex]
This probability is P(X = 3). So
[tex]P(X = x) = C_{n,x}.p^{x}.(1-p)^{n-x}[/tex]
[tex]P(X = 3) = C_{3,3}.(0.025)^{3}.(0.975)^{0} = 0.000016[/tex]
0.000016 = 0.0016% probability of selecting and finding that all three bags are overweight.
b) What is the probability of selecting and finding that all three bags are satisfactory?
90% are satisfactory, which means that [tex]p = 0.9[/tex]
3 bags means that [tex]n = 3[/tex]
This probability is P(X = 3). So
[tex]P(X = x) = C_{n,x}.p^{x}.(1-p)^{n-x}[/tex]
[tex]P(X = 3) = C_{3,3}.(0.9)^{3}.(0.1)^{0} = 0.729[/tex]
0.729 = 72.9% probability of selecting and finding that all three bags are satisfactory
Your participation is crucial to us. Keep sharing your knowledge and experiences. Let's create a learning environment that is both enjoyable and beneficial. IDNLearn.com provides the best answers to your questions. Thank you for visiting, and come back soon for more helpful information.
