Learning Objectives for Section 7.4 Permutations and Combinations

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
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.
Combinations We should use permutation where order matters
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.
Statistics Probabilities
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,
Permutations and Combinations
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.
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”)
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 Section 2.2 & 2.3 Finite Math.
Copyright © Cengage Learning. All rights reserved. Elementary Probability Theory 4.
Counting Principles Multiplication rule Permutations Combinations.
11.1A Fundamental Counting Principal and Factorial Notation 11.1A Fundamental Counting Principal If a task is made up of multiple operations (activities.
Counting Techniques Tree Diagram 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.
© 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.
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.
Operations on Sets Union of Sets Intersection of Sets
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.
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.
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
Combinations Lesson 4.7.
Lesson 4.6! Part 1: Factorial Notation!
Permutations and Combinations
Chapter 7 Logic, Sets, and Counting
Warm Up Permutations and Combinations Evaluate  4  3  2  1
Permutations and Combinations
MATH 2311 Section 2.1.
Counting Methods and Probability Theory
Chapter 10 Counting Methods.
5 Elementary Probability Theory
Permutations and Combinations
Five-Minute Check (over Lesson 12–2) Mathematical Practices Then/Now
MATH 2311 Section 2.1.
Presentation transcript:

Learning Objectives for Section 7.4 Permutations and Combinations MAT 103 SP09 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.

7.4 Permutations and Combinations MAT 103 SP09 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.

Definition of n Factorial (n !) MAT 103 SP09 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.

Factorial Examples Example: Simplify the following by hand. Show work.

Two Problems Illustrating Combinations and Permutations MAT 103 SP09 Two Problems Illustrating Combinations and Permutations Problem 1: Consider the set {p, e, n}. How many two-letter “code 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?

Difference Between Permutations and Combinations MAT 103 SP09 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.

MAT 103 SP09 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 Pn,r or nPr In our example with the number of two letter words from {p, e, n}, the answer is P3,2, which represents the number of permutations of 3 objects taken 2 at a time. P3,2 = 6

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

MAT 103 SP09 More Examples Find 5P3 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?

MAT 103 SP09 Permutations Find 5P5, the number of arrangements of 5 objects taken 5 at a time. Application: A bookshelf has space for exactly 5 books. How many different ways can 5 books be arranged on this bookshelf?

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

MAT 103 SP09 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 Cn,r or nCr.

Combinations The order of the items in each subset does not matter. MAT 103 SP09 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

MAT 103 SP09 Examples 1. Find 8C5 2. Find C8,8

Combinations or Permutations? MAT 103 SP09 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?

Permutations or Combinations? (continued) MAT 103 SP09 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?

MAT 103 SP09 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?