Counting Methods
Counting Methods
Factorials: The number of ways of arranging all of a distinct number of items, symbolized
by n!, multiplying down beginning from the cardinal number n, all the way to 1.
Example: Six students are to occupy 6 desks in a row. How many ways are there to arrange
them? 6! = 6•5•4•3•2•1 = 720
Use this method when: • Repetition is not permitted • Order is not important (i.e. subsets,
committees, random selections, card hands)(When the set of {a,b,c} is the same as {c,b,a})
Example: If a club has 7 members, how many different ways are there to choose a 2 member
sub-committee? 7C2 = 7! 7•6•5•4•3•2•1 42
(7-2)! 2! = 5•4•3•2•1•2•1 = 2 = 21
Tree Diagrams
• A visual representation of all the possible outcomes of a multi-part task.
• Use the Fundamental Counting Principle to determine the total number of outcomes
and then set up the tree diagram using each part of the task as headings. List the
possible outcomes under each heading. Each possible outcome from the first
heading will create a branch to each possible outcome from the next heading. List all
the possible outcomes (sample points) under the heading, Sample Space.
• Example: Ruth is playing a game where she flips a coin and then rolls a die.
Construct a tree diagram and list the outcomes in a sample space.
2_ • 6 _ = 12
Coin Die
Task 1 Task 2
1 H1
2 H2
Heads 3 H3
4 H4
5 H5
6 H6
1 T1
2 T2
Tails 3 T3
4 T4
5 T5
6 T6