COMBINATORICS Permutations and Combinations. Permutations The study of permutations involved order and arrangements A permutation of a set of n objects.

Slides:

Advertisements

Similar presentations

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.

Advertisements

ENM 207 Lecture 5. FACTORIAL NOTATION The product of positive integers from 1 to n is denoted by the special symbol n! and read “n factorial”. n!=1.2.3….(n-2).(n-1).n.

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.

WARM-UP 1.Given that P(A)=.35, P(B)=.85, P(AUB)=.8 a)Find P(AB) b)P(A|B) c)P(B|A) 2. Determine if the events A and B are independent.

Chapter 7 Logic, Sets, and Counting Section 4 Permutations and Combinations.

Elements of Combinatorics 1. Permutations (Weak Definition) A permutation is usually understood to be a sequence containing each element from a finite.

Week 11 What is Probability? Quantification of uncertainty. Mathematical model for things that occur randomly. Random – not haphazard, don’t know what.

Aim: What are the permutation and combination? Do Now: 2. If four students are scheduled to give a report in class, in how many ways can the students.

1 Permutations and Combinations. 2 In this section, techniques will be introduced for counting the unordered selections of distinct objects and the ordered.

Permutations Linear and Circular. Essential Question: How do I solve problems using permutations?

Slide 7- 1 Copyright © 2006 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.

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.

Methods of Counting Outcomes BUSA 2100, Section 4.1.

Section 10-3 Using Permutations and Combinations.

© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.

Basic Probability Permutations and Combinations: -Combinations: -The number of different packages of data taken r at time from a data set containing n.

Permutations and Combinations

Unit 7 Permutation and Combination IT Disicipline ITD1111 Discrete Mathematics & Statistics STDTLP 1 Unit 7 Permutation and Combination.

Part 2 – Factorial and other Counting Rules

Chapter 7 Logic, Sets, and Counting Section 4 Permutations and Combinations.

Simple Arrangements & Selections. Combinations & Permutations A permutation of n distinct objects is an arrangement, or ordering, of the n objects. An.

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

3.4 Counting Principles I.The Fundamental Counting Principle: if one event can occur m ways and a second event can occur n ways, the number of ways the.

Lesson 8.6 Page #1-21 (ODD), (EOO), (ODD), (EOO), (ODD) Pick up the handout on the table.

 Counting CSCA67 Fall, 2012 Nov. 12, 2012 TA: Yadi Zhao

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.

Permutations and Combinations

PERMUTATIONS and COMBINATIONS

Counting Principles Multiplication rule Permutations Combinations.

9.6 The Fundamental Counting Principal & Permutations.

1 CS 140 Discrete Mathematics Combinatorics And Review Notes.

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.

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.

Permutations and Combinations

Copyright © Peter Cappello 2011 Simple Arrangements & Selections.

COUNTING Permutations and Combinations. 2Barnett/Ziegler/Byleen College Mathematics 12e Learning Objectives for Permutations and Combinations  The student.

1 Section 5.3 Permutations and Combinations Permutations (order counts) A permutation of a set is an arrangement of the objects from a set. There are n!

Special Topics. Calculating Outcomes for Equally Likely Events If a random phenomenon has equally likely outcomes, then the probability of event A is:

Chapter 10 Counting Methods.

MATH 2311 Section 2.1.

Permutations and Combinations

12.2 Permutations and Combinations

Chapter 5 Probability 5.5 Counting Techniques.

Lesson 4.6! Part 1: Factorial Notation!

Chapter 7 Logic, Sets, and Counting

Combinatorics: Combinations

Permutations and Combinations

MATH 2311 Section 2.1.

Counting Methods and Probability Theory

Chapter 10 Counting Methods.

Using Permutations and Combinations

Combinations & Permutations (4.3.1)

Counting Methods and Probability Theory

Chapter 10 Counting Methods 2012 Pearson Education, Inc.

Created by Tom Wegleitner, Centreville, Virginia

10.5 Permutations and Combinations.

Permutations and Combinations

Permutations and Combinations

Using Permutations and Combinations

10.3 – Using Permutations and Combinations

3.7 Counting Techniques: Permutations

MATH 2311 Section 2.1.

Presentation transcript:

COMBINATORICS Permutations and Combinations

Permutations The study of permutations involved order and arrangements A permutation of a set of n objects is an ordered arrangement of all n objects

Example How many 3 letter code symbols can be formed with the letters A,B,C, without repetition? 3!

Factorial Notation n P n = n(n-1)(n-2)...x 3 x 2 x 1 7! = 7 x 6 x 5 x 4 x 3 x 2 x 1 0! = 1

Factorial Notation Calculator: Step 1:Number Step 2:MATH Step 3:PRB Step 4: !

The Number of Permutations of n Objects Taken k at a Time n P k = n(n-1)(n-2)... (n-k-1) = n!/(n-k)! k - factors 8 P 4 = 8 x 7 x 6 x 5 = 1680 tells how many factors tells where to start

Calculator Step 1: Number n Step 2: MATH Step 3: PRB Step 4: n P r Step 5: Number k

Example 1 How many permutations are there of the letters of the word UNDERMOST if the letters are taken 4 at a time? 9 P 4 = 3024

Example 2 How many 5-letter code symbols can be formed with letters A,B,C, and D, if we allow a letter to occur more than once? 4 5 = 1024, which means that...

Repetitions The number of distinct arrangement of n objects taken k at a time, allowing repetition, is n k.

Permutations For a set of n objects in which n 1 are one kind, n 2 are another kind... and a k th kind, the number of distinguishable permutations is n! n 1 ! x n 2 !... x n k !

Example In how many distinguishable ways can the letters of the word CINCINNATI ba arranged? N=10!= 50, 400 2!3!3!1!1!

Combinations(Example) Find all the combinations of 3 letters taken from the set of 5 letters (A,B,C,D,E). There are 10 combinations of the 5 letters taken 3 at a time (A,B,C) names the same set as (A,C,B)

Subset Set A is a subset of set B, denoted A B, if every element of A is a n element of B.

Combinations and Combination Notation A combination containing k objects is a subset containing k objects The number of combinations of n objects taken k at a time is denoted n C k.

Combinations of n Objects Taken k at a Time The total number of combinations of n objects taken k at a time, denoted n C k is given by n C k = n! k!(n-k)!

Example How many committees can be formed from a group of 5 governors and 7 senators if each committee consists of 3 governors and 4 senators? 5 C 3 x 7 C 4 = 350.

Binomial Coefficient Notation ( ) = n C k nknk