Section 1.3 Each arrangement (ordering) of n distinguishable objects is called a permutation, and the number of permutations of n distinguishable objects.

Slides:



Advertisements
Similar presentations
3.7: Counting Objective: To find the counts of various combinations and permutations, as well as their corresponding probabilities CHS Statistics.
Advertisements

Counting Chapter 6 With Question/Answer Animations.
Warm-Up Problem Can you predict which offers more choices for license plates? Choice A: a plate with three different letters of the alphabet in any order.
Consider the possible arrangements of the letters a, b, and c. List the outcomes in the sample space. If the order is important, then each arrangement.
Probability Chapter 11 1.
Chapter 3 Probability.
Section 1.5 Events A and B are called independent events if and only if P(A  B) = P(A) P(B)  P(A) = P(A | B)  P(B) = P(B | A) Events A, B, and C are.
Section 1.4 The conditional probability of an event A given that event B has occurred (or will occur) is defined by P(A  B) P(A | B) = ————provided that.
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.
Sections 4.1, 4.2, 4.3 Important Definitions in the Text:
Suppose an ordinary, fair six-sided die is rolled (i.e., for i = 1, 2, 3, 4, 5, 6, there is one side with i spots), and X = “the number of spots facing.
Tucker, Section 5.41 Section 5.4 Distributions By Colleen Raimondi.
Probability Using Permutations and Combinations
Counting Principles and Probability Digital Lesson.
College Algebra Fifth Edition
Probability Chapter 3. § 3.1 Basic Concepts of Probability.
4. Counting 4.1 The Basic of Counting Basic Counting Principles Example 1 suppose that either a member of the faculty or a student in the department is.
Counting and Probability Sets and Counting Permutations & Combinations Probability.
NA387 Lecture 5: Combinatorics, Conditional Probability
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
X of Z: MAJOR LEAGUE BASEBALL ATTENDANCE Rather than solving for z score first, we may be given a percentage, then we find the z score, then we find the.
Section 4.3 Basic Counting Rules HAWKES LEARNING SYSTEMS math courseware specialists Copyright © 2008 by Hawkes Learning Systems/Quant Systems, Inc. All.
3.1 Probability Experiments Probability experiment: An action, or trial, through which specific results (counts, measurements, or responses) are obtained.
Find the probability and odds of simple events.
Generalized Permutations and Combinations
Permutations and Combinations
PROBABILITY. Counting methods can be used to find the number of possible ways to choose objects with and without regard to order. The Fundamental Counting.
TREES AND COUNTING TECHNIQUES When we simple events like rolling a die, the number of possible outcomes is easily found. When you start to have multiple.
Section 2.6: Probability and Expectation Practice HW (not to hand in) From Barr Text p. 130 # 1, 2, 4-12.
March 10, 2015Applied Discrete Mathematics Week 6: Counting 1 Permutations and Combinations How many different sets of 3 people can we pick from a group.
3. Counting Permutations Combinations Pigeonhole principle Elements of Probability Recurrence Relations.
Section 4.3 Objectives Use a tree diagram and the Fundamental Counting Principle to find probabilities Determine the number of ways a group of objects.
Lesson Counting Techniques. Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting.
Aim: How do we use permutations and combinations to solve probability problems? Do Now: Six students are arranged at random on a bench. What is the probability.
Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting problems using combinations.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications (5 th Edition) Kenneth H. Rosen Chapter 5 Counting.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
The Basics of Counting Section 6.1.
Thinking Mathematically
Probability Basics Section Starter Roll two dice and record the sum shown. Repeat until you have done 20 rolls. Write a list of all the possible.
Discrete Mathematics Lecture # 25 Permutation & Combination.
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.
Counting Principles Multiplication rule Permutations Combinations.
Chapter 7 Section 5.  Binomial Distribution required just two outcomes (success or failure).  Multinomial Distribution can be used when there are more.
Aim: Combinations Course: Alg. 2 & Trig. Do Now: Aim: How do we determine the number of outcomes when order is not an issue? Ann, Barbara, Carol, and.
10-8 Permutations Vocabulary permutation factorial.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.
1 Discrete Structures - CSIS2070 Text Discrete Mathematics and Its Applications Kenneth H. Rosen Chapter 4 Counting.
Solutions to the HWPT problems. 1.How many distinguishable arrangements are there of the letters in the word PROBABILITY? Answer: 11!/(2! 2!) 2.A and.
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.
Special Topics. Calculating Outcomes for Equally Likely Events If a random phenomenon has equally likely outcomes, then the probability of event A is:
An urn contains 1 green, 2 red, and 3 blue marbles. Draw two without replacement. 1/6 2/6 3/6 2/5 3/5 1/5 3/5 1/5 2/5 2/30 3/30 2/30 6/30 3/30 6/30.
Probability Final Review. 1.One marble is drawn at random from a bag containing 2 white, 4 red, and 6 blue marbles Find the probability: One – Basic sixth.
SECTION 5.4 COUNTING. Objectives 1. Count the number of ways a sequence of operations can be performed 2. Count the number of permutations 3. Count the.
1 2.3 Counting Sample Points (6)(6)(6)= 216 Example: How many outcome sequences are possible when a die is rolled three times?
Section The Product Rule  Example: How many different license plates can be made if each plate contains a sequence of three uppercase English letters.
Combinatorial Principles, Permutations, and Combinations
The Multiplication Rule
The Pigeonhole Principle
Sequences, Series, and Probability
Fundamental Counting Principle
Counting Methods and Probability Theory
Generalized Permutations and Combinations
CS100: Discrete structures
8.3 Counting Apply the fundamental counting principle
Chapter 3 Probability.
Combination and Permutations Quiz!
Counting Methods and Probability Theory

Presentation transcript:

Section 1.3 Each arrangement (ordering) of n distinguishable objects is called a permutation, and the number of permutations of n distinguishable objects is Each ordered arrangement of r out of n distinguishable objects is called a permutation of n objects taken r at a time, and the number of possible permutations of n objects taken r at a time is When sampling without replacement, the number of possible ordered samples of r objects taken from a set of n objects is The Multiplication Principle states that if experiment E 1 has n 1 possible outcomes, and for each possible outcome of E 1 experiment E 2 has n 2 possible outcomes, then the composite experiment E 1 E 2 (performing E 1 first and then E 2 ) has possible outcomes. n1n2n1n2 (n)(n – 1)(n – 2)…(3)(2)(1) = n!

1. (a) (b) (c) One box contains 4 red books and 3 blue books. A second box contains 9 green books. Find the number of possible arrangements of all 9 green books on a shelf, if these books can be distinguished from one another. Find the number of possible arrangements of 4 of the 9 green books on a shelf, if these books can be distinguished from one another. 9! = arrangements Suppose books of the same color can be distinguished from one another. If books are selected at random and without replacement, find the number of possible ordered samples of 2 books that could be taken from the box of 4 red books and 3 blue books. Are these samples equally likely?

Section 1.3 Each arrangement (ordering) of n distinguishable objects is called a permutation, and the number of permutations of n distinguishable objects is Each ordered arrangement of r out of n distinguishable objects is called a permutation of n objects taken r at a time, and the number of possible permutations of n objects taken r at a time is (n)(n – 1)(n – 2)…(3)(2)(1) = n! n! (n)(n – 1)(n – 2)…(n – r + 1) = ——— (n – r)! When sampling without replacement, the number of possible ordered samples of r objects taken from a set of n objects is The Multiplication Principle states that if experiment E 1 has n 1 possible outcomes, and for each possible outcome of E 1 experiment E 2 has n 2 possible outcomes, then the composite experiment E 1 E 2 (performing E 1 first and then E 2 ) has possible outcomes. n1n2n1n2 = n P r

1. (a) (b) (c) One box contains 4 red books and 3 blue books. A second box contains 9 green books. Find the number of possible arrangements of all 9 green books on a shelf, if these books can be distinguished from one another. Find the number of possible arrangements of 4 of the 9 green books on a shelf, if these books can be distinguished from one another. 9! = arrangements 9! 9 P 4 =——— = 3024 arrangements (9 – 4)! Suppose books of the same color can be distinguished from one another. If books are selected at random and without replacement, find the number of possible ordered samples of 2 books that could be taken from the box of 4 red books and 3 blue books. Are these samples equally likely?

Section 1.3 Each arrangement (ordering) of n distinguishable objects is called a permutation, and the number of permutations of n distinguishable objects is Each ordered arrangement of r out of n distinguishable objects is called a permutation of n objects taken r at a time, and the number of possible permutations of n objects taken r at a time is (n)(n – 1)(n – 2)…(3)(2)(1) = n! n! (n)(n – 1)(n – 2)…(n – r + 1) = ——— (n – r)! When sampling without replacement, the number of possible ordered samples of r objects taken from a set of n objects is The Multiplication Principle states that if experiment E 1 has n 1 possible outcomes, and for each possible outcome of E 1 experiment E 2 has n 2 possible outcomes, then the composite experiment E 1 E 2 (performing E 1 first and then E 2 ) has possible outcomes. n! (n)(n – 1)(n – 2)…(n – r + 1) = ——— (n – r)! n1n2n1n2 = n P r

1. (a) (b) (c) One box contains 4 red books and 3 blue books. A second box contains 9 green books. Find the number of possible arrangements of all 9 green books on a shelf, if these books can be distinguished from one another. Find the number of possible arrangements of 4 of the 9 green books on a shelf, if these books can be distinguished from one another. 9! = arrangements 9! 9 P 4 =——— = 3024 arrangements (9 – 4)! 7! 7 P 2 =——— = 42 samples (7 – 2)! These samples are equally likely. Suppose books of the same color can be distinguished from one another. If books are selected at random and without replacement, find the number of possible ordered samples of 2 books that could be taken from the box of 4 red books and 3 blue books. Are these samples equally likely?

When sampling with replacement, the number of possible ordered samples of r objects taken from a set of n objects is nrnr When sampling without replacement, the number of possible unordered samples of r objects taken from a set of n objects is Each unordered subset of r out of n distinguishable objects is called a combination of n objects taken r at a time, and the number of possible combinations of n objects taken r at a time is The number of distinguishable permutations of n objects, where r objects are of one type and n – r objects are of another type, is The number of distinguishable permutations of n objects, where r 1 objects are of type 1, r 2 objects are of type 2, …, and r k objects are of type k (See Text Exercise ), is

(d) (e) (f) Suppose books of the same color can be distinguished from one another. If books are selected at random and with replacement, find the number of possible ordered samples of 2 books that could be taken from the box of 4 red books and 3 blue books. Are these samples equally likely? Suppose books of the same color can be distinguished from one another. If books are selected at random and without replacement, find the number of possible unordered samples of 2 books that could be taken from the box of 4 red books and 3 blue books. Are these samples equally likely? Suppose books of the same color can be distinguished from one another. Find the number of possible combinations of the 9 green books taken 3 at a time. Are these samples equally likely? 7 2 = 49 samples These samples are equally likely. 7! ———— = 21 samples 2! (7 – 2)! These samples are equally likely.

When sampling with replacement, the number of possible ordered samples of r objects taken from a set of n objects is nrnr When sampling without replacement, the number of possible unordered samples of r objects taken from a set of n objects is Each unordered subset of r out of n distinguishable objects is called a combination of n objects taken r at a time, and the number of possible combinations of n objects taken r at a time is The number of distinguishable permutations of n objects, where r objects are of one type and n – r objects are of another type, is The number of distinguishable permutations of n objects, where r 1 objects are of type 1, r 2 objects are of type 2, …, and r k objects are of type k (See Text Exercise ), is n! ———— r! (n – r)! (number of ordered samples of r objects) —————————————————————– = (number of permutations of r distinguishable objects ) = n C r n! ———— r! (n – r)! = n C r

(d) (e) (f) Suppose books of the same color can be distinguished from one another. If books are selected at random and with replacement, find the number of possible ordered samples of 2 books that could be taken from the box of 4 red books and 3 blue books. Are these samples equally likely? Suppose books of the same color can be distinguished from one another. If books are selected at random and without replacement, find the number of possible unordered samples of 2 books that could be taken from the box of 4 red books and 3 blue books. Are these samples equally likely? Suppose books of the same color can be distinguished from one another. Find the number of possible combinations of the 9 green books taken 3 at a time. Are these samples equally likely? 7 2 = 49 samples These samples are equally likely. 7! 7 C 2 =———— = 21 samples 2! (7 – 2)! These samples are equally likely. 9! 9 C 3 =———— = 84 samples 3! (9 – 3)! These samples are equally likely.

(g) (h) Find the number of possible arrangements of the 4 red books and 3 blue books on a shelf, if books of the same color can be distinguished from one another. Find the number of possible arrangements of the 4 red books and 3 blue books on a shelf, if books of the same color cannot be distinguished from one another. 7! = 5040 arrangements 7! —— = 35 arrangements 3! 4!

(i)Find the number of possible arrangements of the 9 green books, 4 red books, and 3 blue books on a shelf, if books of the same color cannot be distinguished from one another. Do this two different ways by applying the multiplication principle corresponding to each of the following sets of instructions for arranging the books: Instruction Set #1 Choose the 9 positions for green books. Choose the 4 positions for red books. Choose the 3 positions for blue books. The number of possible arrangements is 16 C 9. 7 C 4. 3 C 3 = 16! ————— 9! (16  9)! 7! ———— 4! (7  4)! 3! ———— = 3! (3  3)! 16! ——— = ! 4! 3!

(i)Find the number of possible arrangements of the 9 green books, 4 red books, and 3 blue books on a shelf, if books of the same color cannot be distinguished from one another. Do this two different ways by applying the multiplication principle corresponding to each of the following sets of instructions for arranging the books: Instruction Set #2 Choose the 3 positions for blue books. Choose the 4 positions for red books. Choose the 9 positions for green books. The number of possible arrangements is 16 C C 4. 9 C 9 = 16! ————— 3! (16  3)! 13! ————— 4! (13  4)! 9! ———— = 9! (9  9)! 16! ——— = ! 4! 9!

When sampling with replacement, the number of possible ordered samples of r objects taken from a set of n objects is nrnr When sampling without replacement, the number of possible unordered samples of r objects taken from a set of n objects is n! ———— r! (n – r)! (number of ordered samples of r objects) —————————————————————– = (number of permutations of r distinguishable objects ) Each unordered subset of r out of n distinguishable objects is called a combination of n objects taken r at a time, and the number of possible combinations of n objects taken r at a time is n! ———— r! (n – r)! The number of distinguishable permutations of n objects, where r objects are of one type and n – r objects are of another type, is The number of distinguishable permutations of n objects, where r 1 objects are of type 1, r 2 objects are of type 2, …, and r k objects are of type k (See Text Exercise ), is n! ———— r! (n – r)! n! ————— r 1 ! r 2 ! … r k ! = n C r

Number of Samples of Size r out of n Objects With Replacement Without Replacement Ordered Unordered nrnr

Suppose books of the same color can be distinguished from one another. If books are selected at random and with replacement, find the number of possible ordered samples of 5 books that could be taken from all 16 books. Are these samples equally likely? Suppose books of the same color can be distinguished from one another. If books are selected at random and without replacement, find the number of possible ordered samples of 5 books that could be taken from all 16 books. Are these samples equally likely? Suppose books of the same color can be distinguished from one another. If books are selected at random and without replacement, find the number of possible unordered samples of 5 books that could be taken from all 16 books. Are these samples equally likely? 16 5 = samplesThese samples are equally likely. 16! 16 P 5 =———— = samples (16 – 5)! These samples are equally likely. (j) (k) (l)

Number of Samples of Size r out of n Objects With Replacement Without Replacement Ordered Unordered nrnr n! ——— (n – r)! = n P r n! ———— r! (n – r)! = n C r nrnr =

Suppose books of the same color can be distinguished from one another. If books are selected at random and with replacement, find the number of possible ordered samples of 5 books that could be taken from all 16 books. Are these samples equally likely? Suppose books of the same color can be distinguished from one another. If books are selected at random and without replacement, find the number of possible ordered samples of 5 books that could be taken from all 16 books. Are these samples equally likely? Suppose books of the same color can be distinguished from one another. If books are selected at random and without replacement, find the number of possible unordered samples of 5 books that could be taken from all 16 books. Are these samples equally likely? 16 5 = samplesThese samples are equally likely. 16! 16 P 5 =———— = samples (16 – 5)! These samples are equally likely. (j) (k) (l)

16 16! 16 C 5 = =————— = 4368 samples 5 5! (16 – 5)! These samples are equally likely. Suppose books of the same color can be distinguished from one another. If books are selected at random and without replacement, find the number of possible unordered samples of 5 books that could be taken from all 16 books. Are these samples equally likely? (l)

Suppose books of the same color can be distinguished from one another. If 5 books are selected at random and with replacement, find the probability that the first 3 books selected are green, the 4th book selected is red, and the 5th book selected is blue. (m) 16 5 (9 3 )(4)(3) 16 5 = equally likely samples of any 5 books (9 3 )(4)(3) = 8748 samples with the first 3 books selected green, the 4th book selected red, and the 5th book selected blue = (NOTE: When the calculations are difficult, it is generally acceptable to leave the answer is a “ready-to-calculate” format.) Suppose books of the same color can be distinguished from one another. If 5 books are selected at random and without replacement, find the probability that the first 3 books selected are green, the 4th book selected is red, and the 5th book selected is blue. (n)

Suppose books of the same color can be distinguished from one another. If 5 books are selected at random and without replacement, find the probability that the first 3 books selected are green, the 4th book selected is red, and the 5th book selected is blue. (n) (16)(15)(14)(13)(12) (9)(8)(7)(4)(3) 6048 samples with the first 3 books selected green, the 4th book selected red, and the 5th book selected blue = ! 16 P 5 =———— = (16)(15)(14)(13)(12) = (16 – 5)! equally likely samples of any 5 books 9! 9 P 3 =————(4)(3) = (9)(8)(7)(4)(3) = (9 – 3)! (NOTE: When the calculations are difficult, it is generally acceptable to leave the answer is a “ready-to-calculate” format.)

Suppose books of the same color can be distinguished from one another. If 5 books are selected at random and without replacement, find the probability that 3 books are green, 1 book is red, and 1 book is blue. (o) 1008 samples with the first 3 books selected green, the 4th book selected red, and the 5th book selected blue = ! 16 C 5 =————— = (16)(14)(13) = ! (16 – 5)! equally likely samples of any 5 books 9! 9 C 3 =————(4)(3) = 3! (9 – 3)! (NOTE: When the calculations are difficult, it is generally acceptable to leave the answer is a “ready-to-calculate” format.)

Suppose books of the same color can be distinguished from one another. If books are selected at random and with replacement, find the number of possible unordered samples of 5 books that could be taken from all 16 books. Are these samples equally likely? (p) If we label the books b1, b2, b3, …, b16, then we can observe that the unordered sample {b1, b1, b1, b1, b1} can occur in only one way, whereas the unordered sample {b1, b1, b1, b2, b2} can occur in ways. Therefore, these samples are not equally likely. 10 To count the number of possible samples, we can represent each possible sample with a sequence of 15 slashes (/) and 5 zeros (0). The number of times b1 occurs in the sample is designated by the number of zeros to the left of the first slash, the number of times b2 occurs in the sample is designated by the number of zeros to the left of the second slash and to the right of the first slash, etc / / / / / / / / / / / / / / / represents the sample{b1, b1, b1, b1, b1}. 000 / 00 / / / / / / / / / / / / / / represents the sample{b1, b1, b1, b2, b2}. / / 0 / / 00 / / / / 00 / / / / / / / represents the sample{b3, b5, b5, b9, b9}.

Suppose books of the same color can be distinguished from one another. If books are selected at random and with replacement, find the number of possible unordered samples of 5 books that could be taken from all 16 books. Are these samples equally likely? (p) 20 20! 20 C 5 = =————— = samples 5 5! (20 – 5)! The number of possible samples is These samples are not equally likely.

Number of Samples of Size r out of n Objects With Replacement Without Replacement Ordered Unordered nrnr n! ——— (n – r)! = n P r (n + r – 1)! ———— r! (n – 1)! n! ———— r! (n – r)! = n C r nrnr =

2. (a) (b) An urn contains 7 red chips, 8 blue chips, and 9 white chips. Find the probability of selecting a red chip on the first draw, blue chips on the second, third, and fourth draws, and white chips on the remaining draws if eight chips are selected at random and without replacement. selecting a red chip on the first draw, blue chips on the second, third, and fourth draws, and white chips on the remaining draws if eight chips are selected at random and with replacement. (24)(23)(22)(21)(20)(19)(18)(17) (7)(8)(7)(6)(9)(8)(7)(6) or 24! — 16! 7! — 6! 8! — 5! 9! — 5! 24 8 (7)(8 3 )(9 4 )

selecting one red chip, three blue chips, and four white chips if eight chips are selected at random and without replacement. selecting one red chip, three blue chips, and four white chips if eight chips are selected at random and with replacement. (c) (d) or 24! — 16! 7! — 6! 8! — 5! 9! — 5! 8! 1! 3! 4! 24 8 (7)(8 3 )(9 4 )8! 1! 3! 4!

(e) (f) selecting all white chips if five chips are selected at random and without replacement. (24)(23)(22)(21)(20) (9)(8)(7)(6)(5) or 24! — 19! 9! — 4! or selecting all white chips if five chips are selected at random and with replacement

(g) (h) exactly four white chips if seven chips are selected at random and without replacement exactly four white chips if seven chips are selected at random and with replacement (9 4 )(15 3 )7! 3! 4!

(i) (j) selecting no red chips if three chips are selected at random and without replacement. selecting no red chips if three chips are selected at random and with replacement

– (k) (l) selecting at least one blue chip if five chips are selected at random and without replacement. selecting at least one blue chip if five chips are selected at random and with replacement –

(m) (n) selecting exactly two red chips if six chips are selected at random and without replacement. selecting exactly two red chips if six chips are selected at random and with replacement (7 2 )(17 4 )6! 2! 4!

(o) (p) selecting more than 20 chips in order to get the fifth blue chip if chips are selected at random and without replacement. selecting more than 20 chips in order to get the fifth blue chip if chips are selected at random and with replacement (8)(16 19 ) 20! 1! 19! + (8 2 )(16 18 ) 20! 2! 18! + (8 3 )(16 17 ) 20! 3! 17! + (8 4 )(16 16 ) 20! 4! 16!

(q) (r) selecting a white chip on the third try if chips are selected at random and without replacement. selecting a white chip on the third try if chips are selected at random and with replacement. 9 3 — = — — = — 24 8

3. (a) (b) An urn contains one red chip labeled with the integer 1, two blue chips labeled distinctively with the integers 1 and 2, three white chips labeled distinctively with the integers 1, 2, and 3. Two chips are randomly selected without replacement and the random variable X = "sum of the observed integers" is recorded. Find each of the following: P(X < 4) = P(X > 2) = P(X = 2) + P(X = 3) = 1 — — = 5 3 — 5 1 – P(X = 2) = 1 1 – — = 5 4 — 5 Two chips are randomly selected with replacement and the random variable X = "sum of the observed integers" is recorded. Find each of the following: P(X < 4) = P(X > 2) = P(X = 2) + P(X = 3) = 1 — — = 3 7 — 12 1 – P(X = 2) = 1 1 – — = 4 3 — 4