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”)

Slides:



Advertisements
Similar presentations
Permutations and Combinations
Advertisements

4.2 Factorials and Permutations. Factorial I have 4 cards, how many different ways can I pick those 4 cards if order matters.
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.
Permutations and Combinations
Fall 2002CMSC Discrete Structures1 Permutations How many ways are there to pick a set of 3 people from a group of 6? There are 6 choices for the.
1 Learning Objectives for Section 7.4 Permutations and Combinations After today’s lesson you should be able to set up and compute factorials. apply and.
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.
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
Permutations and Combinations With Beanie Babies.
12.4 – Permutations & Combinations. Permutation – all possible arrangements of objects in which the order of the objects is taken in to consideration.
Permutations and Combinations
1 Permutations and Combinations CS/APMA 202 Rosen section 4.3 Aaron Bloomfield.
COMBINATORICS Permutations and Combinations. Permutations The study of permutations involved order and arrangements A permutation of a set of n objects.
Arithmetic Sequences and Series
Advanced Math Topics 4.4 Permutations. You have six younger brothers, George 1, George 2, George 3, George 4, George 5, and George 6. They all want your.
Transparency 3 Click the mouse button or press the Space Bar to display the answers.
4-2 Factorials and Permutations Imagine 3 animals running a race: How many different finish orders could there be? D H S FINISHFINISH.
Permutations Prof. Islam Combinatorics Lesson 5. Warm Up  Here are the number of elements in three different sets. Without a calculator express in exponential.
The Fundamental Counting Principle and Permutations
Permutations Linear and Circular. Essential Question: How do I solve problems using permutations?
Section 10-3 Using Permutations and Combinations.
Basic Probability Permutations and Combinations: -Combinations: -The number of different packages of data taken r at time from a data set containing n.
Statistics 1: Elementary Statistics Section 4-7. Probability Chapter 3 –Section 2: Fundamentals –Section 3: Addition Rule –Section 4: Multiplication Rule.
CCM 4300 Lecture 1 Computer Networks: Wireless and Mobile Communication Systems. Permutations and Combinations Dr E. Ever School of Engineering and Information.
Copyright © 2011 Pearson Education, Inc. Combinations, Labeling, and the Binomial Theorem Section 8.5 Sequences, Series, and Probability.
Lesson # 65 Notes Combinations. Lesson # 65 Combinations.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
Find permutations using permutation notation and using technology.
An introduction to permutations
Learning Objectives for Section 7.4 Permutations and Combinations
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 7.4 Permutations and Combinations The student will be able to set up and.
12/13/2015MATH 106, Section 41 Section 4 Permutations Questions about homework? Submit homework!
Counting Theory (Permutation and combination)
PERMUTATIONS and COMBINATIONS
Discrete Structures Combinations. Order Doesn’t Matter In the previous section, we looked at two cases where order matters: Multiplication Principle –
Section 4.5-Counting Rules
THE NATURE OF COUNTING Copyright © Cengage Learning. All rights reserved. 12.
Precalculus – Section 3.3. How can you use your calculator to find the logarithm of any base?
1 CS 140 Discrete Mathematics Combinatorics And Review Notes.
I CAN: Use Permutations and Combinations
Combinations – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Combinations Reading: Kolman, Section 3.2.
2.1 Factorial Notation (Textbook Section 4.6). Warm – Up Question  How many four-digit numbers can be made using the numbers 1, 2, 3, & 4?  (all numbers.
© 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.
Chapter 7: Probability Lesson 4: Permutations Mrs. Parziale.
EXAMPLE 2 Use a permutations formula Your band has written 12 songs and plans to record 9 of them for a CD. In how many ways can you arrange the songs.
Unit 4 Section 4-5 – Day : Permutation Rule  Permutation Rule : The arrangement of n objects in a specific order using r objects at a time.  Notation.
Special Topics. Calculating Outcomes for Equally Likely Events If a random phenomenon has equally likely outcomes, then the probability of event A is:
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.
P REMUTATION AND M ULTIPLICATION P RINCIPLES Done by OWF, c October 31, 2013.
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.
11.1 Factorial & Fundamental Counting Principles.
Chapter 10 Counting Methods.
Permutations and Combinations
Counting Methods and Probability Theory
Section 8.3 PROBABILITY.
Permutations and Combinations
Lesson 4.6! Part 1: Factorial Notation!
4 Probability Lesson 4.8 Combinations and Probability.
Permutations and Combinations
Chapter 7 Logic, Sets, and Counting
6-7 Permutations and Combinations
Algebra 1 Section 8.4 Express numbers using scientific notation
Counting Methods and Probability Theory
Combinations & Permutations (4.3.1)
Sullivan Algebra and Trigonometry: Section 13.1
PERMUTATIONS.
Permutations and Combinations
Section 0.4 Day 1 – Counting Techniques
Presentation transcript:

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”)  It is calculated as follows n! = n x (n-1) x (n-2) x … x 3 x 2 x 1  i.e. 4! = 4 x 3 x 2 x 1

What if you have fewer than n spots?  Yesterday, we used factorial notation to arrange n objects into n spots  Today, we will look at how to arrange n objects into a r spots

Permutations  A permutation is an ordered selection of elements taken from a given set  Note: “ordered” means that the position of the element matters (i.e. labeling, arranging, assigning position, etc.)  Symbolically, it is the number of ways to arrange n objects into r spots

Notation  The notation for a permutation is n P r or P(n,r)  Think of the “P” as “pick”  i.e. “Given n objects, how many ways can you pick and arrange them into r spots ?”

Formula  Permutations are calculated using the following formula n P r = n!/(n-r)!  i.e. 5 P 2 = 5!/(5-2)! = 5!/3! = 20