Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
76 views2 pages

Q4 L2 Permutation

The document discusses permutation and provides definitions, formulas, and examples of permutation problems involving arrangements of objects without and with repetition, as well as circular permutations. It includes problems involving arranging letters, people, animals, and more. Students are assigned homework problems applying these permutation concepts.

Uploaded by

ALIYAH MAPANDI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
76 views2 pages

Q4 L2 Permutation

The document discusses permutation and provides definitions, formulas, and examples of permutation problems involving arrangements of objects without and with repetition, as well as circular permutations. It includes problems involving arranging letters, people, animals, and more. Students are assigned homework problems applying these permutation concepts.

Uploaded by

ALIYAH MAPANDI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

LESSON #2:

PERMUTATION

I. Objective:
• illustrates and solves problems involving permutation

II. Definition and Formulas:


a. Permutation – the arrangement of things in definite order
a. The number of permutations of n things taken n at a time is given by:
n! (n factorial) = n(n-1)(n-2)(n-3)…(3)(2)(1)
b. The number of permutations of n things taken r at a time is given by:
𝒏!
nPr = (𝒏−𝒓)! *For easier computations, look for the nPr function in your scientific calculator.
Ex. for most Casio sci-cals, 3P2 : 3 → SHIFT → nPr → 2 → = (3P2 = 6)

III. Types of Permutation and Examples:


1. Without Repetition
General Formula: n! or nPr

a. Mrs. Smith keeps 7 different cookbooks on a shelf in one of her kitchen cabinets. How many ways
can these ten cookbooks be arranged on the shelf?
Solution: 7! or (7)(6)(5)(4)(3)(2)(1) = 5,040 arrangements
b. How many arrangements of the letters of the word REMAND are possible if:
b.1. there are no restrictions?
Solution: 6! or (6)(5)(4)(3)(2)(1) = 720 arrangements
b.2. they begin with RE?
Solution: (1)(1)(4!) = 24 arrangements
c. How many ways can the letters of the word LINEAR be arranged so that the consonants always
come together?
Solution: Take the consonants LNR as one group.
(1)(3!) multiply to 3! since LNR can change places within their group
Therefore, (1)(3!)(3!) = 36 arrangements.
d. In how many ways can 5 boys and 4 girls be arranged for a photo if:
d.1. there are no restrictions?
Solution: 9! = 362,880 arrangements
d.2. boys and girls alternate?
Solution: (B1)(G1)(B2)(G2)(B3)(G3)(B4)(G4)(B5)
(5)(4)(4)(3)(3)(2)(2)(1) or (5!)(4!) = 2,880 arrangements
e. A debating team consists of 4 speakers. In how many ways can a leader and an assistant be chosen?
Solution: 4 speakers taken 2 positions at a time
4!
4P2 = = 12 ways
(4−2)!
f. The high school track has 8 lanes. In the 100-meter dash, there is a runner in each lane. How many
trifectas are possible?
Solution: 8 runners taken 3 winners at a time
8!
8P3 = = 336 trifectas
(8−3)!
g. In a 6-digit lock, there 10 digits to choose from. How permutations are there?
Solution: 10 digits taken 6 digits at a time
10!
10P6 = = 151,200 locks
(10−6)!

2. With Repetition
𝒏!
General Formula:
𝒑!𝒒!𝒓!…

a. Find the unique permutations of the following words:


a.1. ACCOUNTANT
Solution: There are a total of 10 letters, but A, C, N, and T have been repeated twice each.
10!
Therefore, = 226,800.
2!∙2!∙2!∙2!
a.2. BILLIONAIRE
Solution: There are a total of 11 letters, but I has been repeated thrice, and L has been repeated
11!
twice. Therefore, = 3,326,400.
3!∙2!
a.3. MASSACHUSETTS
Solution: There are a total of 13 letters, but A and T has been repeated twice each, S has been
13!
repeated 4 times. Therefore, = 64,864,800 ways.
2!∙2!∙4!
b. In how many ways can three identical emeralds, two identical diamonds, and two different opals be
arranged in a row in a display case?
7!
Solution: = 420 ways.
3!∙2!
c. In a dog show, how many ways can five Chihuahuas, five Labradors, four poodles, and three beagles
line up in front of the judges if the dogs of the same breed are considered identical?
17!
Solution: = 171,531,360 ways.
5!∙5!∙4!∙3!

3. Circular
General Formula: (n – 1)! *One (1) refers to a person with a fixed position, while the rest moves.

a. In how many ways can 4 people be seated at a circular dining table?


Solution: (4 – 1)! = 6 ways
b. At a dinner party, 6 men and 6 women sit at a round table. In how many ways can they sit if:
b.1. there are no restrictions?
Solution: (12 – 1)! = 39,916,800 ways
b.2. men and women alternate?
*1 person (either man or woman) has his/her fixed position, and the rest of his/her respective
group will be a seat apart. The remaining 6 people will be filling the seats in between.
Solution: (6 – 1)! · 6! = 86,400 ways
b.3. two people must sit together?
*Take two people as one group, so there is 1 group seat and 10 remaining seats.
*Two people seated together can exchange their seats.
Solution: (11 – 1)! · 2! = 7,257,600 ways
b.4. two people must not sit together?
*This is a complement set of the previous question; no restrictions minus two people seated
together. Therefore, 39,916,800 – 7,257,600 = 32,659,200 ways

IV. Activity
• Show your solutions and box the final answers in a 1 whole sheet of paper; to be recorded as HW2 and
SW2. Refer to pp. 273-274, Written Math, nos. 30 (a & b), 31, 33, 35, 36, 39, and 41 (c, d, & e).
Deadline: April 15, 2024 (Monday).

You might also like