Engineering Data Analysis
Engineering Data Analysis
Engineering Data Analysis
• P [A ∩ B) = P [occurrence of both A and B], Note: The multiplication rule for the occurrence
the intersection of events A and B. of both A and B together when they are not
independent is the product of the probability of
• P [A ∪ B) = P [occurrence of A or B or both], the one event and the conditional probability of the
union of the two events A and B. other:
P [A ∩ B] = P [A] × P [B | A] = P [B] × P [A | B]
•If two events being considered, A and B, are
not mutually exclusive, and so there may be the Lesson 3: Permutation and Combination
overlap between them, the Addition Rule
becomes P (A ∪ B) = P (A) + P (B) – P (A ∩ B) Permutation - is an arrangement of all or part
of a set of objects. The number of
If three events A, B, and C are not mutually permutations is the number of different
exclusive: arrangements in which items can be placed.
P (A ∪ B ∪ C) = P (A) + P (B) + P (C) – P (A ∩ B) – P Notice that if the order of the items is
(A ∩ C) – P (B ∩ C) + P (A ∩ B ∩ C) changed, the arrangement is different, so we have
a different permutation. In permutations, the
2. MULTIPLICATION RULE order is important!
(a) The basic idea for calculating the number • Rule1. The number of permutations of n
of ways can be described as follows: If an objects is n!
operation can be performed in n1 ways and if
for each of these ways a second operation can • Rule2. The number of permutations of n distinct
be performed in n₂ ways, then the two objects taken r at a time is nPr = n! / (n − r)!
operations can be performed together in n₁n₂
ways. • Rule3. If n items are arranged in a circle,
the arrangement doesn’t change if every item
Note: For more than two operations: If an is moved by one place to the left or the right.
operation can be performed in n₁ ways, and if Therefore in this situation, one item can be placed
for each of these a second operation can be at random, and all the other items are placed
performed in n₂ ways, and for each of the first concerning the first item. The number of
two a third operation can be performed in n₃ permutations of n objects arranged in a circle is (n
ways, and so forth, then the sequence of k − 1)!
operations can be performed in n₁n₂ ··· nk ways.
• Rule4. The number of distinct permutations of
(b) The simplest form of the Multiplication Rule n things of which n1 are of one kind, n2of a
for probabilities is as follows: If the events are second kind, ... , nk of a kth kind is
independent, then the occurrence of one
event does not affect the probability of
occurrence of another event. In that case, the
probability of occurrence of more than one event
together is the product of the probabilities of the
separate events. (This is consistent with the basic
idea of counting stated above.) If A and B are two
separate events that are independent of one Combinations - are similar to permutations, but
another, the probability of occurrence of both A with the important difference that
and B together is given by P [A ∩ B] = P [A] × P [B] combinations take no account of order. Thus,
AB and BA are different permutations but the
(c) If the events are not independent, one same combination of letters. Then the number
event affects the probability of the other of permutations must be larger than the
event. In this case, conditional probability must number of combinations, and the ratio
between them must be the number of ways
the chosen items can be arranged.
In general, the number of combinations of n
items taken r at a time is