Precálculo- 5ta Edición- James Stewart- Lothar Redlin- Saleem Watson
College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson
description
Transcript of College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson
![Page 1: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/1.jpg)
College AlgebraFifth EditionJames Stewart Lothar Redlin Saleem Watson
![Page 2: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/2.jpg)
Counting
and Probability10
![Page 3: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/3.jpg)
Permutations and
Combinations10.2
![Page 4: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/4.jpg)
Introduction
In this section, we single out two important
special cases of the Fundamental Counting
Principle
• Permutations
• Combinations
![Page 5: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/5.jpg)
Permutations
![Page 6: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/6.jpg)
Permutations
A permutation of a set of distinct objects is
an ordering of these objects.
• For example, some permutations of the letters ABCDWXYZ are
XAYBZWCD ZAYBCDWXDBWAZXYC YDXAWCZB
• How many such permutations are possible?
![Page 7: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/7.jpg)
Permutations
Since there are:• Eight choices for the first position,
• Seven for the second(after the first has been chosen),
• Six for the third(after the first two have been chosen),
• And so on.
• The Fundamental Counting Principle tells us that the number of possible permutations is
8 × 7 × 6 × 5 × 4 × 3 × 2 × 1 = 40,320
![Page 8: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/8.jpg)
Permutations
This same reasoning with 8 replaced by n
leads to the following observation.
• The number of permutations of n objects is n!.
![Page 9: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/9.jpg)
Permutations
How many permutations consisting of five
letters can be made from these same eight
letters?
• Some of these permutations are
XYZWC AZDWXAZXYB WDXZB
![Page 10: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/10.jpg)
Permutations
Again, there are eight choices for the first
position, seven for the second, six for the
third, five for the fourth, and four for the fifth.
• By the Fundamental Counting Principle, the number of such permutations is
8 × 7 × 6 × 5 × 4 = 6,720
![Page 11: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/11.jpg)
Permutations of n Objects Taken r at a Time
In general, if a set has n elements, then the
number of ways of ordering r elements from
the set is denoted P(n, r).
• This is called the number of permutations of n objects taken r at a time.
• We have just shown that P(8, 5) = 6,720.
![Page 12: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/12.jpg)
Permutations of n Objects Taken r at a Time
The same reasoning that was used to find
P(8, 5) will help us find a general formula
for P(n, r).
• Indeed, there are n objects and r positionsto place them in.
• Thus, there are n choices for the first position,n – 1 choices for the second position, and so on.
• The last position can be filled in n – r + 1 ways.
![Page 13: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/13.jpg)
Permutations of n Objects Taken r at a Time
By the Fundamental Counting Principle,
P(n, r) = n(n – 1)(n – 2)…(n – r + 1)
• This formula can be written more compactlyusing factorial notation:
( , ) ( 1)( 2)...( 1)
( 1)( 2)...( 1)( )...3 2 1
( )...3 2 1
!
( )!
P n r n n n n r
n n n n r n r
n r
n
n r
![Page 14: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/14.jpg)
Permutations of n Objects Taken r at a Time
The number of permutations of n objects
taken r at a time is
!
( , )( )!
nP n r
n r
![Page 15: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/15.jpg)
E.g. 1—Finding the Number of Permutations
A club has nine members.
• In how many ways can a president,vice president, and secretary bechosen from the members of this club?
• We need the number of ways of selectingthree members, in order, for these positionsfrom the nine club members.
![Page 16: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/16.jpg)
E.g. 1—Finding the Number of Permutations
This number is
9!(9,3)
(9 3)!
9!
6!9 8 7
504
P
![Page 17: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/17.jpg)
From 20 raffle tickets in a hat, four tickets are
to be selected in order.
• The holder of the first ticket wins a car,
• The second a motorcycle,
• The third a bicycle,
• And, the fourth a skateboard.
E.g. 2—Finding the Number of Permutations
![Page 18: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/18.jpg)
E.g. 2—Finding the Number of Permutations
In how many different ways can these prizes
be awarded?
• The order in which the tickets are chosen determines who wins each prize.
• So, we need to find the number of ways of selecting four objects, in order, from 20 objects(the tickets).
![Page 19: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/19.jpg)
E.g. 2—Finding the Number of Permutations
This number is
20!(20,4)
(20 4)!
20!
16!20 19 18 17
116,280
P
![Page 20: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/20.jpg)
Distinguishable Permutations
![Page 21: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/21.jpg)
Distinguishable Permutations
If we have a collection of ten balls, each a
different color, then the number of
permutations of these balls is P(10, 10) = 10!.
• If all ten balls are red, then we have justone distinguishable permutation becauseall the ways of ordering these balls lookexactly the same.
![Page 22: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/22.jpg)
Distinguishable Permutations
In general, in considering a set of objects,
some of which are the same kind:
• Then, two permutations are distinguishableif one cannot be obtained from the other byinterchanging the positions of elements of the same kind.
![Page 23: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/23.jpg)
Distinguishable Permutations
For example, if we have ten balls, of which
• Six are red
• The other four are each a different color
Then, how many distinguishable permutations
are possible?
![Page 24: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/24.jpg)
Distinguishable Permutations
The key point here is that balls of the same color are
not distinguishable.
• So each arrangement of the red balls, keeping all theother balls fixed, gives essentially the same permutation.
• There are 6! rearrangements of the red ball for eachfixed position of the other balls.
• Thus, the total number of distinguishable permutations is 10!/6!.
• The same type of reasoning gives the followinggeneral rule.
![Page 25: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/25.jpg)
Distinguishable Permutations
If a set of n objects consists of k different
kinds of objects with
• n1 objects of the first kind,n2 objects of the first kind,n3 objects of the first kind, and so on,
• where n1 + n2 + …+ nk = n.
• Then, the number of distinguishable permutations of these objects is
1 2 3
!
! ! ! ... !k
n
n n n n
![Page 26: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/26.jpg)
E.g. 3—The Number of Distinguishable Permutations
Find the number of different ways of placing
15 balls in a row given that 4 are red, 3 are
yellow, 6 are black, and 2 are blue.
• We want to find the number of distinguishable permutations of these balls.
• By the formula, this number is
15!
6,306,3004!3!6!2!
![Page 27: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/27.jpg)
Partitions
Suppose we have 15 wooden balls in a row
and four colors of paint: red, yellow, black,
and blue.
• In how many different ways can the 15 ballsbe painted in such a way that we have 4 red,3 yellow, 6 black, and 2 blue balls?
• A little thought will show that this number isexactly the same as that calculated inExample 3.
![Page 28: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/28.jpg)
Partitions
This way of looking at the problem is
somewhat different, however.
• Here we think of the number of ways topartition the balls into four groups.
• Each containing 4, 3, 6, and 2 balls to bepainted red, yellow, black, and blue,respectively.
• The next example shows how this reasoningis used.
![Page 29: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/29.jpg)
E.g. 4—Finding the Number of Partitions
Fourteen construction workers are to be
assigned to three different tasks.
• Seven workers are needed for mixing cement,five for laying brick, and two for carrying the bricks to the brick layers.
• In how many different ways can the workersbe assigned to these tasks?
![Page 30: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/30.jpg)
E.g. 4—Finding the Number of Partitions
We need to partition the workers into three
groups containing 7, 5, and 2 workers,
respectively.
• This number is
14!
72,0727!5!2!
![Page 31: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/31.jpg)
Combinations
![Page 32: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/32.jpg)
Permutations and Ordering
When finding permutations, we are interested
in the number of ways of ordering elements of
a set.
• In many counting problems, however, order isnot important.
• For example, a poker hand is the same hand, regardless of how it is ordered.
![Page 33: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/33.jpg)
Permutations and Ordering
A poker player who is interested in the
number of possible hands wants to know
the number of ways of drawing five cards
from 52 cards.
• Without regard to the order in which the cardsof a given hand are dealt.
• We know develop a formula for counting in situations such as this, in which order doesn’t matter.
![Page 34: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/34.jpg)
Combination
A combination of r elements of a set is any
subset of r elements from the sets.
• Without regard to order.
• If the set has n elements, then the numberof combinations of r elements is denotedby C(n, r).
• This number is called the number ofcombinations of n elements taken r at a time.
![Page 35: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/35.jpg)
Combinations
For example, consider a set with four
elements, A, B, C, and D.
• The combinations for these four elementstaken three at a time are
ABC ABD ACD BCD
![Page 36: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/36.jpg)
Permutation vs. Combination
The permutations of these elements taken three at a time are
ABC ABD ACD BCD
ACB ADB ADC BDC
BAC BAD CAD CBD
BCA BDA CDA CDB
CAB DAB DAC DBC
CBA DBA DCA DCB
![Page 37: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/37.jpg)
Permutation vs. Combination
We notice that the number of combinations is
a lot fewer than the number of permutations.
• In fact, each combination of the three elementsgenerates 3! permutations.
• So
(4,3) 4!(4,3) 4
3! 3!(4 3)!
PC
![Page 38: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/38.jpg)
Permutation vs. Combination
In general, each combination of r objects
gives rise to r! permutations of these objects.
Thus,
( , ) !( , )
! !( )!
P n r nC n r
r r n r
![Page 39: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/39.jpg)
Combinations of n Objects Taken r at a Time
The number of combinations of n objects
taken r at a time is
!
( , )!( )!
nC n r
r n r
![Page 40: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/40.jpg)
Permutation vs. Combination
The key difference between permutations and combinations is order.
• If we are interested in ordered arrangements,then we are counting permutations.
• But, if we are concerned with subsets withoutregard to order, then we are countingcombinations.
• Compare Examples 5 and 6 (where order doesn’t matter) with Examples 1 and 2 (where order does matter).
![Page 41: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/41.jpg)
E.g. 5—Finding the Number of Combinations
A club has nine members.
• In how many ways can a committee of threebe chosen from the members of this club?
![Page 42: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/42.jpg)
E.g. 5—Finding the Number of Combinations
We need the number of ways of choosing
three of nine members.
• Order is not important here.
• The committee is the same no matter howits members are ordered.
• So we want the number of combinations ofnine objects (the club members) taken threeat a time.
![Page 43: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/43.jpg)
E.g. 5—Finding the Number of Combinations
This number is
9!(9,3)
3!(9 3)!
9!
3!6!9 8 7
3 2 184
C
![Page 44: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/44.jpg)
From 20 raffle tickets in a hat, four tickets are
to be chosen at random.
• The holder of the tickets are to be awardedfree trips to the Bahamas.
• In how many ways can the four winners bechosen?
E.g. 6—Finding the Number of Combinations
![Page 45: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/45.jpg)
E.g. 6—Finding the Number of Combinations
We need to find the number of ways of
choosing four winners from 20 entries.
• The order in which the tickets are chosendoesn’t matter.
• The same prize is awarded to each of thefour winners.
• So, we want the number of combinations of 20 objects (the tickets) taken four at a time.
![Page 46: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/46.jpg)
E.g. 6—Finding the Number of Combinations
This number is
20!(20,4)
4!(20 4)!
20!
4!16!20 19 18 17
4 3 2 14,845
C
![Page 47: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/47.jpg)
The Number of Subsets of a Set
If a set S has n elements, then C(n, k) is the
number of ways of choosing k elements from
S.• That is, the number of k-element subsets of S.
• Thus, the number of subsets of S of all possiblesizes is given by the sum
C(n, 0) + C(n, 1) + C(n, 2) + …+ C(n, n) = 2n
• See Section 9.6, Exercise 56, where this sum is discussed.
![Page 48: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/48.jpg)
E.g. 7—Finding the Number of Subsets of a Set
A pizza parlor offers the basic cheese pizza
and a choice of 16 toppings.
• How many different kinds of pizzas can beordered at this pizza parlor?
![Page 49: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/49.jpg)
E.g. 7—Finding the Number of Subsets of a Set
We need the number of possible subsets of
the 16 toppings.
• Including the empty set, which correspondsto a plain cheese pizza.
• Thus, 216 = 65,536 different pizzas can beordered.
![Page 50: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/50.jpg)
Problem Solving with
Permutations and
Combinations
![Page 51: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/51.jpg)
Solving Counting Problems
The crucial step in solving counting problems
is deciding whether to use
• Permutations
• Combinations
• Or, the Fundamental Counting Principle.
In some cases, the solution of a problem may
require using more than one of these
principles.
![Page 52: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/52.jpg)
Guidelines for Solving Counting Problems
Here are some general guidelines to help us
decide how to apply these principles.
1. Fundamental Counting Principle
2. Does the Order Matter?
![Page 53: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/53.jpg)
Guidelines for Counting Problems—Step 1
Fundamental Counting Principle
• When consecutive choices are being made,use the Fundamental Counting Principle.
![Page 54: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/54.jpg)
Guidelines for Counting Problems—Step 2
Does the Order Matter?
• We want to find the number of ways of picking r objects from n objects.
• Then, we need to ask ourselves,“Does the order in which we pick the objectsmatter?”
• If the order matters, we use permutations.
• If the order doesn’t matter, we use combinations.
![Page 55: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/55.jpg)
E.g. 8—A Problem Involving Combinations
A group of 25 campers contains 15 women
and 10 men.
• In how many ways can a scouting party of 5be chosen if it must consist of 3 women and2 men?
![Page 56: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/56.jpg)
E.g. 8—A Problem Involving Combinations
We see that
• Three women can be chosen from the 15 womenin the group in C(15, 3) ways.
• Two men can be chosen from the 10 men in thegroup in C(10, 2) ways.
• Thus, by the Fundamental Counting Principle,the number of ways of choosing the scoutingparty is
C(15, 3) × C(10, 2) = 455 × 45 = 20,475
![Page 57: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/57.jpg)
E.g. 9—A Combination-Permutation Problem
A committee of seven is to be chosen from
a class of 20 students.
• The committee consists of a chairman,a vice chairman, a secretary, and four other members.
• In how many ways can this committee be chosen?
![Page 58: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/58.jpg)
E.g. 9—A Combination-Permutation Problem
In choosing the three officers, order is important.
• So the number of ways of choosing them isP(20, 3) = 6,840
Next, we need to choose four other studentsfrom the 17 remaining.
• Since order doesn’t matter, the number of ways of doing this is
C(17, 4) = 2,380
![Page 59: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/59.jpg)
E.g. 9—A Combination-Permutation Problem
Thus, by the Fundamental Counting Principle,
the number of ways of choosing this
committee is
P(20, 3) × C(17, 4) = 6,840 × 2,380
= 16,279,200
![Page 60: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/60.jpg)
E.g. 10—A Group Photograph
Twelve employees at a company picnic are to
stand in a row for a group photograph.
In how many ways can this be done if
a) Jane and John insist on standing next to each other?
a) Jane and John refuse to stand next to each other?
![Page 61: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/61.jpg)
E.g. 10—A Group Photograph
Since the order in which the people stand is
important, we use permutations.
• But, we can’t use the formula of permutations directly.
• Since Jane and John insist on standing together,let think of them as one object.
Example (a)
![Page 62: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/62.jpg)
E.g. 10—A Group Photograph
Thus, we have 11 objects to arrange in a row.
• There are P(11, 11) ways of doing this.
• For each of these arrangements, there are two ways of having Jane and John standtogether:
– Jane-John or John-Jane
Example (a)
![Page 63: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/63.jpg)
E.g. 10—A Group Photograph
Thus, by the Fundamental Counting Principle,
the total number of arrangements is
2 × P(11, 11) = 2 × 11! = 79,833,600
Example (a)
![Page 64: College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson](https://reader037.fdocuments.us/reader037/viewer/2022103100/56813a2e550346895da21738/html5/thumbnails/64.jpg)
E.g. 10—A Group Photograph
There are P(12, 12) ways of arranging the12 people.
• Of these, 2 × P(11, 11) have Jane and John standing together (by part (a)).
• All the rest have Jane and John standing apart.
• So, the number of arrangements with Jane and John apart is
P(12, 12) – 2 × P(11, 11) = 12! – 2 × 11! = 399,168,000
Example (b)