Professional Documents
Culture Documents
Introduction to
Probability
Denoted by Denoted by
S∪𝑇 S∩𝑇
S ∪ 𝑇 = 𝑥 𝑥 ∈ 𝑆 or 𝑥 ∈ 𝑇 } S ∩ 𝑇 = 𝑥 𝑥 ∈ 𝑆 and 𝑥 ∈ 𝑇 }
(𝑆 𝑐 )𝑐 = 𝑆 S ∪ (𝑇 ∩ 𝑈) = (𝑆 ∪ 𝑇) ∩ (𝑆 ∪ 𝑈)
𝑆∪Ω=Ω 𝑆 ∩ 𝑆𝑐 = ∅
S ∩ (𝑇 ∪ 𝑈) = (𝑆 ∩ 𝑇) ∪ (𝑆 ∩ 𝑈) 𝑆∩Ω=𝑆
S1 Business Mathematics – Maria Zefanya S (2017) ©
Applying Set Theory
to Probability
Mutually Exclusive Sets
𝐴1 ∪ 𝐴2 ∪ … ∪ 𝐴𝑛 = 𝑆
𝑨𝟑 𝑨𝟒
Answer
(i) The outcome of the vote can be denoted as (x, 1000−x), where x is the number of votes for Yolanda, and
1000 − x is the number of votes for Zach. Then the sample space of all voting outcomes is
Ω = {(0, 1000), (1, 999), (2, 998), . . . , (999, 1), (1000, 0)}.
(ii) Let A be the event that Yolanda beats Zach by at least 100 votes. The event A consists of all outcomes in
which x − (1000 − x) ≥ 100, or 550 ≤ x ≤ 1000.
That is, A = {(550, 450), (551, 449), . . . , (999, 1), (1000, 0)}.
Equality The events occurs whenever event E occurs but event F does not
Intersection The occurrence of event E implies the occurrence of event F, and vice versa
Union Event when E occurs, F also occurs (all of the sample point of E are contained in F)
Complement The event occurs whenever at least one of event E and F occurs
Difference The event occurs whenever event E and event F occur simultaneously
Equality 𝐸𝑐 E F
Intersection E − F
Union E ∩ F
Complement E ⊆F
Difference E ∪ F
Union E ∩ F
Union E ∩ F
Equality 𝐸𝑐 E F
Intersection E − F
Union E ∩ F
Equality 𝐸𝑐 E F
Intersection E − F
Union E ∩ F
Equality 𝐸𝑐 F
Intersection E − F 𝐹𝑐
Union E ∩ F
Equality 𝐸𝑐 F
Intersection E − F E
Union E ∩ F