The Counting Principle and Permutations

Slides:



Advertisements
Similar presentations
 One hundred prisoners are lined up facing the same direction, single file, so that each prisoner can see the people in front of him but no one behind.
Advertisements

Slide 12-1 Copyright © 2005 Pearson Education, Inc. SEVENTH EDITION and EXPANDED SEVENTH EDITION.
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
Copyright © 2009 Pearson Education, Inc. Chapter 12 Section 8 - Slide 1 P-8 Probability The Counting Principle and Permutations.
The Fundamental Counting Principle and Permutations
Chapter 12 Section 8 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Chapter 12 Section 7 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Warm Up 1/31/11 1. If you were to throw a dart at the purple area, what would be the probability of hitting it? I I 5.
Generalized Permutations and Combinations
Counting Principles. What you will learn: Solve simple counting problems Use the Fundamental Counting Principle to solve counting problems Use permutations.
Chapter 12 Section 7 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
Section 10-3 Using Permutations and Combinations.
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Counting Methods Topic 4: Permutations with Restrictions.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations.
CSNB143 – Discrete Structure
1 If a task is made up of multiple operations (activities or stages that are independent of each other) the total number of possibilities for the multi-step.
11.1A Fundamental Counting Principal and Factorial Notation 11.1A Fundamental Counting Principal If a task is made up of multiple operations (activities.
Copyright © 2009 Pearson Education, Inc. Chapter 12 Section 5 - Slide 1 P-5 Probability Tree Diagrams.
Counting Techniques Tree Diagram Multiplication Rule Permutations Combinations.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.
Permutations Counting where order matters If you have two tasks T 1 and T 2 that are performed in sequence. T 1 can be performed in n ways. T 2 can be.
Probability and Counting Rules 4-4: Counting Rules.
Operations on Sets Union of Sets Intersection of Sets
1 2.3 Counting Sample Points (6)(6)(6)= 216 Example: How many outcome sequences are possible when a die is rolled three times?
The Fundamental Counting Principle and Permutations 18.0 Students use fundamental counting principles to compute combinations and permutations Students.
Counting Principle part 2 I. Math symbols and formulas for Counting Principles. A) Basic Counting Principle = m x n where you have m things and n things.
Section 6.3. Section Summary Permutations Combinations.
EXAMPLE 1 Count permutations
Permutations and Combinations
Chapter 10 Counting Methods.
4-1 Chapter 4 Counting Techniques.
MATH 2311 Section 2.1.
Permutations and Combinations
Counting Methods and Probability Theory
Generalized Permutations and Combinations
COCS DISCRETE STRUCTURES
12.2 Permutations and Combinations
Permutations 7.2 Chapter 7 Combinatorics 7.2.1
Permutations and Combinations
6.7 – Permutations and Combinations
4-1 Chapter 4 Counting Techniques.
4-1 Chapter 4 Counting Techniques.
CS100: Discrete structures
Permutations and Combinations
Warm Up Permutations and Combinations Evaluate  4  3  2  1
Section 12.8 The Counting Principle and Permutations
Permutations and Combinations
Lesson 11-1 Permutations and Combinations
11.6 Conditional Probability
Advanced Combinations and Permutations
Permutations and Combinations
MATH 2311 Section 2.1.
Counting Methods and Probability Theory
Counting Methods and Probability Theory
Chapter 10 Counting Methods.
4-1 Chapter 4 Counting Techniques.
Permutations, Combinations & Counting Principle
Using Permutations and Combinations
Counting Methods and Probability Theory
Chapter 10 Counting Methods 2012 Pearson Education, Inc.
Permutations and Combinations
Standard DA-5.2 Objective: Apply permutations and combinations to find the number of possibilities of an outcome.
Exercise How many different lunches can be made by choosing one of four sandwiches, one of three fruits, and one of two desserts? 24.
pencil, highlighter, GP notebook, textbook, calculator
10.3 – Using Permutations and Combinations
9.1 Basic Combinatorics.
Presentation transcript:

The Counting Principle and Permutations 6-8 Probability The Counting Principle and Permutations

WHAT YOU WILL LEARN • The counting principle • Solving Permutations

Counting Principle If a first experiment can be performed in M distinct ways and a second experiment can be performed in N distinct ways, then the two experiments in that specific order can be performed in M • N distinct ways.

Example A password to logon to a computer system is to consist of 3 letters followed by 3 digits. Determine how many different passwords are possible if: a) repetition of letters and digits is permitted b) repetition of letters and digits is not permitted c) the first letter must be a vowel (a, e, I, o, u), the first digit cannot be 0, and repetition of letters and digits is not permitted.

Solutions a. repetition of letters and digits is permitted. There are 26 letters and 10 digits. We have 6 positions to fill.

Solution b. repetition of letters and digits is not permitted.

Solution c. the first letter must be a vowel (a, e, i, o, u), the first digit cannot be 0, and repetition of letters and digits is not permitted.

Permutations A permutation is any ordered arrangement of a given set of objects. Number of Permutations The number of permutations of n distinct items is n factorial, symbolized n!, where n! = n(n  1)(n  2) • • • (3)(2)(1)

Example How many ways can 6 different stuffed animals be arranged in a line on a shelf? 6! = 6 • 5 • 4 • 3 • 2 • 1 = 720 The 6 stuffed animals can be arranged in 720 different ways.

Example Consider the six numbers 1, 2, 3, 4, 5 and 6. In how many distinct ways can three numbers be selected and arranged if repetition is not allowed? 6 • 5 • 4 = 120 Thus, there are 120 different possible ordered arrangements, or permutations.

Permutation Formula The number of permutations possible when r objects are selected from n objects is found by the permutation formula

Example The swimming coach has 8 swimmers who can compete in a “new” 100m relay (butterfly, backstroke, free style), he must select 3 swimmers, one for each leg of the relay in the event. In how many ways could he select the 3 swimmers?

Permutations of Duplicate Objects The number of distinct permutations of n objects where n1 of the objects are identical, n2 of the objects are identical, …, nr of the objects are identical is found by the formula

Example In how many different ways can the letters of the word “CINCINNATI” be arranged? Of the 10 letters, 2 are C’s, 3 are N’s, and 3 are I’s.

At the bakery, a box of cookies is made by selecting four cookies from the six types of cookie - chocolate chip, oatmeal raisin, sugar, peanut butter, butterscotch, and chocolate. In how many ways can a box of cookies be put together? a. 360 b. 30 c. 15 d. 6

At the bakery, a box of cookies is made by selecting four cookies from the six types of cookie - chocolate chip, oatmeal raisin, sugar, peanut butter, butterscotch, and chocolate. In how many ways can a box of cookies be put together? a. 360 b. 30 c. 15 d. 6