PERMUTATIONS and COMBINATIONS

Slides:



Advertisements
Similar presentations
4-1 Chapter 4 Counting Techniques.
Advertisements

Consider the possible arrangements of the letters a, b, and c. List the outcomes in the sample space. If the order is important, then each arrangement.
Introduction to Probability
Statistics Review. Box-and-Whisker Plots The Parts of a Box and Whisker Plot Name the parts of a Box-and-Whisker Plot MedianUpper Quartile Lower.
How many possible outcomes can you make with the accessories?
Multiplication Rule. A tree structure is a useful tool for keeping systematic track of all possibilities in situations in which events happen in order.
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.
Chapter 5 Section 5 Permutations and Combinations.
Confidential2 Warm Up 1.Tossing a quarter and a nickel HT, HT, TH, TT; 4 2. Choosing a letter from D,E, and F, and a number from 1 and 2 D1, D2, E1, E2,
Lecture 07 Prof. Dr. M. Junaid Mughal
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Counting Principles and Probability Digital Lesson.
COMBINATORICS Permutations and Combinations. Permutations The study of permutations involved order and arrangements A permutation of a set of n objects.
Confidential2 Warm Up 1.Tossing a quarter and a nickel 2. Choosing a letter from D,E, and F, and a number from 1 and 2 3.Choosing a tuna, ham, or egg.
P ERMUTATIONS AND C OMBINATIONS Homework: Permutation and Combinations WS.
1 Permutations and Combinations. 2 In this section, techniques will be introduced for counting the unordered selections of distinct objects and the ordered.
Topics to be covered: Produce all combinations and permutations of sets. Calculate the number of combinations and permutations of sets of m items taken.
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
Methods of Counting Outcomes BUSA 2100, Section 4.1.
Chapter 10 – Data Analysis and Probability
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Part 2 – Factorial and other Counting Rules
Copyright (C) 2002 Houghton Mifflin Company. All rights reserved. 1 Understandable Statistics Seventh Edition By Brase and Brase Prepared by: Lynn Smith.
Permutations and Combinations
Counting Principles. Counting examples Ex 1: A small sandwich café has 4 different types of bread, 5 different types of meat and 3 different types of.
PERMUTATIONS AND COMBINATIONS BOTH PERMUTATIONS AND COMBINATIONS USE A COUNTING METHOD CALLED FACTORIAL.
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
Aim: What is the counting rule? Exam Tomorrow. Three Rules Sometimes we need to know all possible outcomes for a sequence of events – We use three rules.
Counting Principles Multiplication rule Permutations Combinations.
Lesson 0.4 (Counting Techniques)
Copyright (C) 2002 Houghton Mifflin Company. All rights reserved. 1 Understandable Statistics Seventh Edition By Brase and Brase Prepared by: Lynn Smith.
Counting Techniques Tree Diagram Multiplication Rule Permutations Combinations.
Chapter 7 – Counting Techniques CSNB 143 Discrete Mathematical Structures.
Mr. Mark Anthony Garcia, M.S. Mathematics Department De La Salle University.
Permutations and Combinations
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Permutations and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.
13 Lesson 1 Let Me Count the Ways Fundamental Counting Principle, Permutations & Combinations CP Probability and Statistics FA 2014 S-ID.1S-CP.3S-CP.5.
The Multiplication Rule
Permutations and Combinations
4-1 Chapter 4 Counting Techniques.
Elementary Probability Theory
CSNB 143 Discrete Mathematical Structures
Section 8.3 PROBABILITY.
BASIC PROBABILITY Probability – the chance of something (an event) happening # of successful outcomes # of possible outcomes All probability answers must.
combinaTorial Analysis
3! ways, and 2! ways, so Permutations where some objects are repeated
Calculating Probability, Combinations and Permutations
Chapter 0.4 Counting Techniques.
4-1 Chapter 4 Counting Techniques.
4-1 Chapter 4 Counting Techniques.
12.1 The Fundamental Counting Principle & Permutations
Warm-Up #4 Monday, 2/8/2016 Simplify 19! 13!
Permutations and Combinations
Apply the Counting Principle and Permutations
Permutations and Combinations
Lesson 11-1 Permutations and Combinations
Permutations and Combinations
Permutations and Combinations
Permutations and Combinations
How many possible outcomes can you make with the accessories?
4-1 Chapter 4 Counting Techniques.
Bellwork Practice Packet 10.3 B side #3.
Permutations and Combinations
Standard DA-5.2 Objective: Apply permutations and combinations to find the number of possibilities of an outcome.
Permutations and Combinations
Lecture 7: Permutations and Combinations
Permutations and Combinations
Permutations and Combinations
Presentation transcript:

PERMUTATIONS and COMBINATIONS QS 026 CHAPTER 9 PERMUTATIONS and COMBINATIONS PERLIS MATRICULATION COLLEGE

Permutations of a set of objects A permutation of a set of objects is any arrangement of those objects in a definite order. (order is important). For example, if A={a,b,c,d} , then ab two-element permutation of A, acd three-element permutation of A, adcb four-element permutation of A.

The order in which objects are arranged is important. For example, ab and ba are considered different two- element permutations abc and cba are distinct three-element permutations, and abcd and cbad are different four-element permutations.

For another example the six permutations of ABC are the six different arrangements of ABC. These are ABC ACB BAC BCA CAB CBA

If there are 4 ways from Johor to Penang and 2 ways from Penang to Pulau Langkawi, how many ways can we go for a journey from Johor to Pulau Langkawi through Penang.

Johor Train Penang Ferry P.Langkawi Bus   Taxi Flight Johor Train Penang Ferry P.Langkawi Van

The number of permutations can be calculated using the multiplication principle. If there are m ways for an event to occur and n ways for another event to occur, then there are m x n ways for the two events to occur.

Example A coin and a dice are tossed together. How many different outcomes are possible ? Solution The coin has two possible outcomes (head, H and Tail, T) and the dice has 6 possible outcomes. The number of different possible outcomes is ___ x ___ = ____ 2 6 12 The possible outcomes are (H,1) (H,2) (H,3) (H,4) (H,5) (H,6) (T,1) (T,2) (T,3) (T,4) (T,5) (T,6)

Die 1 2 3 4 5 6 Coin Head (H) (H,1) (H ,2) (H, 3) (H, 4) (H, 5) (H, 6) Tail (T) (T,1) (T,2) (T, 3) (T, 4) (T, 5) (T, 6)

Example A shop stocks T-shirts in four sizes : small, medium and large. They are available in four colours; black , red , yellow and green. If the sizes are denoted by S, M and L and the colours are denoted by B, R, Y and G make a list of all the different labels needed to distinguish the T-shirts and find the number of different labels. Solution SB SR SY SG MB MR MY MG LB LR LY LG The number of different labels is 3 x 4 = 12

Permutations of n objects We will now consider the method for finding a number of permutations on the letters A, B and C using the multiplication principle. How many arrangements of the letters A, B and C are there? Let us consider the number of ways of arranging n letter. If we have 1 letter, there is just one arrangement. Example : A

If we have 2 letters, there are two different arrangements If we have 2 letters, there are two different arrangements. Example : AB and BA If we have 3 letters, the different arrangements are : there are three ways of choosing the first letter.

When the first letter has been chosen, there are two letters from which to choose the second; and the possible ways of choosing the first two letters are: there are two ways of choosing the second letter

i.e. for each of the three ways of choosing the first letter, there are two ways of choosing the second letter. Hence there are 3 x 2 ways of choosing the first two letters. Having chosen the first two letters, there is only one choice for the third letter, i.e. for each of the 3 x 2 ways of choosing the first two letters, there is only one possibility for the third letter. Hence there are 3 x 2 x 1 ways of arranging the three letters A, B and C. Note : if repetition are allowed, we can choose from all 3 digits for each digit of the number. A digit can be used more than once.

How many different ways of arranging 3 digit numbers from digits 5 and 6 ? 5 6 there will be 8 different ways, which is found from 2 2 2

How many different ways do you think there are of arranging 4 letters? You should able to see, there will be 24 different ways, which is found from 4 x 3 x 2 x 2 x 1. If there are 500 different objects, the number of ways would be 500 x 499 x 498 x … x 3 x 2 x 1. This is tedious to write, so we use the notation 500! ( factorial 500 ).

Example List the set of all permutations of the symbols P, Q and R when they are taken 3 at a time Solution PQR, PRQ, QPR, QRP, RPQ, RQP

Notes : n! means the products of all the In general, Number of permutations of n different objects taken all at a time without repetition n = n x (n – 1) x(n – 2) x … x 2 x 1 = n! P n n P = n! n Notes : n! means the products of all the integers from 1 to n inclusive and is called ‘n factorial’.

How many three-digit numbers can be made from the integers 2, 3, 4 ? Example How many three-digit numbers can be made from the integers 2, 3, 4 ? Solution n = 3 n = 3 ! 3 x 2 x 1 = 6 3 = n The number of arrangements is 6.

Example In how many ways can ten instructors be assigned to ten sections of a course in mathematics? Solution Substituting n = 10 we get = 10 ! = 3,628,800 ways =

Example Three people, Aishah, Badrul and Daniel must be scheduled for job interviews. In how many different orders can this be done? Solution n = 3 So there are 3! = 6 possible orders for the interviews.

Example How many different numbers can be formed from the digits 5, 6, 7 and 8 i)   if no repetitions are allowed n = 4 npn = 4p4 = 4! = 24   ii)  if the first digit must be 7. 1p1 X 3p3 = 1! X 3! = 6