Chapter 13 sec. 3.  Def.  Is an ordering of distinct objects in a straight line. If we select r different objects from a set of n objects and arrange.

Slides:



Advertisements
Similar presentations
In this lesson we single out two important special cases of the Fundamental Counting Principle permutations and combinations. Goal: Identity when to use.
Advertisements

Warm-Up Problem Can you predict which offers more choices for license plates? Choice A: a plate with three different letters of the alphabet in any order.
Decisions, Decisions, Decisions
Combinations, Permutations, and the Fundamental Counting Principle.
Permutations and Combinations
Counting Principles The Fundamental Counting Principle: If one event can occur m ways and another can occur n ways, then the number of ways the events.
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.
Counting Principles. I. Basic Counting Problem  Say that I have a jar with 7 balls in it numbered 1 through 7. How many ways can 10 be made (by addition.
CSE115/ENGR160 Discrete Mathematics 04/17/12
Chapter 2 Section 2.4 Permutations and Combinations.
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
Probability Using Permutations and Combinations
1 Permutations and Combinations CS/APMA 202 Epp section 6.4 Aaron Bloomfield.
1 Permutations and Combinations CS/APMA 202 Rosen section 4.3 Aaron Bloomfield.
Logic and Introduction to Sets Chapter 6 Dr.Hayk Melikyan/ Department of Mathematics and CS/ For more complicated problems, we will.
Permutations and Combinations. Random Things to Know.
Chapter 7 Logic, Sets, and Counting Section 4 Permutations and Combinations.
4-2 Factorials and Permutations Imagine 3 animals running a race: How many different finish orders could there be? D H S FINISHFINISH.
Bell work An Internet code consists of one digit followed by two letters. The number 0 and the letter “O” are excluded. How many different codes are possible?
Permutations and Combinations
Do Now: Review 10.4 Multiple Choice 1.) What does mean? a.) b.) c.) Short Answer 2.) Find the number of arrangements of 3 #’s for a locker with a total.
1 Combinations. 2 Permutations-Recall from yesterday The number of possible arrangements (order matters) of a specific size from a group of objects is.
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 12.3, Slide 1 12 Counting Just How Many Are There?
Section 10-3 Using Permutations and Combinations.
October 13, 2009 Combinations and Permutations.
© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.
Part 2 – Factorial and other Counting Rules
Probability Permutations and Combinations.  Permutations are known as any arrangement of distinct objects in a particular _________. Permutations order.
Prob/Stats Definition A permutation is an ordered arrangement of objects. (For example, consider the permutations of the letters A, B, C and D.)
Chapter 12 – Probability and Statistics 12.2 – Permutations and Combinations.
Chapter 7 Logic, Sets, and Counting Section 4 Permutations and Combinations.
There are 3 horses (labeled A, B and C) racing for different places. Draw tree diagram to show 1. In how many ways can the horses be placed as 1 st, 2.
Learning Objectives for Section 7.4 Permutations and Combinations
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 12.3, Slide 1 12 Counting Just How Many Are There?
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 7.4 Permutations and Combinations The student will be able to set up and.
Ch Counting Principles. Example 1  Eight pieces of paper are numbered from 1-8 and placed in a box. One piece of paper is drawn from the box, its.
Permutations and Combinations Section 2.2 & 2.3 Finite Math.
COUNTING PRINCIPALS, PERMUTATIONS, AND COMBINATIONS.
6.7 Permutations & Combinations. Factorial: 4! = 4*3*2*1 On calculator: math ==> PRB ==> 4 7! = 5040 Try 12!
I CAN: Use Permutations and Combinations
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.
8.6 Counting Principles. Listing Possibilities: Ex 1 Eight pieces of paper are numbered from 1 to 8 and placed in a box. One piece of paper is drawn from.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.
5.5 Generalized Permutations and Combinations
COUNTING Permutations and Combinations. 2Barnett/Ziegler/Byleen College Mathematics 12e Learning Objectives for Permutations and Combinations  The student.
Section The Pigeonhole Principle If a flock of 20 pigeons roosts in a set of 19 pigeonholes, one of the pigeonholes must have more than 1 pigeon.
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Section 6.3. Section Summary Permutations Combinations.
Permutations and Combinations. Permutations Definition –An ordered arrangement of objects is called a permutation. –Hence, a permutation of n distinct.
Example A standard deck of 52 cards has 13 kinds of cards, with four cards of each of kind, one in each of the four suits, hearts, diamonds, spades, and.
Counting, Permutations, & Combinations
Chapter 10 Counting Methods.
MATH 2311 Section 2.1.
CSE15 Discrete Mathematics 04/19/17
Counting, Permutations, & Combinations
Counting Methods and Probability Theory
Counting, Permutations, & Combinations
Chapter 0.4 Counting Techniques.
Chapter 7 Logic, Sets, and Counting
Permutations and Combinations
Counting, Permutations, & Combinations
Counting, Permutations, & Combinations
Counting, Permutations, & Combinations
How many possible outcomes can you make with the accessories?
Permutations.
Combinations.
MATH 2311 Section 2.1.
Counting Methods and Probability Theory
PERMUTATIONS.
MATH 2311 Section 2.1.
Presentation transcript:

Chapter 13 sec. 3

 Def.  Is an ordering of distinct objects in a straight line. If we select r different objects from a set of n objects and arrange them in a straight line, this is called permutation of n objects taken r at a time.  Order matters!!!!!  Denoted by P(n,r)

 What does P(5,3) mean?  n is the number of objects from which you may select.  r is the number of objects that you are selecting.  That you are counting permutations formed by 3 different objects from a set of five available objects.

 How many permutations are there of the letters z, r, t, and w. Write the answer in P(n,r) notation.  Solution:  One way is to make a list. (too long.)  Using the slot diagram.

 Without repetition, there are 4 letters which can be for the first position, 3 for the second, and so on. 1 st letter 2 nd 3 rd 4 th x x x Therefore P(4,4) = 24 permutations. 1234

 Find the number of permutations. Write it as P(n,r) notation.  Eight objects taken three at a time. Questions to think about. 1. How many objects (n)? 2. The number of objects being selected (r)?

 There are 8 objects which is n.  3 objects are being selected. (r)  P(8,3) = 8 X 7 X 6 = 336

 n!, called n factorial  n(n-1)(n-2)∙∙∙21  0!=1

 6! = 6x5x4x3x2x1 = 720  (6-3)! = 3! = 3x2x1 = 6  3!/4! =(3x2x1)/(4x3x2x1) = 1/4

 To help you compute P(n,r)!  P(n,r) = n! /(n-r)!

 Find the Permutation  A) 9 objects taken 4 at a time.  B) 20 objects taken 7 at a time.  C) 5 objects taken 2 at a time.

 A) P(9,4) = 9!/5! = 9x8x7x6=3024  B) P(20,7) = 20!/13!= 20x19x18…x14 = 390,700,800  C) P(5,2) = 5!/3! = 20

 Def.  If we choose r objects from a set of n objects, we say that we are forming a combination of n objects taken r at a time.  Notation C(n,r) = P(n,r) / r! = n! / [r!(n-r)!]

 We are only concerned only with choosing a set of elements, but the order of the elements is not important.

 This means that if the permutations number is big, the combination number will be smaller.

 Find the Combinations  A) Eight objects taken three at a time.  B) Nine objects taken six at a time.  C) How many 3 elements sets can be chosen from a set of 5 objects.

 A) C(8,3) = 8!/(3!5!) = 8x7x6/6= 56  B) C(9,6) = 9!/(6!3!) =9x8x7/3x2=84  C) C(5,3) = 10

 In the game of poker, five cards are drawn from a standard 52-card deck. How many different poker hands are possible?  Solution:  C(52,5) = 2, 598, 960

 Give your answers using P(n,r) or C(n,r) notation. The key is if order matters or not.  1. Annette has rented a summer house for next semester. She wants to select four roommates from a group of six friends.

 2. There are 7 boats that will finish the America’s Cup yacht race.  3. A bicycle lock has three rings with the letters A through K on each ring. To unlock the lock, a letter must be selected on each ring. Duplicate letters are not allowed, and the order in which the letters are selected on the rings does not matter.

A) C(6,4) B) P(7,7) C) C(11,3)