Chapter 10 Counting Techniques.

Slides:



Advertisements
Similar presentations
5.3 Permutations and Combinations
Advertisements

Chapter 10 Counting Techniques.
Chapter 10 Counting Techniques.
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.
Math 221 Integrated Learning System Week 2, Lecture 1
Counting Principles The Fundamental Counting Principle: If one event can occur m ways and another can occur n ways, then the number of ways the events.
Section 4-6 Counting.
How many possible outcomes can you make with the accessories?
Part 4: Counting High 1.
Today Today: Reading: –Read Chapter 1 by next Tuesday –Suggested problems (not to be handed in): 1.1, 1.2, 1.8, 1.10, 1.16, 1.20, 1.24, 1.28.
Counting Techniques The Fundamental Rule of Counting (the mn Rule); Permutations; and Combinations.
Chapter 8 Counting Techniques PASCAL’S TRIANGLE AND THE BINOMIAL THEOREM.
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
Permutations and Combinations. Random Things to Know.
AP Stats BW 10/14 or 15 Suppose that the numbers of unnecessary procedures recommended by five doctors in a 1-month period are given by the set {2, 2,
P ERMUTATIONS AND C OMBINATIONS Homework: Permutation and Combinations WS.
Permutations and Combinations
PROBABILITY. FACTORIALS, PERMUTATIONS AND COMBINATIONS.
Mixed arrangements There are five different ways to systematically determine the number of outcomes in a multi stage event: * Write a list of all possibilities.
12.2 Combinations and Binomial Theorem p In the last section we learned counting problems where order was important For other counting problems.
Quiz 3 Counting: 4.3, 4.4, 4.5. Quiz3: April 27, pm Your answers should be expressed in terms of factorials and/or powers. A lonely gambler.
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.
Do Now: Review 10.4 Multiple Choice 1.) What does mean? a.) b.) c.) Short Answer 2.) Find the number of arrangements of 3 #’s for a locker with a total.
Section 10-3 Using Permutations and Combinations.
15.3 Counting Methods: Combinations ©2002 by R. Villar All Rights Reserved.
Section 15.3 – Day 2 Counting. When do I use what? Rearranging things that are all different: Counting Principles (multiplication), Combinations, Permutations.
Probability Permutations and Combinations.  Permutations are known as any arrangement of distinct objects in a particular _________. Permutations order.
Statistics 1: Elementary Statistics Section 4-7. Probability Chapter 3 –Section 2: Fundamentals –Section 3: Addition Rule –Section 4: Multiplication Rule.
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.
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.
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.
Permutations and Combinations Section 2.2 & 2.3 Finite Math.
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
ProbabilityProbability Counting Outcomes and Theoretical Probability.
Lesson 0.4 (Counting Techniques)
I CAN: Use Permutations and Combinations
37. Permutations and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.
Permutations and Combinations. 2 In this section, techniques will be introduced for counting the unordered selections of distinct objects and the ordered.
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.
Permutations Counting where order matters If you have two tasks T 1 and T 2 that are performed in sequence. T 1 can be performed in n ways. T 2 can be.
Discrete Math Section 15.3 Solve problems using permutations and combinations Read page Combinations and permutations.
Permutations and Combinations
MATHPOWER TM 12, WESTERN EDITION Chapter 8 Probability
Section 6-7 Permutations and Combinations. Permutation Permutation – is an arrangement of items in a particular order.
Permutations and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.
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.
Chapter 10 Counting Methods.
MATH 2311 Section 2.1.
Probability and Combinatorics
12.2 Combinations and Binomial Theorem
Chapter 5 Probability 5.5 Counting Techniques.
Discrete Math Section 15.3 Solve problems using permutations and combinations Read page Combinations and permutations.
Permutations and Combinations
Permutations and Combinations
Advanced Combinations and Permutations
First lecture fsalamri Faten alamri.
How many possible outcomes can you make with the accessories?
Combinations.
MATH 2311 Section 2.1.
Using Permutations and Combinations
Permutations Section 12.5.
PERMUTATIONS.
Permutations and Combinations
Using Permutations and Combinations
10.3 – Using Permutations and Combinations
MATH 2311 Section 2.1.
Presentation transcript:

Chapter 10 Counting Techniques

Miscellaneous Counting Methods Section 10.4

Permutations and Combinations Three cards are dealt in succession and without replacement from a standard deck of 52 cards. In how many different orders can the cards be dealt? How many different 3-card hands are possible? 52 nPr 3 = 52 x 51 x 50 = 132,600 52 x 51 x 50 3 x 2 x 1 52 nCr 3 = = 22,100

Permutations and Combinations The playbook for the quarterback of the Dallas Cowboys contains 50 plays. In how many different ways could the quarterback select 3 plays to use in succession in the next three downs? In how many different ways could he select a set of 3 plays to study? 50 x 50 x 50 = 125,000 50 x 49 x 48 3 x 2 x 1 50 nCr 3 = = 19,600

Permutations and Combinations Peter must select three electives from a group of 7 courses. In how many ways can Peter do this? If all 7 courses are available each of the 4 hours from 8 AM to noon, from how many different schedules (hours and what course at each hour) can Peter choose? 7 x 6 x 5 3 x 2 x 1 7 nCr 3 = = 35 7 nPr 4 = 7 x 6 x 5 x 4= 840

Distinct Arrangements The total number of distinct arrangements of n objects, where p objects are identical, q objects are identical, r objects are identical, and so on, is given by

Distinct Arrangements How many different arrangements can be made with the letters in the word TALLAHASSEE? with the letters in the word MISSISSIPPI? 11! 3!2!2!2! 39,916,800 6x2x2x2 39,916,800 48 = = = 831,600 11! 4!4!2! 39,916,800 24x24x2 39,916,800 1152 = = = 34,650 END