Chapter 5 Permutations and Combinations

Manuel S.
Enverga University Foundation, Lucena City College of Engineering

An Autonomous University
Permutations and
Combinations
MATH 123A
SYNCHRONOUS LECTURE
College of Engineering
Manuel S. Enverga University Foundation, Lucena City College of Engineering
LEARNING OUTCOMES
At the end of this lesson, the students are expected to:
• State and illustrate the principle of counting;
• Diagram the computations involving the principles of
counting;
• Apply the principle of counting in various area of problem
solving;
• Define and illustrate permutations;
• Apply permutations in various situational conditions;
• State and illustrate the circular permutations;
• Define combination and relate it from permutation;
• State, illustrate, and apply the formula in combination in
various applications.
Engineering Data Analysis
Measures of Dispersion and Skewness
5.1 Principle of Counting

In the study of statistics, we deal with
two kinds of problems,
§ the first is the problem of listing
everything that can be happen in a given
situation
§ second is that of determining how many
different things can happen without
actually making a complete list.

Permutations and Combinations
Example: Principle of Counting

In a class of 20, the number of ways of selecting
a president, vice president, secretary and treasurer.
President – 20 ways (all students can be a president)

Vice President – 19 ways (19 students left, one already elected as Pres.)
Secretary – 18 ways (18 students left, two students are elected as Pres. and V. Pres)
Treasurer – 17 ways (17 students left, three students are elected as Pres., V. Pres, and Sec.)
20 X 19 X 18 X 17 = 116, 280 ways


A burger machine offers a serving of soup, sandwich
and beverage. There are 2 kinds of soup (asparagus or
corn), 4 sandwiches (chicken, ham, mushroom, or tuna)
and 5 beverages (coffee, tea, milk, coke, or orange) to
choose from. Then the number of possible combinations is
Soup – 2 ways
Sandwiches – 4 ways
Beverages – 5 ways
2 x 4 x 5 = 40 ways

If an experiment consists of throwing a die and then
drawing a letter from the alphabet, how many points
are in the sample space?
Die – 6 points (1, 2, 3, 4, 5, 6)

Letters – 26 points (a, b, c, d, e, f, g, h, I, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z)
6 x 26 = 156 points

Generalization of Principle of Counting

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 together in n1 n2 …nk ways.

Example: Generalization of Principle of

Counting
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?
Manufacturer = n1 = 5 ways
Drug Forms = n2 = 3 ways
Drug Strength = n3 = 2 ways
= n1 x n2 x n3
5 x 3 x 2 = 30 ways

Counting
In how many different ways can a true-false test
consisting of 10 questions be answered?
Question 1 = n1 = 2 ways (true and false) 2 = n6 = 2 ways (true and false)
3 = n2 = 2 ways (true and false) 4 = n7 = 2 ways (true and false)
n1 x n2 x n3 x n4 x n5 x n6 x n7 x n8 x n9 x n10 or = n!
2x2x2x2x2x2x2x2x2x2 or = 2"#
= 1,024 ways = 1,024 ways

Counting
How many dinners consisting of a soup, viands,
dessert and a drink are possible if we can select from
4 soups, 10 viands, 5 desserts and 4 kinds of drinks?
n1 = 4 Soup
n2 = 10 Viands
n3 = 5 Desserts
n4 = 4 Drinks
n1 x n2 x n3 x n4 = 4 x 10 x 5 x 4
= 800 different ways to choose a dinner.

5.2 Permutations
It is an arrangement of a group of things in a
definite order, that is, there is a first element, a
second, a third, etc. In other words, the order or
arrangement of the elements is important.
For example, the letters A, B, and C have the
following possible arrangements or permutations:
ABC ACB BAC BCA CAB CBA

Different Types of Permutations

1. ARRANGEMENT OF n OBJECT TAKEN n AT A TIME
The number of permutations of n distinct
objects is n!
Formula:
nPn = n! = n(n - 1) (n - 2) (n - 3)…(n - k)

Example: Arrangement of n object

taken n at a time
In how many ways can 5 CIE Examinees be lined
up to go inside the testing centers?
nPn = n! = n(n - 1) (n - 2) (n – 3)(n - 4)

P = 5! = (5) (5 – 1) (5 – 2) (5 – 3) (5 – 4)
5 5
=5x4x3x2x1
=120 ways


taken n at a time
In how many ways can four dating reviewees be
seated in the review center without restriction?
8P 8 = 8! = (8) (8 – 1) (8 – 2) (8 – 3) (8 – 4) (8 – 5) (8 – 6) (8 – 7)
=8x7x6x5x4x3x2x1
= 40,320 ways


2. ARRANGEMENT OF n OBJECT TAKEN r AT A TIME
The number of permutations of n distinct objects
taken r at a time. It is the type of permutation of
determining the number of arrangements by taking a
sample ( r ) out of a given population ( n ).
Formula:
!!
nPr =
! #$ !


taken r at a time
In “Tawag ng Tanghalan” contest, the 10 finalists
consists of 4 males and 6 females. Find the number of
sample points for the number of possible orders at
the conclusion of the contest for the first three
positions.
!! %&!
10P3 = =
! #$ ! %& #' !
%& ( ) ( * ( +!
=
+!
= 720 ways

taken r at a time
A basketball team consists of 14 players at a time.
In how many ways can 5 starting positions be filled if
all of them can play any of the positions?
!! %,!
14P5 = =
! #$ ! %, #- !
%, ( %' ( %. ( %% ( %& ( )!
=
)!
= 240, 240 ways


3. ARRANGEMENT OF N OBJECT SOME ARE ALIKE
The number of distinct permutations of n things of
which n1 is of one kind, n2 of a second kind,…, nk of a
k!" kind is
Formula:
n!
(!" !) ( (!# !) ( (!$ !) ( …(!% !)


some are alike
In a TIKTOK training camp, the coach needs to have 8 tiktokers
standing in a row. Among these tiktokers, 1 is from Bulacan, 2 is
from Laguna, 2 is from Batangas, and 3 is from NCR. How many
different ways can they be arranged in a row if only their place of
origins will be distinguished?
%!
= &! ' (! ' (! ' )!
% ' * ' + ' , ' - ' )!

= & ' ( ' & ' ( ' & ' )!
+,*(/
=
-
= 1,680 arrangements

some are alike
A school plays 10 basketball games in the PRISAA
per season. In how many ways can the MSEUF
Wildcats end their season with 6 wins and 4 losses?
&/!
=
+! ' -!
&/ ' 0 ' % ' * ' +!

=
+! ' - ' ) ' ( ' &
,,/-/
=
(-
= 210 ways

4. CIRCULAR PERMUTATIONS
Permutations that occur by arranging objects in a
circle. To find the number of ways of arranging n
different objects in a circle, we first fix or select a
position for one of the objects.
Formula:
(n - 1)!

Example: Circular Permutations

In how many ways can 6 students be seated in a
round dining table?
= (6 – 1)!
= 5!
=5x4x3x2x1
= 120 ways

Example: Circular Permutations

In how many ways can a caravan of 8 covered
kalesa from Intramuros be arranged in an oval track?
= (8 – 1)!
= 7!
=7x6x5x4x3x2x1
= 5,040 ways

5.3 Combinations
Same as permutation, Combination also concerns
arrangements, but without regard to the order. This means
that the order or arrangement in which the elements are
taken is not important.
For example, in getting the number of ways in the
combination of the letters A, B, and C taken 2 at a time.
We have an out put of
AB BA
AC CA
BC CB
We only have 3 arrangements, having the same letters in
the combinations but different in position is still same
combination.
5.3 Combinations
Combinatorial Formula
the number of ways of selecting r objects taken
from n at a time is C (n, r) or nCr where
𝒏!
nCr =
𝒓! 𝒏 #𝒓 !

Example: Combinations
How many ways are there to select 3 candidates
for a production planner position from 15 equally
qualified IE applicants?
#! '(!
15 C3 = =
%! # &% ! )! '( &) !
%- ( %, ( %' ( %.!
=
' ( . ( % ( %.!
.,+'&
=
5
= 455 ways

Example: Combinations
How many ways we can select 4 balls of same color
from a basket that contains 6 black and 5 white balls?
!! %!
6C4 = = 5C4 =
!!
=
'!
#! ! $# ! &! % $& ! #! ! $# ! &! ' $& !
* + ( + ,!
= ' ( &!
,! + - + ' =
&! ( )
). '
= -
=
)
= 15 ways = 5 ways
6 C4 + 5C4 = 15 + 5
= 20 ways
End of Chapter 5

Chapter 5 Permutations and Combinations

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Chapter 5 Permutations and Combinations

Uploaded by

Copyright:

Available Formats

Manuel S.

Enverga University Foundation, Lucena City College of Engineering

5.1 Principle of Counting

Engineering Data Analysis

Example: Principle of Counting

President – 20 ways (all students can be a president)

20 X 19 X 18 X 17 = 116, 280 ways

Example: Principle of Counting

Example: Principle of Counting

Die – 6 points (1, 2, 3, 4, 5, 6)

Engineering Data Analysis

Generalization of Principle of Counting

Engineering Data Analysis

Example: Generalization of Principle of

Example: Generalization of Principle of

Example: Generalization of Principle of

Engineering Data Analysis

ABC ACB BAC BCA CAB CBA

Engineering Data Analysis

Different Types of Permutations

Engineering Data Analysis

Example: Arrangement of n object

nPn = n! = n(n - 1) (n - 2) (n – 3)(n - 4)

Engineering Data Analysis

Example: Arrangement of n object

Engineering Data Analysis

Different Types of Permutations

Engineering Data Analysis

Example: Arrangement of n object

Example: Arrangement of n object

= 240, 240 ways

Different Types of Permutations

Engineering Data Analysis

Example: Arrangement of n object

% ' * ' + ' , ' - ' )!

Example: Arrangement of n object

&/ ' 0 ' % ' * ' +!

Different Types of Permutations

Engineering Data Analysis

Example: Circular Permutations

Engineering Data Analysis

Example: Circular Permutations

Engineering Data Analysis

Engineering Data Analysis

Engineering Data Analysis

You might also like