100% found this document useful (1 vote)
686 views7 pages

Chapter 13: Permutations and Combinations

The document discusses permutations and combinations, explaining that permutations involve arrangements of objects where order matters and combinations involve selections of objects where order does not matter. It provides examples of calculating permutations of objects from a group and with restrictions, as well as combinations from groups with varying criteria. Formulas and step-by-step solutions are given for problems involving permutations and combinations.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
100% found this document useful (1 vote)
686 views7 pages

Chapter 13: Permutations and Combinations

The document discusses permutations and combinations, explaining that permutations involve arrangements of objects where order matters and combinations involve selections of objects where order does not matter. It provides examples of calculating permutations of objects from a group and with restrictions, as well as combinations from groups with varying criteria. Formulas and step-by-step solutions are given for problems involving permutations and combinations.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Chapter 13: Permutations and Combinations

Permutations and Combinations


By Radith
Sec 3 Journey
Chapter 13: Permutations and Combinations

The Basic Counting Principle


• Counting is easy when you have a list of the items to count. It will be more difficult when there is
no list or when the number is too large. In this way, we learn more about more efficient ways of
counting. It can be either be shown in tree or box diagram

Tree Diagram
Box Diagram

5 4 3 2 1
Chapter 13: Permutations and Combinations

Permutations
• The number of permutations of n different objects is
n! = n(n-1)(n-2)x…….x 3 x 2 x 1
• There are two types of permutations:
1. Permutation of r objects from n different objects
2. Permutation with restriction
Chapter 13: Permutations and Combinations

Permutation of r objects from n different objects


nP 𝑛!
r= 𝑛−𝑟 !
For example:
Find the number of 4-letter permutations that can be formed from the letters in
the word JAKARTA
Solution:
7P 7!
4= 7−4 !

= 840 ways
Chapter 13: Permutations and Combinations

Permutations with Restrictions


Example:
5 boys and 7 girls are to form a line. Find the numbers of permutations in which:
a) the first two are girls
b) the boys are together
Solution:
a) 7 6

7 x 6 x 10! = 420 ways

b) The boys can be permutated in 5! ways


This part and the 7 girls then to form 8 objects which can be permutated in 6! Ways
So,
5! X 8! = 4 838 400 ways
Chapter 13: Permutations and Combinations

Combinations
• Unlike permutations, a combination is any selection of objects where the order of objects is not concerned
nC = 𝑛!
r 𝑛−𝑟 !𝑟!

Example: A group of 4 members is to be selected from 7 seniors and 4 juniors. Find the number of ways if:
a) There are no restrictions
b) The group has exactly 3 seniors
c) The group has at least 1 junior
Solution:
a) 11C = 330 ways
4

b) 7C x 4C1 = 140 ways


3

c) Number of groups without juniors = 4C0 x 7C4 = 35 ways


So, total number of ways of groups with at least 1 junior = 330 - 35
= 295 ways
Chapter 13: Permutations and Combinations

You might also like