Ronald Hui Tak Sun Secondary School

Slides:



Advertisements
Similar presentations
The Fundamental Counting Principle & Permutations
Advertisements

Combinations, Permutations, and the Fundamental Counting Principle.
T HE F UNDAMENTAL C OUNTING P RINCIPLE & P ERMUTATIONS.
Multiplication Rule. A tree structure is a useful tool for keeping systematic track of all possibilities in situations in which events happen in order.
12.1 & 12.2: The Fundamental Counting Principal, Permutations, & Combinations.
ENM 207 Lecture 5. FACTORIAL NOTATION The product of positive integers from 1 to n is denoted by the special symbol n! and read “n factorial”. n!=1.2.3….(n-2).(n-1).n.
1 More Counting Techniques Possibility trees Multiplication rule Permutations Combinations.
Copyright © Ed2Net Learning Inc.1. 2 Warm Up 1.List all combinations of Roshanda, Shelli, Toshi, and Hector, taken three at a time 2. In how many ways.
The Fundamental Counting Principal, Permutations, & Combinations.
T HE F UNDAMENTAL C OUNTING P RINCIPLE & P ERMUTATIONS.
The Fundamental Counting Principal - Permutations - Factorials.
The Fundamental Counting Principle and Permutations
Methods of Counting Outcomes BUSA 2100, Section 4.1.
1 Lecture 4 (part 1) Combinatorics Reading: Epp Chp 6.
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
PERMUTATIONS and COMBINATIONS
9.6 The Fundamental Counting Principal & Permutations.
11.1A Fundamental Counting Principal and Factorial Notation 11.1A Fundamental Counting Principal If a task is made up of multiple operations (activities.
Counting Techniques Tree Diagram Multiplication Rule Permutations Combinations.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 7.2 Counting Our.
Chance of winning Unit 6 Probability. Multiplication Property of Counting  If one event can occur in m ways and another event can occur in n ways, then.
Copyright © Cengage Learning. All rights reserved. Probability and Statistics.
0.4 Counting Techniques. Fundamental Counting Principle TWO EVENTS:If one event can occur in m ways and another event can occur in n ways, then the number.
P REMUTATION AND M ULTIPLICATION P RINCIPLES Done by OWF, c October 31, 2013.
Counting Techniques Section 5.5. Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting.
MAT 2720 Discrete Mathematics
The Multiplication Rule
Multiplication Rule Combinations Permutations
4-1 Chapter 4 Counting Techniques.
Ronald Hui Tak Sun Secondary School
Permutations and Combinations
Counting Methods and Probability Theory
COCS DISCRETE STRUCTURES
Section 8.3 PROBABILITY.
Copyright © Cengage Learning. All rights reserved.
Permutations 7.2 Chapter 7 Combinatorics 7.2.1
Ronald Hui Tak Sun Secondary School
Permutations and Combinations
Counting Principle and Permutations
4 Probability Lesson 4.7 The Multiplication Counting
combinaTorial Analysis
Chapter 0.4 Counting Techniques.
4-1 Chapter 4 Counting Techniques.
One, two, three, we’re… Counting.
4-1 Chapter 4 Counting Techniques.
12.1 The Fundamental Counting Principle & Permutations
CS100: Discrete structures
COUNTING AND PROBABILITY
Basic Counting.
COUNTING AND PROBABILITY
Permutations and Combinations
6-7 Permutations and Combinations
Counting Discrete Mathematics.
Ronald Hui Tak Sun Secondary School
Permutations.
RONALD HUI TAK SUN SECONDARY SCHOOL
Ronald Hui Tak Sun Secondary School
Discrete Structures Counting.
Pearson Unit 6 Topic 15: Probability 15-3: Permutations and Combinations Pearson Texas Geometry ©2016 Holt Geometry Texas ©2007.
Counting Methods and Probability Theory
Chapter 10 Counting Methods.
4-1 Chapter 4 Counting Techniques.
6.4b The Piano Method (aka: Sticks and Stones Method)
Ronald Hui Tak Sun Secondary School
Ronald Hui Tak Sun Secondary School
Chapter 10 Counting Methods 2012 Pearson Education, Inc.
12.1 The Fundamental Counting Principle and Permutations
Permutations and Combinations
Standard DA-5.2 Objective: Apply permutations and combinations to find the number of possibilities of an outcome.
Presentation transcript:

Ronald Hui Tak Sun Secondary School HKDSE Mathematics Ronald Hui Tak Sun Secondary School

Homework SHW7-B1: Sam L SHW7-P1: Sam L RE8: Sam L EHHW1: Tashi, Kelvin, Sam L, Pako EHHW2: Tashi, Kelvin, Sam L, Pako Ronald HUI

Homework SHW9-B1: Sam L SHW9-C1: Kelvin (RD), Sam L SHW9-D1: Tashi, Matthew (RD), Ken (RD), Kelvin, Yan Tin, Walter SHW9-E1: Tashi, Kelvin SHW9-R1: Tashi, Kelvin, Sam L SHW9-P1: Tashi, Sam L RE9: Sam L, Pako Ronald HUI

Basic Principles of Counting

In how many ways can I choose a pet to buy? Addition Rule of Counting There are 7 cats and 5 dogs in a pet shop. In how many ways can I choose a pet to buy?

Addition Rule of Counting Method 1: There are 7 ways of choosing a cat. Method 2: There are 5 ways of choosing a dog. ∴ The total number of ways of choosing a pet

You have applied the addition rule of counting. In general, suppose a task can be performed by k methods, in which there are n1 ways to perform method 1, n2 ways to perform method 2, … , nk ways to perform method k, then there are in total n1 + n2 + … + nk ways to perform the task.

If a task can be performed using two methods which have common ways, can we still apply the addition rule of counting? In this case, we need to subtract the common ways when we apply the rule to avoid double counting. Let’s see an example.

How many different choices are there if a sticker is chosen? Suppose Mary has 6 different stickers, Ada has 4 different stickers and they have 2 stickers in common. How many different choices are there if a sticker is chosen? E F C D Mary’s stickers H G Ada’s stickers B A B A The required number of ways

In general, we have the following rule. If a task can be performed using either method 1 with n1 ways or method 2 with n2 ways, and there are m ways in common, then the number of ways to perform the task is n1 + n2 – m. Method 1 n1 Method 2 n2 m

Follow-up question A number is chosen from 1 to 60 inclusive. How many ways of selecting a number that (a) is either a multiple of 6 or 11? (b) is either a multiple of 3 or 11? (a) By the addition rule of counting, the required number of ways = 10 + 5 There are 10 multiples of 6: 6, 12, 18, ... , 60. There are 5 multiples of 11: 11, 22, 33, 44, 55. There are no common multiples of 6 and 11. = 15

Follow-up question A number is chosen from 1 to 60 inclusive. How many ways of selecting a number that (a) is either a multiple of 6 or 11? (b) is either a multiple of 3 or 11? (b) By the addition rule of counting, the required number of ways = 20 + 5 – 1 There are 20 multiples of 3: 3, 6, 9, ... , 33, ... , 60. There are 5 multiples of 11: 11, 22, 33, 44, 55. There is 1 common multiple of 3 and 11: 33. = 24

Multiplication Rule of Counting A restaurant offers 3 kinds of bread and 2 kinds of drinks. I want to have a bread and a drink for my breakfast. How many choices do I have?

∴ Total number of choices 1st step 2nd step Possible outcomes ∴ Total number of choices = 3  2 Number of kinds of bread = 3 Number of kinds of drinks = 2 = 6

In general, we can use the multiplication rule of counting to solve this kind of problem. Suppose a task involves a sequence of k steps. If there are n1 ways to perform step 1, n2 ways to perform step 2, … , nk ways to perform step k, then the number of ways to perform the task is n1  n2  …  nk.

Example: There are 3 different pencils, 4 different rulers and 6 different books in a bag. Find the number of ways of choosing a pencil, a ruler and a book from the bag. The required number of ways = 3  4  6 = 72 Some problems may involve both the addition rule and the multiplication rule of counting. Let’s see an example.

There are 8 Japanese courses, 6 French courses and 5 German courses There are 8 Japanese courses, 6 French courses and 5 German courses. If Victor wants to select two courses of different languages, how many choices are there? There are 3 possible types: Type 1 Japanese course + French course Type 2 Japanese course + German course Type 3 French course + German course

There are 8 Japanese courses, 6 French courses and 5 German courses There are 8 Japanese courses, 6 French courses and 5 German courses. If Victor wants to select two courses of different languages, how many choices are there? Type 1 Number of choices for a Japanese course and a French course = 8  6 = 48 By multiplication rule of counting Type 2 Number of choices for a Japanese course and a German course = 8  5 = 40 By multiplication rule of counting Type 3 Number of choices for a French course and a German course = 6  5 = 30 By multiplication rule of counting

By addition rule of counting There are 8 Japanese courses, 6 French courses and 5 German courses. If Victor wants to select two courses of different languages, how many choices are there? ∴ The required number of choices = 48 + 40 + 30 = 118 By addition rule of counting Do you know why the addition rule of counting is used in the last step?

Follow-up question There are 15 boys and 13 girls in both class A and class B. If a boy and a girl are selected from the same class to participate in an exchange program, how many choices are there? By multiplication rule of counting, number of choices of selecting a boy and a girl from class A Similarly, number of choices of selecting a boy and a girl from class B By addition rule of counting, the required number of choices

Permutation

Factorial Notation We use the notation n! to denote the product of the first n positive integers from 1 to n.  n! is read as n factorial. For any positive integer n, . Moreover, we define 0! = 1.

In fact, we can find the value of n! by calculator. For example, keying in gives the value of 7! , which is 5040.

But we can also evaluate expressions involving factorial without calculator. For example, Factorial notation is useful in finding the number of arrangements or permutations.

We may also arrange the pictures in this way. Permutation Consider 2 different pictures on a wall. Picture A Picture B Picture B Picture A We may also arrange the pictures in this way.

In daily life, we often come across situations of arranging objects. Permutation Consider 2 different pictures on a wall. Picture A Picture B Picture B Picture A In daily life, we often come across situations of arranging objects.

An arrangement of a certain number of objects in a definite order is called a permutation. Let us study how to find the number of permutations of several distinct objects.

Suppose we want to arrange the following 3 soldiers in a row Suppose we want to arrange the following 3 soldiers in a row. How many different arrangements are there? A B C Number of choices 1st 2nd 3rd

Suppose we want to arrange the following 3 soldiers in a row Suppose we want to arrange the following 3 soldiers in a row. How many different arrangements are there? A B C Number of choices 1st 2nd 3rd 3  There are 3 ways to choose the first soldier. Step 1

Suppose we want to arrange the following 3 soldiers in a row Suppose we want to arrange the following 3 soldiers in a row. How many different arrangements are there? A B C B C A Number of choices 1st 2nd 3rd 3 2  There are 2 ways to choose the second soldier. Step 2

Suppose we want to arrange the following 3 soldiers in a row Suppose we want to arrange the following 3 soldiers in a row. How many different arrangements are there? A B C C B A ____ B C A Number of choices 1st 2nd 3rd 3 2 1  There are 1 way to choose the third soldier. Step 3

Suppose we want to arrange the following 3 soldiers in a row Suppose we want to arrange the following 3 soldiers in a row. How many different arrangements are there? A B C C B A ____ B C A ------- ABC ACBBAC BCA CAB CBA 6 possible outcomes Number of choices 1st 2nd 3rd 3 2 1 By the multiplication rule of counting, number of permutations

Now we want to arrange the following 4 soldiers in a row Now we want to arrange the following 4 soldiers in a row. How many different arrangements are there? Number of choices 1st 2nd 3rd 4th 4  There are 4 ways to choose the first soldier. Step 1

Now we want to arrange the following 4 soldiers in a row Now we want to arrange the following 4 soldiers in a row. How many different arrangements are there? Number of choices 1st 2nd 3rd 4th 4 3  There are 3 ways to choose the second soldier. Step 2

Now we want to arrange the following 4 soldiers in a row Now we want to arrange the following 4 soldiers in a row. How many different arrangements are there? Number of choices 1st 2nd 3rd 4th 4 3 2  There are 2 ways to choose the third soldier. Step 3

Now we want to arrange the following 4 soldiers in a row Now we want to arrange the following 4 soldiers in a row. How many different arrangements are there? Number of choices 1st 2nd 3rd 4th 4 3 2 1  There are 1 way to choose the fourth soldier. Step 4

Now we want to arrange the following 4 soldiers in a row Now we want to arrange the following 4 soldiers in a row. How many different arrangements are there? Number of choices 1st 2nd 3rd 4th 4 3 2 1 By the multiplication rule of counting, number of permutations

In some situations, not all of the n distinct objects are arranged. By similar arguments, we have: The number of permutations of n distinct objects without repetition is n!. In some situations, not all of the n distinct objects are arranged.

By similar arguments, we have: The number of permutations of n distinct objects without repetition is n!. Let us consider the case when we only arrange some of the objects but not all of them.

If 2 soldiers are selected and arranged in a row, how many different arrangements are there? Number of choices 1st 2nd 4  There are 4 ways to choose the first soldier. Step 1

If 2 soldiers are selected and arranged in a row, how many different arrangements are there? Number of choices 1st 2nd 4 3  There are 3 ways to choose the second soldier. Step 2

If 2 soldiers are selected and arranged in a row, how many different arrangements are there? Number of choices 1st 2nd 4 3 By the multiplication rule of counting, number of permutations

If 3 soldiers (instead of 2) are selected and arranged in a row, how many different arrangements are there? Number of choices 1st 2nd 3rd 4  There are 4 ways to choose the first soldier. Step 1

If 3 soldiers (instead of 2) are selected and arranged in a row, how many different arrangements are there? Number of choices 1st 2nd 3rd 4 3  There are 3 ways to choose the second soldier. Step 2

If 3 soldiers (instead of 2) are selected and arranged in a row, how many different arrangements are there? Number of choices 1st 2nd 3rd 4 3 2  There are 2 ways to choose the third soldier. Step 3

If 3 soldiers (instead of 2) are selected and arranged in a row, how many different arrangements are there? Number of choices 1st 2nd 3rd 4 3 2 By the multiplication rule of counting, number of permutations

By similar arguments, we have: The number of permutations of n distinct objects taken r at a time without repetition, denoted by , . is

By similar arguments, we have: The number of permutations of n distinct objects taken r at a time without repetition, denoted by , . is 0! = 1 In particular,

Example: The number of permutations of 5 distinct balls taken 2 at a time without repetition is P = 5  4 = 20. 2 5 One possible permutation: 1st 2nd

Example: The number of permutations of 6 distinct balls taken 2 at a time without repetition is P = 6  5 = 30. 2 6 One possible permutation: 1st 2nd

Example: The number of permutations of 6 distinct balls taken 3 at a time without repetition is P = 6  5  4 = 120. 3 6 One possible permutation: 1st 2nd 3rd

In fact, we can find the value of by calculator. For example, keying in gives the value of , which is 56. P 8 2

Follow-up question (a) means the number of permutations of ___ distinct objects taken ___ at a time without repetition. (b) Evaluate the following expressions. (i) = _____ (ii) = _______ P 8 4 8 4 210 240 240 P 7 3 P 14 5

Let us see how to use the above results to solve permutation problems. Recall: 1. The number of permutations of n distinct objects without repetition is n!. 2. The number of permutations of n distinct objects taken r at a time without repetition, denoted by , is n  (n  1)  (n  2)  ...  (n  r + 1) = . Let us see how to use the above results to solve permutation problems.

There are 7 distinct digits. Example: There are 7 distinct numbers 1, 3, 4, 5, 7, 8 and 9. (a) How many 7-digit numbers can be formed by using the above 7 numbers without repetition? There are 7 distinct digits. (a) Number of 7-digit numbers formed

There are 7 distinct digits. Example: There are 7 distinct numbers 1, 3, 4, 5, 7, 8 and 9. (b) How many 3-digit numbers can be formed by using the above 7 numbers without repetition? There are 7 distinct digits. (b) Number of 3-digit numbers formed

Example: There are 7 distinct numbers 1, 3, 4, 5, 7, 8 and 9. (c) How many 3-digit numbers formed in (b) are divisible by 5? (c) For a 3-digit number formed in (b) to be divisible by 5, its last digit must be 5. 5 Choose 2 numbers from the remaining 6 numbers and arrange them in order.

Example: There are 7 distinct numbers 1, 3, 4, 5, 7, 8 and 9. (c) How many 3-digit numbers formed in (b) are divisible by 5? (c) For a 3-digit number formed in (b) to be divisible by 5, its last digit must be 5. ∴ Number of choices for 1st digit and 2nd digit 5 ∴ The required number is 30.

O G E N R A Follow-up question 6 distinct letters are shown below. (a) How many 6-letter strings can be formed by using the above 6 letters without repetition? (b) How many 4-letter strings can be formed by using the above 6 letters without repetition? G O E R N A (a) Number of 6-letter strings formed =

O G E N R A Follow-up question 6 distinct letters are shown below. (a) How many 6-letter strings can be formed by using the above 6 letters without repetition? (b) How many 4-letter strings can be formed by using the above 6 letters without repetition? G O E R N A (b) Number of 4-letter strings formed =

Example: 4 male and 5 female models are selected from 6 male and 8 female models to stand on a stage. In how many ways can they be arranged in a row if models of the same sex must stand next to each other? Suppose the male models stand on the left. 4 male models 5 female models Number of ways of choosing 4 male models from the 6 male models and arrange them in order Number of ways of choosing 5 female models from the 8 female models and arrange them in order

By multiplication rule of counting Example: 4 male and 5 female models are selected from 6 male and 8 female models to stand on a stage. In how many ways can they be arranged in a row if models of the same sex must stand next to each other? Suppose the male models stand on the left. 4 male models 5 female models ∴ Number of ways of arranging the 4 male models on the left and the 5 female models on the right By multiplication rule of counting

4 male models 5 female models 4 male models 5 female models Number of ways of arranging the 4 male models on the left and the 5 female models on the right 5 female models 4 male models Number of ways of arranging the 5 female models on the left and the 4 male models on the right The number of ways of arranging the male models on the right is the same as that of arranging the male models on the left.

4 male models 5 female models 4 male models 5 female models Number of ways of arranging the 4 male models on the left and the 5 female models on the right 5 female models 4 male models Number of ways of arranging the 5 female models on the left and the 4 male models on the right ∴ The required number of arrangements

Follow-up question 2 boys and 3 girls are selected from 5 boys and 7 girls and stand in a queue. In how many ways can they be arranged if all the girls must stand in front of the boys? 3 girls 2 boys Number of ways of choosing 3 girls from the 7 girls and arrange them in a queue Number of ways of choosing 2 boys from the 5 boys and arrange them in a queue ∴ The required number of ways