COUNTING PRINCIPALS, PERMUTATIONS, AND COMBINATIONS.

Slides:



Advertisements
Similar presentations
Counting Principles Probability.
Advertisements

© 2010 Pearson Education, Inc. All rights reserved Chapter 9 9 Probability.
Counting Methods Topic 7: Strategies for Solving Permutations and Combinations.
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.
How many possible outcomes can you make with the accessories?
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.
Chapter 2 Section 2.4 Permutations and Combinations.
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
COUNTING PRINCIPALS, PERMUTATIONS, AND COMBINATIONS.
3.4 Counting Principles Statistics Mrs. Spitz Fall 2008.
Do Now: Make a tree diagram that shows the number of different objects that can be created. T-shirts: Sizes: S, M, L and T-shirts: Sizes: S, M, L and Type:
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,
How many different ways can you arrange the letters in “may”?
Permutations and Combinations Multiplication counting principle: This is used to determine the number of POSSIBLE OUTCOMES when there is more than one.
Permutations Lesson 10 – 4. Vocabulary Permutation – an arrangement or listing of objects in which order is important. Example: the first three classes.
Counting Principles. What you will learn: Solve simple counting problems Use the Fundamental Counting Principle to solve counting problems Use permutations.
Counting, Permutations, & Combinations. A counting problem asks “how many ways” some event can occur. Ex. 1: How many three-letter codes are there using.
Methods of Counting Outcomes BUSA 2100, Section 4.1.
Section 10-3 Using Permutations and Combinations.
Permutations, Combinations, and Counting Theory AII.12 The student will compute and distinguish between permutations and combinations and use technology.
Prob/Stats Definition A permutation is an ordered arrangement of objects. (For example, consider the permutations of the letters A, B, C and D.)
Conditional Probability The probability that event B will occur given that A will occur (or has occurred) is denoted P(B|A) (read the probability of B.
March 10,  Counting  Fundamental Counting principle  Factorials  Permutations and combinations  Probability  Complementary events  Compound.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
There are 3 horses (labeled A, B and C) racing for different places. Draw tree diagram to show 1. In how many ways can the horses be placed as 1 st, 2.
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.
Permutations, Combinations, and Counting Theory
Counting Principles Multiplication rule Permutations Combinations.
6.7 Permutations & Combinations. Factorial: 4! = 4*3*2*1 On calculator: math ==> PRB ==> 4 7! = 5040 Try 12!
11.1A Fundamental Counting Principal and Factorial Notation 11.1A Fundamental Counting Principal If a task is made up of multiple operations (activities.
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.
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.
 Counting  Fundamental Counting principle  Factorials  Permutations and combinations  Probability  Complementary events  Compound events  Independent.
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.
5.5 Generalized Permutations and Combinations
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
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.
Counting, Permutations, & Combinations
Chapter 10 Counting Methods.
Counting, Permutations, & Combinations
Multiplication Rule Combinations Permutations
MATH 2311 Section 2.1.
Counting, Permutations, & Combinations
Permutations and Combinations
Counting Principals, Permutations, and Combinations
Counting, Permutations, & Combinations
Counting, Permutations, & Combinations
Chapter 0.4 Counting Techniques.
Counting, Permutations, & Combinations
Counting, Permutations, & Combinations
Counting, Permutations, & Combinations
Lesson 11-1 Permutations and Combinations
Permutations and Combinations
Counting, Permutations, & Combinations
Permutations and Combinations
How many possible outcomes can you make with the accessories?
Permutations.
Counting, Permutations, & Combinations
Pearson Unit 6 Topic 15: Probability 15-3: Permutations and Combinations Pearson Texas Geometry ©2016 Holt Geometry Texas ©2007.
MATH 2311 Section 2.1.
Bellwork Practice Packet 10.3 B side #3.
Permutations and Combinations
Standard DA-5.2 Objective: Apply permutations and combinations to find the number of possibilities of an outcome.
Permutations and Combinations
MATH 2311 Section 2.1.
Presentation transcript:

COUNTING PRINCIPALS, PERMUTATIONS, AND COMBINATIONS

A COUNTING PROBLEM ASKS “HOW MANY WAYS” SOME EVENT CAN OCCUR. Ex. 1: How many three-letter codes are there using letters A, B, C, and D if no letter can be repeated? One way to solve is to list all possibilities.

Ex. 2: An experimental psychologist uses a sequence of two food rewards in an experiment regarding animal behavior. These two rewards are of three different varieties. How many different sequences of rewards are there if each variety can be used only once in each sequence? Next slide

Another way to solve is a factor tree where the number of end branches is your answer. Count the number of branches to determine the number of ways. There are six different ways to give the rewards.

FUNDAMENTAL COUNTING PRINCIPLE Suppose that a certain procedure P can be broken into n successive ordered stages, S 1, S 2,... S n, and suppose that S 1 can occur in r 1 ways. S 2 can occur in r 2 ways. S n can occur in r n ways. Then the number of ways P can occur is

Ex. 2 Revisited: An experimental psychologist uses a sequence of two food rewards in an experiment regarding animal behavior. These two rewards are of three different varieties. How many different sequences of rewards are there if each variety can be used only once in each sequence? Using the fundamental counting principle: 3 2 X 1st reward 2nd reward

PERMUTATIONS An r-permutation of a set of n elements is an ordered selection of r elements from the set of n elements ! means factorial Ex. 3! = 3∙2∙1 0! = 1

Ex. 1 Revisited: How many three-letter codes are there using letters A, B, C, and D if no letter can be repeated? Note: The order does matter

COMBINATIONS The number of combinations of n elements taken r at a time is Where n & r are nonnegative integers & r < n Order does NOT matter!

Ex. 3: How many committees of three can be selected from four people? Use A, B, C, and D to represent the people Note: Does the order matter?

Ex. 4: How many ways can the 4 call letters of a radio station be arranged if the first letter must be W or K and no letters repeat?

Ex. 5: In how many ways can a class of 25 students elect a president, vice- president, and secretary if no student can hold more than one office?

Ex. 6: How many five-card hands are possible from a standard deck of cards?

Ex. 7: In how many ways can 9 horses place 1 st, 2 nd, or 3 rd in a race?

Ex. 8: Suppose there are 15 girls and 18 boys in a class. In how many ways can 2 girls and 2 boys be selected for a group project? 15 C 2 × 18 C 2 = 16,065