Since the sum of all probabilities of all all elementary events will always be equal to 1. Furthermore, the probabilities of all mutually exclusive set of events that is part of the entire sample space will always be total of 1.
So in the problem, the answer is 1/8.
1/8 for red + 3/8 for green + 3/8 for yellow + 1/8 for blue = 8/8 or 1.
Denise is constructing A square.
Note: A square has all sides equal.
We already given two vertices M and N of the square.
And another edge of the square is made by from N.
Because a square has all sides of equal length, the side NO should also be equal to MN side of the square.
Therefore, <em>Denise need to place the point of the compass on point N and draw an arc that intersects N O, using MN as the width for the opening of the compass. That would make the NO equals MN.</em>
Therefore, correct option is :
D) place the point of the compass on point N and draw an arc that intersects N O, using MN as the width for the opening of the compass.
Answer: 0.05
Step-by-step explanation:
Let M = Event of getting an A in Marketing class.
S = Event of getting an A in Spanish class,
i.e. P(M) = 0.80 , P(S) = 0.60 and P(M∩S)=0.45
Required probability = P(neither M nor S)
= P(M'∩S')
= P(M∪S)' [∵P(A'∩B')=P(A∪B)']
=1- P(M∪S) [∵P(A')=1-P(A)]
= 1- (P(M)+P(S)- P(M∩S)) [∵P(A∪B)=P(A)+P(B)-P(A∩B)]
= 1- (0.80+0.60-0.45)
= 1- 0.95
= 0.05
hence, the probability that Helen does not get an A in either class= 0.05
Answer:
56 number of ways
Step-by-step explanation:
This question is a combination question since it involves selection.
Generally, if r objects are to be selected from n pool of objects, this can be done in nCr number of ways.
nCr = n!/(n-r)!r!
If a manager receives 8 applications for a specific position and wants to narrow it down to 5, the number of ways he can do this is 8C5
8C5 = 8!/(8-5)!5!
= 8!/3!5!
= 8*7*6*5!/3*2*5!
= 8*7*6/3*2
= 8*7
= 56 number of ways.
This means that the manager can rank 5 applications in 56 number of ways