Scribd
Upload
152 views

Engineering Data and Analysis - Notes 6

The document discusses counting techniques involving permutations and combinations. Permutations refer to ordered arrangements, while combinations refer to unordered arrangements. The key formulas are: - Number of permutations of n objects taken r at a time is nPr = n!/(n-r)! - Number of combinations of n objects taken r at a time is nCr = n!/r!(n-r)! Several examples are provided to illustrate calculating permutations and combinations in different scenarios like arranging letters, choosing committees, and selecting winning tickets. Exercises at the end provide additional practice problems.

Uploaded by

Chou Xi Min
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
152 views

Engineering Data and Analysis - Notes 6

The document discusses counting techniques involving permutations and combinations. Permutations refer to ordered arrangements, while combinations refer to unordered arrangements. The key formulas are: - Number of permutations of n objects taken r at a time is nPr = n!/(n-r)! - Number of combinations of n objects taken r at a time is nCr = n!/r!(n-r)! Several examples are provided to illustrate calculating permutations and combinations in different scenarios like arranging letters, choosing committees, and selecting winning tickets. Exercises at the end provide additional practice problems.

Uploaded by

Chou Xi Min
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Engineering Data Analysis

Notes # 6

Other counting techniques used to find the number of possible outcomes are permutations and
combinations.

Recall that the factorial of a non-negative integer n, denoted by n!, is the product of all positive integers
less than or equal to n. Thus, n! = n(n-1)(n-2)···(2)(1). By definition, 0! = 1.

Permutations

A permutation is an ordered arrangement of all or part of a set of objects.

Example 1: Consider the three letters a, b, and c. The possible permutations are abc, acb, bac, bca, cab,
and cba. We see that there are 6 distinct arrangements, because there 3 choices for the first position, 2
choices for the second position, and leaving only 1 choice for the last position. Thus, by the
multiplication principle, there are 3·2·1 = 6 possible arrangements.

In general, the number of permutations of n distinct objects is n!

Example 2: In how many ways can 5 students be arranged in a row of 5 chairs?

The arrangement of n objects in a specific order using r objects at a time is called a permutation of n
objects taken r at a time. It is written as n Pr , read as n permutation r , and the formula is

n!
Pr =
n
(n − r )!
Example 3: Consider the letters a, b, c, and d. If we choose two letters at a time and the order matters
so that ab is not the same as ba, then the possible 2-letter permutations are

ab, ac, ad, bc, bd, cd, ba, ca, da, cb, db, dc.
4!
Thus, 4 P2 = = 12 .
(4 − 2)!
Example 4: In how many ways can a President, Vice-President, and Secretary be chosen from a class of
15 students?

Example 5: In how many ways can 6 out of 10 students be seated in a row of 6 chairs?

The number of distinct permutations of n objects of which n1 are alike of the first kind, n 2 are alike of
the second kind, ....., nk are alike of the kth kind where n1 + n2 +  + nk = n is

n!
n1!n2 ! nk !

Example 6: How many distinct permutations can be made from the letters AABBBCCCC?

Example 7: How many different letter arrangements can be formed from the word STATISTICS?
Combinations

A combination is an unordered arrangement of r objects taken from a set of n objects. It is written as


n
n Cr or   which is read as n choose r and the formula is
r 

n n!
C r =   =
 r  (n − r )! r!
n

Example: Again consider the letters a, b, c, and d. If we choose two letters at a time but this time the
order does not matter so that ab is the same as ba, then the possible 2-letter combinations are

ab, ac, ad, bc, bd, cd.

 4 4!
Thus,   = =6.
 2  (4 − 2 )!2!

Example 8: In how many ways can you choose a committee consisting of 4 people from 10 people?

Example 9: From 20 tickets in a hat, 4 tickets are to be chosen at random. The holders of the winning
tickets are to be awarded pangkabuhayan showcase. In how many ways can the 4 winners be chosen?
Exercises

1. In how many different ways can a race with 9 runners be completed, assuming there is no tie?

2. A pianist plans to play 8 pieces at a recital. In how many ways can she arrange these pieces in the
program?

3. You are given a collection of 10 balls of different colors. How many ways are there to choose 3 of
these balls?

4. The flags of many nations consist of three vertical stripes. Suppose that the following 9 colors are
available: black, yellow, red, blue, white, gold, orange, pink, purple. How many different flags of 3
colors can be made without repetition of colors in a flag?

5. How many possible handshakes are there for 20 people in a room?

6. In how many ways can the first, second, and third prizes be awarded in a contest with 30
contestants?

7. There are 9 points lying on a circle. How many triangles can be drawn using the 9 points?

8. In how many ways can the 5 starting positions in a basketball team be filled by 10 players if

(a) specific players play specific positions?

(b) any player can play any position?

9. In how many ways can a pizza be filled with 5 toppings from a choice of 12 toppings?

10. A student has to answer only 4 out of 10 essay questions on a philosophy midterm examination.
How many possible examination selections can the student make?

You might also like