Professional Documents
Culture Documents
Probability
Probability is the likelihood or chance of an event occurring.
𝑃𝑟𝑜𝑏𝑎𝑏𝑖𝑙𝑖𝑡𝑦 = 𝑡ℎ𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑤𝑎𝑦𝑠 𝑎𝑐ℎ𝑖𝑒𝑣𝑖𝑛𝑔 𝑠𝑢𝑐𝑐𝑒𝑠𝑠
𝑡ℎ𝑒 𝑡𝑜𝑡𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑝𝑜𝑠𝑠𝑖𝑏𝑙𝑒 𝑜𝑢𝑡𝑐𝑜𝑚𝑒𝑠
5
Terms
6
Basic Concepts of Probability
Now, suppose the event be the set of outcomes in which there are only two heads.
The outcomes in which we have only two heads are HHT, HTH and THH hence the event
is given by,
E = {HHT, HTH, THH}
We can clearly see that each element of set E is in set S, so E is a subset of S.
There can be more than one event. In this case, we can have an event as getting only
one tail or event of getting only one head. If we have more than one event we can
represent these events by E1, E2, E3 etc. We can have more than one event for a Sample
space but there will be one and only one Sample space for an Event.
If we have Events
E1, E2, E3, …… En as all the possible subset of sample space then we have,
S = E1 ∪ E2 ∪ E3 ∪ …….∪ En
So we have
Null space – is a subset of the sample space that contains no elements and is
denoted
by the symbol Ø. It is also called empty space.
Intersection of events
The intersection of two events A and B is denoted by the symbol A ∩ B. It is the
event containing all elements that are common to A and B.
For example,
Let A = {3,6,9,12,15} and B = {1,3,5,8,12,15,17}; then A ∩ B = {3,12,15}
Let X = {q, w, e, r, t,} and Y = {a, s, d, f}; then X ∩ Y = Ø, since X and Y have no
elements in common.
Intersection of two given sets is the largest set which contains all the
elements that are common to both the sets.
To find the intersection of two given sets A and B is a set which
consists of all the elements which are common to both A and B.
The symbol for denoting intersection of sets is ‘∩‘.
For example:
Let set A = {2, 3, 4, 5, 6}
and set B = {3, 5, 7, 9}
In this two sets, the elements 3 and 5 are common. The set
containing these common elements i.e., {3, 5} is the intersection of
set A and B.
The symbol used for the intersection of two sets is ‘∩‘.
Therefore, symbolically, we write intersection of the two sets A and B
is A ∩ B which means A intersection B.
Two events A and B are mutually exclusive, or disjoint, if A∩B = Ф, that is, if A and B
have no elements in common.
Union of Events
The union of events A and B is the event containing all the elements that belong
to A or to B or to both and is denoted by the symbol A ∪ B. The elements A ∪ B
maybe listed or defined by the rule A ∪ B = { x | x ε A or x ε B}.
For example,
Let A = {a,e,i,o,u} and B = {b,c,d,e,f}; then A ∪ B = {a,b,c,d,e,f,i,o,u}
Let X = {1,2,3,4} and Y = {3,4,5,6}; then A ∪ B = {1,2,3,4,5,6}
Example: Let P be the event that an employee selected at random from an oil drilling
company smokes cigarettes. Let Q be the event that the employee selected drinks alcoholic
beverages. Then the event PUQ is the set of all employees who either drink or smoke or do
both.
Compliment of an Event
The complement of an event A with respect to S is the set of all elements of S that
are not in A and is denoted by A’.
The shaded region in Figure 2.1 (e) shows (A ∩ C)’.
For example,
Consider the sample space S = {dog, cow, bird, snake, pig}
Let A = {dog, bird, pig}; then A’ = {cow, snake}
A B
1. Determine the following: 2
a)A U C 7 6
b) B’∩A 1
4 3
c) A∩B∩C
d) (AUB)∩C’
5
21
Counting Sample Points
Theorem 1 : If an operation can be performed in n1 ways, and if for each
of these ways a second operation can be performed in n2 ways, then the
two operations can be performed together in n1n2 ways.
Example: How many sample points are there in the sample space when a
pair of dice is thrown once? N1=6, n2=6 6(6) = 36 samples
Example: A developer of a new subdivision offers prospective home
buyers a choice of Tudor, Rustic, Colonial and Traditional exterior styling
in ranch, two-story, and split level floor plans. In how many different ways
can a buyer order one of these homes?
N1= 4, n2= 3 4(3) = 12 ways
Example: If a 22-member club needs to elect a chair and a treasurer,
how many different ways can these two to be elected?
N1 = 22, N2 = 21 22(21) = 462 ways
22 ©2017 Batangas State University
Counting Sample Points
Theorem 2: If an operation can be performed in n1 ways, and if for
each of these a second operation can be performed in n2 ways, and for
each of the first two a third operation can be performed in n3 ways,
and so forth, then the sequence of k operations can be performed in
n1n2...nk ways.
Example: Sam is going to assemble a computer by himself. He has
the choice of chips from two brands, a hard drive from four, memory
from three, and an accessory bundle from five local stores. How
many different ways can Sam order the parts? 2(4)(3)(5) = 120 ways
Example: A drug for the relief of asthma can be purchased from 5
different manufacturers in liquid, tablet, or capsule form, all of which
come in regular and extra strength. How many different ways can a
doctor prescribe the drug for a patient suffering from asthma?
23
5(3)(2) = 30 ways
©2017 Batangas State University
Counting Sample Points
Theorem 3: A permutation is an arrangement of
all or part of a set of objects. The number of
permutation of n objects is n!
A permutation is a word that describes the
number of ways things can be ordered or
arranged. With permutations, the order of the
arrangement matters.
25
Counting Sample Points
8!/3!(8-3)! = 56 WAYS
8C3 = 56 ways
P(Ф) = 0P(S) = 1