Answer:
See below ~
Step-by-step explanation:
There are 4 possible solutions :
<u>m = 4</u>
<u>m = 5</u>
<u>m = 6</u>
<u>m = 7</u>
A path that uses each edge of a graph exactly once and ends at the starting vertex
Step-by-step explanation:
- Euler path - uses every edge of a graph exactly once
- Euler circuit - uses every edge of a graph exactly once
- Euler path - starts and ends at different vertices
- Euler circuit - starts and ends at the same vertex
Answer:
A and B are not independent events because P(A|B)≠P(A)
is the correct answer.
Step-by-step explanation:
If A and B are independent then we must have
P(AB) = P(A) P(B) and also
P(A/B) = P(A)
We are given that
A and B are two events.
Let P(A)=0.5 , P(B)=0.25 , and P(A and B)=0.15 .
P(A/B) = P(AB)/P(B) = 0.15/0.5 = 0.3
i.e. P(A/B) is not equal P(A)
Similarly P(B/A) = P(AB)/P(A) = 0.15/0.25 = 0.6 not equal to P(B)
Hence A and B are not independent.
Answer:
The total number of combinations in which the movies can be rented such that there is at least one documentary is 27589.
Step-by-step explanation:
The total movies are given as 19 mysteries +12 documentaries=19+12=31
Now the number of total combinations such that 4 movies are rented is given as 
Now the number of total combinations with no documentary is given as
So the number of combination such that at least one movie is documentary is given as
=Total Combinations-Combinations with no documentary
=31465-3876
=27589
So the total number of combinations in which the movies can be rented such that there is at least one documentary is 27589.
