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.

Slides:



Advertisements
Similar presentations
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.
Advertisements

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.
Permutations and Combinations
How many possible outcomes can you make with the accessories?
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.
6.7 – Permutations and Combinations
Logic and Introduction to Sets Chapter 6 Dr.Hayk Melikyan/ Department of Mathematics and CS/ For more complicated problems, we will.
College Algebra Fifth Edition
COMBINATORICS Permutations and Combinations. Permutations The study of permutations involved order and arrangements A permutation of a set of n objects.
How many ways are there to pass through city A where the arrows represent one-way streets? Answer: mn ways The counting principal: Suppose two experiments.
5.5 Counting Techniques. More Challenging Stuff  The classical method, when all outcomes are equally likely, involves counting the number of ways something.
4. Counting 4.1 The Basic of Counting Basic Counting Principles Example 1 suppose that either a member of the faculty or a student in the department is.
Chapter 7 Logic, Sets, and Counting Section 4 Permutations and Combinations.
6.4 Permutations and combinations For more complicated problems, we will need to develop two important concepts: permutations and combinations. Both of.
1 Permutations and Combinations. 2 In this section, techniques will be introduced for counting the unordered selections of distinct objects and the ordered.
Permutations Chapter 12 Section 7. Your mom has an iTunes account. You know iTunes requires her to enter a 7- letter password. If her password is random,
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.
March 10, 2015Applied Discrete Mathematics Week 6: Counting 1 Permutations and Combinations How many different sets of 3 people can we pick from a group.
Lesson Counting Techniques. Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting.
Permutations and Combinations
Unit 7 Permutation and Combination IT Disicipline ITD1111 Discrete Mathematics & Statistics STDTLP 1 Unit 7 Permutation and Combination.
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 7 Logic, Sets, and Counting Section 4 Permutations and Combinations.
Counting Methods Topic 4: Permutations with Restrictions.
Copyright © 1998, Triola, Elementary Statistics Addison Wesley Longman 1 M ARIO F. T RIOLA E IGHTH E DITION E LEMENTARY S TATISTICS Section 3-6 Counting.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
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.
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
Copyright © Cengage Learning. All rights reserved. Elementary Probability Theory 4.
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.
I CAN: Use Permutations and Combinations
Permutations and Combinations. 2 In this section, techniques will be introduced for counting the unordered selections of distinct objects and the ordered.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 7.2 Counting Our.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.
Discrete Math Section 15.3 Solve problems using permutations and combinations Read page Combinations and permutations.
Permutations and Combinations
COUNTING Permutations and Combinations. 2Barnett/Ziegler/Byleen College Mathematics 12e Learning Objectives for Permutations and Combinations  The student.
Operations on Sets Union of Sets Intersection of Sets
Permutations and Combinations. Fundamental Counting Principle If there are r ways of performing one operation, s ways of performing a second operation,
SECTION 5.4 COUNTING. Objectives 1. Count the number of ways a sequence of operations can be performed 2. Count the number of permutations 3. Count the.
Section 6-7 Permutations and Combinations. Permutation Permutation – is an arrangement of items in a particular order.
Permutations and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.
Section 6.3. Section Summary Permutations Combinations.
Chapter 10 Counting Methods.
Permutations and Combinations
Copyright © 2016, 2013, and 2010, Pearson Education, Inc.
Counting Methods and Probability Theory
4 Elementary Probability Theory
6.7 – Permutations and Combinations
Permutations and Combinations
Discrete Math Section 15.3 Solve problems using permutations and combinations Read page Combinations and permutations.
4 Elementary Probability Theory
Permutations and Combinations
Chapter 7 Logic, Sets, and Counting
Warm Up Permutations and Combinations Evaluate  4  3  2  1
Permutations and Combinations
Permutations and Combinations
MATH 2311 Section 2.1.
Counting Methods and Probability Theory
Counting Principle.
Chapter 10 Counting Methods.
Permutations and Combinations
MATH 2311 Section 2.1.
Presentation transcript:

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 calculate permutations. apply and calculate combinations. solve applications involving permutations and combinations.

2 7.4 Permutations and Combinations For more complicated problems, we will need to develop two important concepts: permutations and combinations. Both of these concepts involve what is called the factorial of a number.

3 Definition of n Factorial (n !) n! = n(n-1)(n-2)(n-3)…1 For example, 5! = 5(4)(3)(2)(1) = 120 0! = 1 by definition. To access on the calculator, Hit MATH cursor over to PRB choose 4:! n! grows very rapidly, which may result in overload on a calculator.

4 Factorial Examples Example: Simplify the following by hand. Show work. a) b)

5 Example* The simplest protein molecule in biology is called vasopressin and is composed of 8 amino acids that are chemically bound together in a particular order. The order in which these amino acids occur is of vital importance to the proper functioning of vasopressin. If these 8 amino acids were placed in a hat and drawn out randomly one by one, how many different arrangements of these 8 amino acids are possible?

6 Solution Solution: The amino acids must fill 8 slots. There are 8 choices for the first position, leaving 7 choices for the second slot, 6 choices for the third slot and so on. The number of different orderings is Number of arrangements: ___ ___ ___ ___ ___ ___ ___ ___

7 Two Problems Illustrating Combinations and Permutations Problem 1: Consider the set {p, e, n}. How many two-letter “words” (including nonsense words) can be formed from the members of this set, if two different letters have to be used? Solution: Problem 2: Now consider the set consisting of three male construction workers: {Paul, Ed, Nick}. For simplicity, denote the set by {p, e, n}. How many two-man crews can be selected from this set? Solution:

8 Difference Between Permutations and Combinations Both problems involved arrangements of the same set {p, e, n}, taken 2 elements at a time, without allowing repetition. However, in the first problem, the order of the arrangements mattered since pe and ep are two different “words”. In the second problem, the order did not matter since pe and ep represented the same two-man crew. We counted this only once. The first problem was concerned with counting the number of permutations of 3 objects taken 2 at a time. The second problem was concerned with the number of combinations of 3 objects taken 2 at a time.

9 Permutations The notation P(n,r) represents the number of permutations (arrangements) of n objects taken r at a time, where r is less than or equal to n. In a permutation, the order is important! P(n,r) may also be written P n,r or n P r In our example with the number of two letter words from {p, e, n}, the answer is P 3,2, which represents the number of permutations of 3 objects taken 2 at a time. P 3,2 = 6 = (3)(2)

10 Permutations In general, the number of permutations of n distinct objects taken r at a time without repetition is given by

11 More Examples Find 5 P 3

12 More Examples Application: A park bench can seat 3 people. How many seating arrangements are possible if 3 people out of a group of 5 sit down?

13 Find 5 P 5, the number of arrangements of 5 objects taken 5 at a time. Permutations

14 Application: A bookshelf has space for exactly 5 books. How many different ways can 5 books be arranged on this bookshelf? Permutations

15 Permutations on the Calculator Example: Evaluate 6 P 4 on the calculator. Type n value then hit MATH, cursor to PRB, select 2: nPr, type r value, hit ENTER.

16 Combinations In the second problem, the number of two-man crews that can be selected from {p, e, n} was found to be 3. This corresponds to the number of combinations of 3 objects taken 2 at a time or C(3,2). Note: C(n,r) may also be written C n,r or n C r.

17 Combinations The order of the items in each subset does not matter. The number of combinations of n distinct objects taken r at a time without repetition is given by

18 Examples 1. Find 8 C 5 2. Find C 8,8

19 Combinations or Permutations? In how many ways can you choose 5 out of 10 friends to invite to a dinner party? Solution: Does order matter?

20 Permutations or Combinations? (continued) How many ways can you arrange 10 books on a bookshelf that has space for only 5 books? Solution: Does order matter?

21 Lottery Problem A certain state lottery consists of selecting a set of 6 numbers randomly from a set of 49 numbers. To win the lottery, you must select the correct set of six numbers. How many different lottery tickets are possible? Solution: Does order matter?