Beruflich Dokumente
Kultur Dokumente
Nulake p134
n ! is called n factorial,
0! = 1
Example: 6! = 6.5.4.3.2.1
= 720 (there is a button on your calculator that finds factorials)
2. THE FUNDAMENTAL THEOREM OF COUNTING.
Example 1: If a menu offers 2 different entrees, 4 different mains and 3 different
desserts then the total number of possible meals is 2 4 3 = 24
In general if a task can be performed in n1 ways, a second task in n2 ways and a third
task in n3 ways .., then the total number of distinct ways of performing all tasks
together is n1 n2 n3
Example 2: How many 4 or 5 digit telephone numbers are possible, assuming the first
is not zero?
ans 9 10 10 10 + 9 10 10 10 10 = 99 000
3. PERMUTATIONS.
A permutation is an arrangement of objects order is important
n!
(n r)!
Example 2: A club has 12 members. How many ways could a president, vice-president
and treasurer be appointed.
12
P3 =
12!
(12 3)!
= 1 320
4. COMBINATIONS.
n
r
Cr =
n!
(n r)!r!
Example 2: From a club of 12 members, how many ways are there of selecting a
committee of three?
12
C3 =
12!
(12 3)!3!
= 220
Example 3: A group consists of 8 boys and 5 girls:
(a) How many ways can you select 2 boys and 2 girls?
(b) How many ways can you select a committee of 4 containing at least
2 boys?
ans
(a) 8C2
(b)
C2 = 28 10
= 280
C1
or 0.3357
C0
or 0.4056
(1
9+9
P(3 in a row) =
180
10000
1) = 180
= 0018