Chapter 4 Part 1

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 15

CH4 Counting Methods Applied 12 20162017.

notebook October 27, 2017

1
CH4 Counting Methods Applied 12 20162017.notebook October 27, 2017

2
CH4 Counting Methods Applied 12 20162017.notebook October 27, 2017

3
CH4 Counting Methods Applied 12 20162017.notebook October 27, 2017

1,2,5,6,7,9

4
CH4 Counting Methods Applied 12 20162017.notebook October 27, 2017

4.2 Introducing Permutations and Factorial Notation

Permutations ordered arrangements ie. how many permutations,


means how many ordered
arrangements are possible?
ie. 123, 321, 213, 132, 312, 231 so there are 6 permutations ie. these 3
numbers can be arranged in 3! ways (3! = 3x2x1 = 6 ways) ie. there
are 7! ways to arrange the letters in LACROIX (5040 ways)

The number of permutations of a set of n different


objects (ie. the number of ways that you can arrange n
different objects) is given by the expression n!
(n factorial)

Factorials: n! = n(n1)(n2)(n3)...(3)(2)(1)
7! = (7)(6)(5)(4)(3)(2)(1)
11! = (11)(10)(9)(8)...(3)(2)(1)

5
CH4 Counting Methods Applied 12 20162017.notebook October 27, 2017

6
CH4 Counting Methods Applied 12 20162017.notebook October 27, 2017

7
CH4 Counting Methods Applied 12 20162017.notebook October 27, 2017

8
CH4 Counting Methods Applied 12 20162017.notebook October 27, 2017

9
CH4 Counting Methods Applied 12 20162017.notebook October 27, 2017

10
CH4 Counting Methods Applied 12 20162017.notebook October 27, 2017

11
CH4 Counting Methods Applied 12 20162017.notebook October 27, 2017

12
CH4 Counting Methods Applied 12 20162017.notebook October 27, 2017

13
CH4 Counting Methods Applied 12 20162017.notebook October 27, 2017

14
CH4 Counting Methods Applied 12 20162017.notebook October 27, 2017

15

You might also like