Curriculum
Course: SAAT (Tahsili)
Login

Curriculum

SAAT (Tahsili)

Mathematics · Unit 1: Logic and Geometry

0/25 Dr Dabour Hub Science Diagram and Course Material

Mathematics · Unit 7: Mathematics question bank with original diagrams

0/1 Dr Dabour Hub Science Diagram and Course Material

Mathematics · Mock exams and full tests

0/1 Dr Dabour Hub Science Diagram and Course Material

Physics · Mock exams and full tests

0/1 Dr Dabour Hub Science Diagram and Course Material

Chemistry · Unit 9: Chemistry question bank with original diagrams

0/1 Dr Dabour Hub Science Diagram and Course Material

Chemistry · Mock exams and full tests

0/1 Dr Dabour Hub Science Diagram and Course Material

Biology · Unit 1: Introduction to Biology and Classification

0/20 Dr Dabour Hub Science Diagram and Course Material
Text lesson

3.2.1 Counting principles, permutations and combinations

Count outcomes using the fundamental counting principle, permutations and combinations, and choose the correct method for a situation.

1Key ideas2Key ideas3Key ideas4Key ideas5Key ideas
Key ideas
Key ideas
1
Fundamental counting principle: if one choice can be made in m ways and a second in n ways, both can be made in m × n ways.
2
n! (n factorial) is n × (n − 1) × … × 1, and 0! = 1.
3
A permutation is an arrangement in which order matters:
1 / 5Next ▶
Key ideas
1

n
2

P
3

r
4

= n!/(n − r)!.
5

4
6

A combination is a selection in which order does not matter:
◀ Previous2 / 5Next ▶
Key ideas
Key ideas
C
= n!/[r!(n − r)!].
5
Arrangements of n objects with repeats: n! divided by the factorial of each repeat count.
6
n distinct objects can be arranged around a circle in (n − 1)! ways.
◀ Previous3 / 5Next ▶
Key ideas
Key ideas
7
=
n − r
, and the coefficients in the expansion of (a + b)
are the combinations
0
◀ Previous4 / 5Next ▶
Key ideas
1

to
2

.
◀ Previous5 / 5
1Worked examples2Worked examples3Worked examples
Worked examples
1

How many 3-digit codes can be made from 1–5 without repeating a digit?
2

— 5 × 4 × 3 = 60

which is
3

5
4

P
5

3
6

.
1 / 3Next ▶
Worked examples
Worked examples
How many committees of 3 can be chosen from 8 people?
—
8
C
= (8 × 7 × 6)/(3 × 2 × 1) = 56.
How many different arrangements of the letters of LEVEL?
◀ Previous2 / 3Next ▶
Worked examples
Worked examples
— 5!/(2! × 2!) = 30.
◀ Previous3 / 3
Factorial
Factorial — the product of all positive integers up to n
Permutation
Permutation — an ordered arrangement
Combination
Combination — an unordered selection
Sample space
Sample space — the set of all possible outcomes
Tree diagram
Tree diagram — a branching diagram that lists outcomes
Permutation or combination?
Question type Order matters? Use
Ranking, codes, seating Yes nPr
Teams, committees, hands of cards No nCr
Letters with repeats Yes n!/(repeats)!
1

Ask: would swapping two chosen items give a different result? If yes, it is a permutation.
2

Cancel factorials before multiplying.
3

“And” between stages means multiply; “or” between separate cases means add.
4

nPr is always at least as large as nCr.
Accepted payment methods