Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A coin is tossed three times. Let be the event "at least two heads", and let be the event "the first toss is a head". List and as sets of strings. Find the number of outcomes in , in and in . Then find how many outcomes belong to exactly one of and , and how many belong to neither.
Use , and . For three events add the three singles, take away the three pairs and add the triple. De Morgan: .
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. The sets. and .
Step 2. The overlap. , so .
Step 3. The union. . The union is .
Step 4. The difference. , so .
Step 5. Exactly one and neither. Exactly one means or . The set is , so . Neither is : , and .
Answer: , , , and outcomes.
Log in to join the discussion.
Loading…