6/9/2016MATH 106, Section 51 Section 5 Combinations Questions about homework? Submit homework!

Slides:



Advertisements
Similar presentations
Main Menu Main Menu (Click on the topics below) Combinations Example Theorem Click on the picture.
Advertisements

Counting Methods Topic 7: Strategies for Solving Permutations and Combinations.
Math 221 Integrated Learning System Week 2, Lecture 1
How many possible outcomes can you make with the accessories?
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Combinatorics Chapter 3 Section 3.3 Permutations Finite Mathematics – Stall.
Permutations and Combinations
COUNTING PRINCIPALS, PERMUTATIONS, AND COMBINATIONS.
College Algebra Fifth Edition
Chapter 8 Counting Principles: Further Probability Topics Section 8.2 Combinations.
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.
7 Further Topics in Algebra © 2008 Pearson Addison-Wesley. All rights reserved Sections 7.4–7.7.
Permutations and Combinations
Counting. Product Rule Example Sum Rule Pigeonhole principle If there are more pigeons than pigeonholes, then there must be at least one pigeonhole.
Dr. Fowler AFM Unit 7-7 Permutations and Combinations.
3.8 Counting Techniques: Combinations. If you are dealt a hand in poker (5 cards), does it matter in which order the cards are dealt to you? A  K  J.
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!
Permutations and Combinations
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 2.6: Probability and Expectation Practice HW (not to hand in) From Barr Text p. 130 # 1, 2, 4-12.
Prob/Stats Definition A permutation is an ordered arrangement of objects. (For example, consider the permutations of the letters A, B, C and D.)
Honors Precalculus Counting and Probability Section 12.2: Permutations and Combinations IBTWW: 10/23/2015.
Chapter 12 – Probability and Statistics 12.2 – Permutations and Combinations.
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.
Combinations A combination is an unordered collection of distinct elements. To find a combination, the general formula is: Where n is the number of objects.
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.
11/30/2015MATH 106, Section 61 Section 6 More Ordered Arrangements Questions about homework? Submit homework!
12/13/2015MATH 106, Section 41 Section 4 Permutations Questions about homework? Submit homework!
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
1/23/2016MATH 106, Section 171 Section 17 More Equations with Restricted Solutions Questions about homework? Submit homework!
6.7 Permutations & Combinations. Factorial: 4! = 4*3*2*1 On calculator: math ==> PRB ==> 4 7! = 5040 Try 12!
Honors PreCalculus: Section 9.1 Basic Combinatorics.
Lesson 0.4 (Counting Techniques)
37. Permutations and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.
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.
Discrete Math Section 15.3 Solve problems using permutations and combinations Read page Combinations and permutations.
Permutations and Combinations
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.
ICS 253: Discrete Structures I Counting and Applications King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Copyright © Cengage Learning. All rights reserved. Probability and Statistics.
How many ways could…?.  There are 9 boys and 8 girls in the student council at Hermitage High School. How many ways could a single student be selected.
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.
Permutations and Combinations
Counting Principles Ex. Eight pieces of paper are numbered 1 to 8 and placed in a box. One piece of paper is drawn from the box, its number is written.
MATH 2311 Section 2.1.
Unit 4 – Combinatorics and Probability Section 4
Discrete Math Section 15.3 Solve problems using permutations and combinations Read page Combinations and permutations.
Permutations and Combinations
Permutation – The number of ways to ARRANGE ‘n’ items ‘r’ at
Lesson 11-1 Permutations and Combinations
Permutations and Combinations
13-1 Combinations and Permutations
Permutation & COmbination
Permutations and Combinations
Probability Section 19 NOTE: We are skipping Section 18. 2/21/2019
How many possible outcomes can you make with the accessories?
MATH 2311 Section 2.1.
Bellwork Practice Packet 10.3 B side #3.
Probability Warm Up page 12- write the question you have 10 mins to complete it. See coaching on page 85.
Permutations and Combinations
Standard DA-5.2 Objective: Apply permutations and combinations to find the number of possibilities of an outcome.
Permutations and Combinations
Lecture 7: Permutations and Combinations
Permutations and Combinations
MATH 2311 Section 2.1.
Presentation transcript:

6/9/2016MATH 106, Section 51 Section 5 Combinations Questions about homework? Submit homework!

6/9/2016MATH 106, Section 52 What are combinations? Sometimes, we want to take a collection of objects where the order doesn’t matter. Such unordered arrangements are called combinations. Jane has decided to take two out of five courses: ping pong, swimming, tennis, volleyball, and karate. How many ways can she choose to take one course the first semester and another course the second semester? P(5, 2) = 5! ——— = 20 (5 – 2)! P, S S, P P, T T, P P, V V, P P, K K, P S, T T, S S, V V, S S, K K, S T, V V, T T, K K, T V, K K, V Suppose we decide to list all the possibilities! #1

6/9/2016MATH 106, Section 53 Jane has decided to take two out of five courses: ping pong, swimming, tennis, volleyball, and karate. How many ways can she choose to take one course the first semester and another course the second semester? How many ways can she choose to take two courses simultaneously next semester? P(5, 2) = 5! ——— = 20 (5 – 2)! P, S S, P P, T T, P P, V V, P P, K K, P S, T T, S S, V V, S S, K K, S T, V V, T T, K K, T V, K K, V Suppose we decide to list all the possibilities! Notice that each combination of 2 courses can be obtained by grouping together pairs of permutations of 2 courses. #1

6/9/2016MATH 106, Section 54 How many ways can she choose to take one course the first semester and another course the second semester? How many ways can she choose to take two courses simultaneously next semester? P(5, 2) = 5! ——— = 20 (5 – 2)! P, S S, P P, T T, P P, V V, P P, K K, P S, T T, S S, V V, S S, K K, S T, V V, T T, K K, T V, K K, V Suppose we decide to list all the possibilities! In other words, if c is the number of combinations, then the number of permutations is equal to the number of possible combinations (c) times the number of permutations of each combination (2!), that is, c  (2!) = P(5, 2) which implies c = P(5, 2) ——— = 2! 5! ———— = 10 2! (5 – 2)!

6/9/2016MATH 106, Section 55 A club consists of 30 students. How many ways can we choose students to serve as president, vice president, treasurer, and secretary? How many ways can we choose 4 students to serve on a committee? The number of possibilities we have when how the four students are ordered matters is equal to P(30, 4) = 30! ———— = 657,720 (30 – 4)! Let the number of such combinations be c. and is also equal to the number of possible combinations (c) times the number of permutations of each combination (4!), that is, c  (4!) = P(30, 4) c = P(30, 4) ——— = 4! 30! ———— = 27,405 4! (30 – 4)! #2

6/9/2016MATH 106, Section 56 P(n, k) is the number of permutations of n things taken k at a time. C(n, k) is the number of combinations of n things taken k at a time. Let’s generalize this … Whatever handout problems we do not finish here in class we will do in class next time …

6/9/2016MATH 106, Section 57 How many 4-card hands can be drawn from a standard deck of 52 cards? C(52,4) = P(52, 4) ——— = 4! 52! ———— = 270,725 4! (52 – 4)! #4 How many ways can a committee of 5 be chosen from an organization of 40 people? C(40,5) = P(40, 5) ——— = 5! 40! ———— = 658,008 5! (40 – 5)! #3

6/9/2016MATH 106, Section 58 A class has 10 girls and 12 boys. How many committees of 4 can be formed? How many committees with 2 girls and 2 boys can be formed? How many committees with at least 2 girls can be formed? C(22,4) = P(22, 4) ——— = 4! 22! ———— = ! (22 – 4)! C(10,2)  C(12,2) = 45  66 = 2970 Choose a committee of 2 girls and 2 boys or … #5

6/9/2016MATH 106, Section 59 How many committees with at least 2 girls can be formed? Choose a committee of 2 girls and 2 boys or Choose a committee of 3 girls and 1 boy or Choose a committee of 4 girls. C(10,2)  C(12,2) + C(10,3)  C(12,1) + C(10,4) = 45   = 4620

6/9/2016MATH 106, Section 510 A summer school has 10 faculty, 5 staff members, and 50 students. How many committees of 8 members can be formed? How many committees of 8 members with no students can be formed? How many committees of 8 members with exactly 2 students can be formed? C(65,8) = P(65, 8) ——— = 8! 65! ———— = 5,047,381,560 8! (65 – 8)! C(15,8) = P(15, 8) ——— = 8! 15! ———— = ! (15 – 8)! C(15,6)  C(50,2) = 5005  1225 = 6,131,125 #6

6/9/2016MATH 106, Section 511 How many committees of 8 members with at most 4 faculty can be formed? How many committees of 9 members with exactly 3 from each category can be formed? C(10,0)  C(55,8) + C(10,1)  C(55,7) + C(10,2)  C(55,6) + C(10,3)  C(55,5) + C(10,4)  C(55,4) C(10,3)  C(5,3)  C(50,3) = 120  10  = 23,520,000 Just set up the calculation.

6/9/2016MATH 106, Section 512 Questions? Be sure to work through Example 4 from the text. (page 41)

6/9/2016MATH 106, Section 513 Homework Hints: In Section 5 Homework Problem #10, In Section 5 Homework Problem #10(d), In Section 5 Homework Problem #10(e), In Section 5 Homework Problem #10(f), In Section 5 Homework Problem #11, notice that “at most 3” means exactly the same as “3 or less”. notice that there is one less committee member to choose. notice that there is one less employee among the personnel to choose committee members from. first write an appropriate recipe to choose the poker hand. the new employee Jody has been counted in the given information.