Permutations. Basics 5! Does not mean FIVE! 5! = 5 4 3 2 1 7! = 7 6 5 4 3 2 1 5! is read five factorial. 5! = 120 7! = 5040.

Slides:



Advertisements
Similar presentations
0.5 – Permutations & Combinations. Permutation – all possible arrangements of objects in which the order of the objects is taken in to consideration.
Advertisements

MATHCOUNTS TOOLBOX Facts, Formulas and Tricks
Standards: 2.7.8A Determine the number of permutations for an event.
13-2 Permutations with Repetitions and Circular Permutations
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.
Permutation and Combination
Probability & Statistics Section 3.4.  The letters a, b, can c can be arranged in six different orders: abcbaccab acbbcacba  Each of these arrangements.
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
Section 2: The Multiplication Rule Consider the game of tossing a coin, then rolling a die, then picking a card. One possible event would be (H, 2, 2clubs).
Chapter 7 Logic, Sets, and Counting Section 4 Permutations and Combinations.
1 Permutations and Combinations. 2 In this section, techniques will be introduced for counting the unordered selections of distinct objects and the ordered.
Sect Permutations. Def: When a group of objects or people are arranged in a certain order, the arrangement is called a permutation.
The Fundamental Counting Principle and Permutations
Permutations Linear and Circular. Essential Question: How do I solve problems using permutations?
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.
1 Fundamental Counting Principle & Permutations. Outcome-the result of a single trial Sample Space- set of all possible outcomes in an experiment Event-
10.3 – Using Permutations and Combinations Permutation: The number of ways in which a subset of objects can be selected from a given set of objects, where.
13-1 Permutations and Combinations
Section 10-3 Using Permutations and Combinations.
Permutation With Repetition and Circular Permutations
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Part 2 – Factorial and other Counting Rules
Chapter 12 – Probability and Statistics 12.2 – Permutations and Combinations.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
3. Suppose you take 4 different routes to Trenton, the 3 different routes to Philadelphia. How many different routes can you take for the trip to Philadelphia.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations.
2.2 Permutations (Textbook Section 4.6). Recall Factorial Notation  The number of ways to arrange n objects into n spots is n! (read “!” a “factorial”)
Learning Objectives for Section 7.4 Permutations and Combinations
Methods of Counting By Dr. Carol A. Marinas Fundamental Counting Principle Event M can occur in m ways Event N can occur in n ways The event M followed.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 7.4 Permutations and Combinations The student will be able to set up and.
Permutations with repetitions n objects of which p are alike and q are alike.
Permutations with Repetitions. Permutation Formula The number of permutations of “n” objects, “r” of which are alike, “s” of which are alike, ‘t” of which.
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.
Counting Principles Multiplication rule Permutations Combinations.
10.2 Permutations Objectives: Solve problems involving linear permutations of distinct or indistinguishable objects. Solve problems involving circular.
Counting Techniques Tree Diagram Multiplication Rule Permutations Combinations.
Permutations and Combinations. 2 In this section, techniques will be introduced for counting the unordered selections of distinct objects and the ordered.
MATH 2311 Section 2.1. Counting Techniques Combinatorics is the study of the number of ways a set of objects can be arranged, combined, or chosen; or.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.
Spring 2016 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University.
Mr. Mark Anthony Garcia, M.S. Mathematics Department De La Salle University.
Permutations 7.2 Chapter 7 Combinatorics 7.2.1
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?
Do Now A password must contain 4 characters. 1. How many passwords are possible if you just use digits in the password? 2. How many are possible with just.
Permutations and Combinations. Permutations Definition –An ordered arrangement of objects is called a permutation. –Hence, a permutation of n distinct.
Chapter 10 Counting Methods.
MATH 2311 Section 2.1.
Algebra 2/Trig Name: ________________________
Counting Methods and Probability Theory
13.2 Permutations with Repetitions & Circular Permutations
Lesson 13.2 Find Probabilities Using Permutations
Permutations 7.2 Chapter 7 Combinatorics 7.2.1
Warm-Up #4 Monday, 2/8/2016 Simplify 19! 13!
Chapter 7 Logic, Sets, and Counting
Accelerated Precalculus
Section 12.8 The Counting Principle and Permutations
Advanced Combinations and Permutations
MATH 2311 Section 2.1.
Counting Methods and Probability Theory
Counting Principle.
Chapter 10 Counting Methods.
Notes: 13-2 Repetitions and Circular Permutations
Using Permutations and Combinations
Chapter 10 Counting Methods 2012 Pearson Education, Inc.
Permutations and Combinations
Exercise How many different lunches can be made by choosing one of four sandwiches, one of three fruits, and one of two desserts? 24.
Using Permutations and Combinations
10.3 – Using Permutations and Combinations
MATH 2311 Section 2.1.
Presentation transcript:

Permutations

Basics 5! Does not mean FIVE! 5! = ! = ! is read five factorial. 5! = 120 7! = 5040

When a group of objects or things are arranged in a certain order, the arrangement is called a permutation. The arrangement of objects in a line is called a linear permutation.

Example 1. A theater owner has 11 films to show on 8 different screens. How many different arrange- ments are there for the 8 screens to show the 11 movies.

Example 1. 8 screens and 11 movies. We must make 8 choices Choice Choice # #

Example Choice Choice # # Therefore by the FCP there are

Example 1. Therefore by the FCP there are arrangements. The number of way to arrange 11 objects taken 8 at a time is written as P(11,8).

P(n,r) is read as the permutation of n objects taken r at a time. P(n,r) = Definition of P(n,r) n! n!(n-r)!

Example 2. P(7,5) = Five teens find seven empty seats at a theater. How many different seating arrangements are there? 7! 7!(7-5)! 7!2!=

Example 2. P(7,5) = 7! 7!(7-5)! 7!2!= = = = 2520

Example 3. A music store manager want to arrange 5 rock CD’s 4 rap CD’s and 4 jazz CD’s on a shelf. How many ways can they be arranged if they are ordered according to type?

Example 3. The 5 rock CD’s arrange into P(5,5) or 5! ways. The 4 rap CD’s arrange into P(4,4) or 4! ways. The 4 jazz CD’s arrange into P(4,4) or 4! ways.

Example 3. There are 3 types of CD’s that arrange into P(3,3) or 3! ways. The total ways the CD’s can be arranged is the product. P(5,5)P(4,4)P(4,4)P(3,3) = 5!4!4!3! = 414,720

Permutations with repetitions. The number of permutations of n objects of which p are alike and q are alike is n! n! p!q! p!q! The rule can be extended to any number of objects that repeat.

Example 4. How many ways can the letters of the word perpendicular be arranged? There are 2 p’s, 2 e’s, and 2 r’s. Therefore 13! 13!2!2!2!arrangements

Example 4. How many ways can the letters of the word perpendicular be arranged? 13! 13!2!2!2! = 778,377,600

Circular Permutations. If n distinct objects are arranged in a circle there are or (n-1)! permutations of the objects around the circle. n!n

Example 5. A disc jockey is loading a circular tray with six compact discs. How many different ways can these be arranged? (n-1)! = (6-1)! = 5! = 120

Circular Permutations (cont). If n distinct objects are arranged in a circle and there is a fixed point on the circle then there are n! permutations of the objects around the circle.

Example 6. If five different homes are being built around a cul-de-sac. How many different arrangements of the homes are possible? The cul-de-sac is circular but the entrance road is a fixed point

Example 6. If five different homes are being built around a cul-de-sac. The cul-de-sac is circular but the entrance road is a fixed point There are n! = 5! =120 arrangements possible.

We now have several formulas to remember. Linear permutations, circular permutations, circular permutations with a fixed point, and permutations with repetitions.

One last thing we need to know. Reflection happens when a circular permutation can be flipped over or when a linear permutation is viewed from opposite sides. This causes the number of permutations to be half as many.