WARM-UP By yourselves, make a list of 4 things that you would bring on a desert island. Imagine that you could only bring 3 of the 4 things on your list.

Slides:



Advertisements
Similar presentations
5.3 Permutations and Combinations
Advertisements

Thinking Mathematically Combinations. A combination of items occurs when: The item are selected from the same group. No item is used more than once. The.
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
Statistics Review. Box-and-Whisker Plots The Parts of a Box and Whisker Plot Name the parts of a Box-and-Whisker Plot MedianUpper Quartile Lower.
How many possible outcomes can you make with the accessories?
Combinations We should use permutation where order matters
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
1 Permutations and Combinations CS/APMA 202 Rosen section 4.3 Aaron Bloomfield.
Section 4.3: Permutations and Combinations Def: A permutation of a set of distinct objects is an ordered arrangement of these objects. Ex: {a, b, c, d}
Jessie Zhao Course page: 1.
Permutations and Combinations
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 6 Counting and Probability Instructor: Hayk Melikyan Today we will review sections 6.4,
Permutations and Combinations
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
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.
Section 10-3 Using Permutations and Combinations.
Basic Probability Permutations and Combinations: -Combinations: -The number of different packages of data taken r at time from a data set containing n.
Notes Over 12.3 Finding Probabilities of Events
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.
Arrangements, Permutations & Combinations
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.
When do we add and when do we multiply?. How many ways can we draw a king or a seven from a deck? There are 4 kings and 4 sevens. Each of these cards.
Permutations and Combinations
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.
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
Lesson 0.4 (Counting Techniques)
I CAN: Use Permutations and Combinations
Pre calculus Problem of the Day H. W. - worksheet and p all Number of objects, n Size of group chosen from n objects
37. Permutations and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.
3.2 Combinations.
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.
Classwork: wks Homework (day 7): Wks (1-17)/Quiz next block Bring in items to work on Project in class!
Permutations and Combinations
L14: Permutations, Combinations and Some Review EECS 203: Discrete Mathematics.
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.
Week 9 - Friday.  What did we talk about last time?  Permutations  Counting elements in sets  Brief introduction to combinations.
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
Chapter 10 Counting Methods.
L14: Permutations, Combinations and Some Review
MATH 2311 Section 2.1.
CSE15 Discrete Mathematics 04/19/17
Discrete Math Section 15.3 Solve problems using permutations and combinations Read page Combinations and permutations.
Permutation – The number of ways to ARRANGE ‘n’ items ‘r’ at
Permutations and Combinations
Permutations and Combinations
Permutations and Combinations
Lesson 11-1 Permutations and Combinations
Permutations and Combinations
Permutations and Combinations
How many possible outcomes can you make with the accessories?
Combinations.
Using Permutations and Combinations
Bellwork Practice Packet 10.3 B side #3.
Combinations.
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
Using Permutations and Combinations
10.3 – Using Permutations and Combinations
Presentation transcript:

WARM-UP By yourselves, make a list of 4 things that you would bring on a desert island. Imagine that you could only bring 3 of the 4 things on your list. How many ways can you choose 3 things from the list

DISCUSSIOIN In doing the warm-up, what was most important when selecting the items that you would bring with you to a desert island? Was order important at all?

Combinations

SUBSET A set A is a subset of set B, if every element of A is an element of B “Everything that is in the set A, is also in the set B Ex: The set {a,b,c} is a subset of the set {a,b,c,d,e}

PERMUTATIONS vs. COMBINATIONS Permutations We are concerned with the order of the objects P(n,k) Combinations We do NOT care about the order of the objects; we ONLY care about the objects that are chosen C(n,k)

DISCUSSION Explain why a “combination” lock should really be called a “permutation” lock.

PRACTICE 1)C(7,1) 2)C(6,0) 3)P(10,5)/5! 4)C(6,0) 5)C(m,m)

WORD PROBLEM? How many 5-card poker hands are possible with a 52-card deck?

WORD PROBLEM? We want to find the total number of subsets of 5 cards we can choose from 52 cards; so order is NOT important

WORD PROBLEM? C(52,5)=52!/5!(47)!

MORE PRACTICE!!! ty/e/combinations_1 ty/e/combinations_1 ty/e/permutations_1 ty/e/permutations_1