11/30/2015MATH 106, Section 61 Section 6 More Ordered Arrangements Questions about homework? Submit homework!

Slides:



Advertisements
Similar presentations
Permutation and Combination
Advertisements

Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 12.2, Slide 1 12 Counting Just How Many Are There?
3/26/03 Tucker, Applied Combinatorics Section General Counting Methods for Arrangements and Selections Tucker, Applied Combinatorics, Sec. 5.1,
Combinatorics Chapter 3 Section 3.3 Permutations Finite Mathematics – Stall.
The Fundamental Counting Principle
COUNTING PRINCIPALS, PERMUTATIONS, AND COMBINATIONS.
College Algebra Fifth Edition
Mathematics. Permutation & Combination Session.
Chapter 7 Logic, Sets, and Counting Section 4 Permutations and Combinations.
9/12/2015MATH 106, Section 11 MATH 106 Combinatorics “In how many ways is it possible to …?”
9/15/2015MATH 106, Section 31 Section 3 Recipes Questions about homework? Submit homework!
Counting Unit Review Sheet. 1. There are five choices of ice cream AND three choices of cookies. a)How many different desserts are there if you have one.
Sect Permutations. Def: When a group of objects or people are arranged in a certain order, the arrangement is called a permutation.
Permutations Linear and Circular. Essential Question: How do I solve problems using permutations?
WELCOME Welcome. MATH SEVEN What do I need to know?  Where do I sit?  When should I get to class?  Will we have homework?  What materials do I need?
Aim: Combinations Course: Math Lit. Do Now: Aim: How do we determine the number of outcomes when order is not an issue? Ann, Barbara, Carol, and Dave.
10/12/2015MATH 106, Section 141 Section 14 Linear Equations with Unit Coefficients Questions about homework? Submit homework!
Mathematics. Permutation & Combination - 2 Session.
Permutation With Repetition and Circular Permutations
Probability with Permutations and Combinations Advanced Math Topics.
Chapter 7 Logic, Sets, and Counting Section 4 Permutations and Combinations.
SECTION 15.4 DAY 1: PERMUTATIONS WITH REPETITION/CIRCULAR PERMUTATIONS PRE-CALCULUS.
10/24/2015MATH 106, Section 81 Section 8 Pascal’s Triangle Questions about homework? Submit homework!
4.1.2 Pigeonhole principle:Strong Form  Theorem 4.2: Let q 1,q 2,…,q n be positive integers. If q 1 +q 2 +…+q n -n+1 objects are put into n boxes, then.
Lesson  The numerator and denominator of a theoretical probability are numbers of possibilities.  Sometimes those possibilities follow regular.
Counting Methods Topic 4: Permutations with Restrictions.
Math 106 – Exam #1 - Review Problems 1. (a) (b) (c) (d) (e) Evaluate each of the expressions displayed, and write each answer as a single numerical value.
6/4/2016MATH 106, Section 191 Section 20 Dice Last Section we will cover!!!! We will finish this section in this class or early next class. Use the remainder.
11/18/2015MATH 106, Section 131 Section 13 Non-adjacent Objects Questions about homework? Submit homework!
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 7.4 Permutations and Combinations The student will be able to set up and.
Counting Principles. Counting examples Ex 1: A small sandwich café has 4 different types of bread, 5 different types of meat and 3 different types of.
12/13/2015MATH 106, Section 41 Section 4 Permutations Questions about homework? Submit homework!
12/14/2015MATH 106, Section 101 Subsets, Strings, Equations Handout 1. A vending machine advertises Reese’s Cups, Hershey Bars, Snicker’s Bars, Milky Way.
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 12.2, Slide 1 12 Counting Just How Many Are There?
1 If a task is made up of multiple operations (activities or stages that are independent of each other) the total number of possibilities for the multi-step.
1/23/2016MATH 106, Section 171 Section 17 More Equations with Restricted Solutions Questions about homework? Submit homework!
Honors Analysis.  Independent Events: Events that do not affect each other  Sample Space: List of all possible outcomes  Fundamental Counting Principle:
10.2 Permutations Objectives: Solve problems involving linear permutations of distinct or indistinguishable objects. Solve problems involving circular.
More on Permutations. Permutation with Repetition Circular Permutations Bracelet Permutations Topics in this Section.
Section Basic Counting Principles: The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n 1.
Permutations 7.2 Chapter 7 Combinatorics 7.2.1
Homeroom Do not get out of your seat. Sit quietly. Riddle:: Take away my first letter, and I still sound the same. Take away my last letter, I still sound.
1 DISCRETE STRUCTURES DISCRETE STRUCTURES SSK3003 DR. ALI MAMAT 1.
Unit 5 Lesson 6 Probability 6.7 Estimating Probabilities using Simulations.
6/9/2016MATH 106, Section 51 Section 5 Combinations Questions about homework? Submit homework!
Permutations and Combinations. Fundamental Counting Principle If there are r ways of performing one operation, s ways of performing a second operation,
A permutation of r objects taken from n different objects without repetition is an arrangement of the objects in a specific order For example, there 12.
Copyright © Cengage Learning. All rights reserved. Probability and Statistics.
Section The Product Rule  Example: How many different license plates can be made if each plate contains a sequence of three uppercase English letters.
COUNTING Discrete Math Team KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) 1.
Section 6-7 Permutations and Combinations. Permutation Permutation – is an arrangement of items in a particular order.
MATH 2311 Section 2.1.
Section 16 Inclusion/Exclusion
Counting Principals, Permutations, and Combinations
Copyright © Cengage Learning. All rights reserved.
ACTG 313 August 30, 2017.
Math 106 – Exam #1 - Review Problems
8.3 Counting Apply the fundamental counting principle
Chapter 7 Logic, Sets, and Counting
Subsets, Strings, Equations Handout
Probability Section 19 NOTE: We are skipping Section 18. 2/21/2019
Section 6.4 Counting and Combinations with Multiple Cases
Objective & Essential Understanding
Graphing Linear Equations
Review of the Previous Discussions
10.5 Permutations and Combinations.
pencil, highlighter, GP notebook, textbook, calculator
Final Exam - NEXT WEEK! The final exam is worth 400 points, twice as much as each of the semester exams. The remaining homework assignments count toward.
Presentation transcript:

11/30/2015MATH 106, Section 61 Section 6 More Ordered Arrangements Questions about homework? Submit homework!

11/30/2015MATH 106, Section 62 Consider different arrangements of the word MARGIN. How many ways can the letters be arranged? How many ways can the letters be arranged keeping the two vowels together? How many ways can the letters be arranged keeping the two vowels separated by at least one consonant? P(6, 6) = 6! = 720 Arrange five slots for the four consonants and the pair of vowels, and then Arrange the order for the two vowels. P(5, 5)  2! = 240 We can solve this by using … #1

11/30/2015MATH 106, Section 63 We can solve this by using … the GOOD = ALL – BAD approach How many ways can the letters be arranged keeping the two vowels separated by at least one consonant? total number of possibilities total number of possibilities we are not interested in total number of possibilities we are interested in 720 – 240 =480

11/30/2015MATH 106, Section 64 Consider different arrangements of the word CAULKING. How many ways can the letters be arranged? How many ways can the letters be arranged keeping the three vowels together? How many ways can the letters be arranged keeping at least two of the three vowels separated by at least one consonant? P(8, 8) = 8! = Arrange six slots for the five consonants and three vowels, and then Arrange the order for the three vowels. P(6, 6)  3! = – 4320 =36000 #2

11/30/2015MATH 106, Section 65 How many ways can the letters be arranged keeping the “A” and “U” together? How many ways can the letters be arranged keeping the “A” and “U” separated by at least one letter? How many ways can the letters be arranged to end in “ING”? Arrange seven slots, six for letters other than “A” and “U” and one for the “A” and “U”, and then Arrange the order for the “A” and “U”. P(7, 7)  2! = – =30240 P(5, 5) = 120

11/30/2015MATH 106, Section 66 How many ways can the letters be arranged to not end in “ING”? How many ways can the letters be arranged to have “ING” somewhere in the arrangement? How many ways can the letters be arranged to have “ING” nowhere in the arrangement, even though each of the letters I, N, and G are included in the arrangement? – 120 =40200 P(6, 6) = – 720 =39600

11/30/2015MATH 106, Section 67 How many ways can 5 people be placed in an order to sit in a row? sit in a circle? A B CD E ABCDEABCDE P(5, 5) = 120 is the same as D E AB C Suppose we decide to always place A “on top”. We must now count the number of ways to seat the remaining 4 people. P(4, 4) = 24 #3

11/30/2015MATH 106, Section 68 Observe that each circular arrangement corresponds to n straight line arrangements. Let’s generalize this to arrange n objects in a circle … Let c be the number of circular arrangements of n objects, then there are c  n straight line arrangements. We know the number of straight line arrangements is P(n, n) = n! Using a combinatorial proof, we have

11/30/2015MATH 106, Section 69 Six friends (Joey, Chandler, Ross, Monica, Rachel, and Phebee) are to be seated. How many seating arrangements are there at a round dinner table? How many seating arrangements are there at a round dinner table if Chandler and Monica must sit together? How many seating arrangements are there at a round dinner table if Ross and Rachel refuse to sit together? (6 – 1)! = 120 (5 – 1)!  2! = – 48 = 72 #4

11/30/2015MATH 106, Section 610 How many seating arrangements are there at a round dinner table if they sit boy/girl/boy/girl/boy/girl? How many seating arrangements are there at a round dinner table if all of the boys sit together and all of the girls sit together? (3–1)!  3! = 12 (3–1)!  3  3! = 36 Arrange the boys in a circle, and then arrange the girls in between the boys. Arrange the boys in a circle, and then choose between which boys the girls sit, and then arrange the girls.

11/30/2015MATH 106, Section 611 A room contains 8 people. How many ways can we select a group of 2 of these people? How many ways can we select a group of 6 of these people? How many ways can we select a group of 3 of these people? How many ways can we select a group of 5 of these people? C(8,2) = 28 C(8,6) = 28 C(8,3) = 56 #5 C(8,5) = 56

11/30/2015MATH 106, Section 612 Homework Hints: In Section 6 Homework Problem #5 notice that sitting six people in seven seats is essentially the same as thinking of the empty seat as being for a seventh person and sitting seven people in seven seats.

11/30/2015MATH 106, Section 613 Quiz #1 NEXT CLASS! Be sure to do the review problems for this, quiz posted on the internet. The link can be found in the course schedule.