Topics
>
Precalculus>
Combinations and Permutations>
Permutation Problems>
Permutation Problems 2Permutation Problems 2
Try VividMath Premium to unlock full access
Time limit: 0
Quiz summary
0 of 5 questions completed
Questions:
- 1
- 2
- 3
- 4
- 5
Information
–
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading...
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
Loading...
- 1
- 2
- 3
- 4
- 5
- Answered
- Review
-
Question 1 of 5
1. Question
How many ways can 88 paintings be arranged in a row?- (40320)
Hint
Help VideoCorrect
Great Work!
Incorrect
Need TextPlayCurrent Time 0:00/Duration Time 0:00Remaining Time -0:00Stream TypeLIVELoaded: 0%Progress: 0%0:00Fullscreen00:00MutePlayback Rate1x- 2x
- 1.5x
- 1.25x
- 1x
- 0.75x
- 0.5x
Subtitles- subtitles off
Captions- captions off
- English
Chapters- Chapters
Use the permutations formula to find the number of ways an item can be arranged (r)(r) from the total number of items (n)(n).Remember that order is important in Permutations.Permutation Formula
nPr=n!(n−r)!nPr=n!(n−r)!Fundamental Counting Principle
number of ways ==mm××nnMethod OneSolve the problem using the Fundamental Counting PrincipleFirst, count the options for each position in the rowFirst position:There are 88 paintings to choose from==88Second position:From 88 paintings, one has already been chosen. Hence, we are left with 77 choices==77Third position:From 88 paintings, two has already been chosen. Hence, we are left with 66 choices==66Fourth position:From 88 paintings, three has already been chosen. Hence, we are left with 55 choices==55Fifth position:From 88 paintings, four has already been chosen. Hence, we are left with 44 choices==44Sixth position:From 88 paintings, five has already been chosen. Hence, we are left with 33 choices==33Seventh position:From 88 paintings, six has already been chosen. Hence, we are left with 22 choices==22Eighth position:From 88 paintings, seven has already been chosen. Hence, we are left with 11 choice==11Use the Fundamental Counting Principle and multiply the number of options for each row.number of ways == mm××nn Fundamental Counting Principle == 88××77××66××55××44××33××22××11 == 40 32040 320 There are 40 32040 320 ways to arrange 88 paintings40 32040 320Method TwoWe are arranging 88 paintings (r)(r) for 88 positions in a row (n)(n)r=8r=8n=8n=8nPrnPr == n!(n−r)!n!(n−r)! Permutation Formula 8P88P8 == 8!(8−8)!8!(8−8)! Substitute the value of nn and rr == 8!0!8!0! == 8⋅7⋅6⋅5⋅4⋅3⋅2⋅118⋅7⋅6⋅5⋅4⋅3⋅2⋅11 0!=10!=1 == 40 32040 320 There are 40 32040 320 ways to arrange 88 paintings40 32040 320 -
Question 2 of 5
2. Question
Out of 88 paintings, how many ways can 55 paintings be chosen to be arranged in a row?- (6720)
Hint
Help VideoCorrect
Well Done!
Incorrect
Need TextPlayCurrent Time 0:00/Duration Time 0:00Remaining Time -0:00Stream TypeLIVELoaded: 0%Progress: 0%0:00Fullscreen00:00MutePlayback Rate1x- 2x
- 1.5x
- 1.25x
- 1x
- 0.75x
- 0.5x
Subtitles- subtitles off
Captions- captions off
- English
Chapters- Chapters
Use the permutations formula to find the number of ways an item can be arranged (r)(r) from the total number of items (n)(n).Remember that order is important in Permutations.Permutation Formula
nPr=n!(n−r)!nPr=n!(n−r)!Fundamental Counting Principle
number of ways ==mm××nnMethod OneSolve the problem using the Fundamental Counting PrincipleFirst, count the options for each position in the rowFirst position:There are 88 paintings to choose from==88Second position:From 88 paintings, one has already been chosen. Hence, we are left with 77 choices==77Third position:From 88 paintings, two has already been chosen. Hence, we are left with 66 choices==66Fourth position:From 88 paintings, three has already been chosen. Hence, we are left with 55 choices==55Fifth position:From 88 paintings, four has already been chosen. Hence, we are left with 44 choices==44Use the Fundamental Counting Principle and multiply each draw’s number of options.number of ways == mm××nn Fundamental Counting Principle == 88××77××66××55××44 == 67206720 There are 67206720 ways to arrange 55 paintings out of 8867206720Method TwoWe are arranging 55 paintings (r)(r) out of 88 paintings(n)(n)r=5r=5n=8n=8nPrnPr == n!(n−r)!n!(n−r)! Permutation Formula 8P88P8 == 8!(8−5)!8!(8−5)! Substitute the value of nn and rr == 8!3!8!3! == 8⋅7⋅6⋅5⋅4⋅3⋅2⋅13⋅2⋅18⋅7⋅6⋅5⋅4⋅3⋅2⋅13⋅2⋅1 = 6720 Cancel like terms and evaluate There are 6720 ways to arrange 5 paintings out of 86720 -
Question 3 of 5
3. Question
In a box containing 8 cards marked 1-8, what is the probability of drawing 345 in that order?- 1.
-
2.
156 -
3.
1112 -
4.
649
Hint
Help VideoCorrect
Excellent!
Incorrect
Need TextPlayCurrent Time 0:00/Duration Time 0:00Remaining Time -0:00Stream TypeLIVELoaded: 0%Progress: 0%0:00Fullscreen00:00MutePlayback Rate1x- 2x
- 1.5x
- 1.25x
- 1x
- 0.75x
- 0.5x
Subtitles- subtitles off
Captions- captions off
- English
Chapters- Chapters
Probability
favourableoutcometotaloutcomePermutation Formula
nPr=n!(n−r)!First, find the total number of ways we can draw 3 cards (r) from a box containing 8 cards (n)r=3n=8nPr = n!(n−r)! Permutation Formula 8P3 = 8!(8−3)! Substitute the values of n and r = 8!5! = 8⋅7⋅6⋅5⋅4⋅3⋅2⋅15⋅4⋅3⋅2⋅1 = 336 Cancel like terms and evaluate There are 336 ways to draw 3 cards from a box containing 8 cards. This is the total outcomeRemember that we want to draw the cards 345 in that order. This means that the favourable outcome is only 1.Compute for the probability.Probability = favourableoutcometotaloutcome = 1336 The probability of drawing the cards 345 in that order is 13361336 -
Question 4 of 5
4. Question
In a horse race with 13 competing horses, what is the probability of winning a Trifecta (successfully selecting the 1st, 2nd and 3rd places)?-
1.
51716 -
2.
1356 -
3.
2163 -
4.
11716
Hint
Help VideoCorrect
Keep Going!
Incorrect
Need TextPlayCurrent Time 0:00/Duration Time 0:00Remaining Time -0:00Stream TypeLIVELoaded: 0%Progress: 0%0:00Fullscreen00:00MutePlayback Rate1x- 2x
- 1.5x
- 1.25x
- 1x
- 0.75x
- 0.5x
Subtitles- subtitles off
Captions- captions off
- English
Chapters- Chapters
Probability
favourableoutcometotaloutcomePermutation Formula
nPr=n!(n−r)!First, find the total number of ways we can select 3 horses (r) out of 13 (n)r=3n=13nPr = n!(n−r)! Permutation Formula 13P3 = 13!(13−3)! Substitute the values of n and r = 13!10! = 13⋅12⋅11⋅10⋅9⋅8⋅7⋅6⋅5⋅4⋅3⋅2⋅110⋅9⋅8⋅7⋅6⋅5⋅4⋅3⋅2⋅1 = 1716 Cancel like terms and evaluate There are 1716 ways to select 3 horses from 13 competing horses in the race. This is the total outcomeRemember that we want to successfully pick the 1st, 2nd and 3rd ranking horse. This means that the favourable outcome is only 1.Compute for the probability.Probability = favourableoutcometotaloutcome = 11716 The probability of a trifecta is 1171611716 -
1.
-
Question 5 of 5
5. Question
How many ways can we draw 3 cards from a box containing 8 cards marked with 1-8, if each card is drawn with replacement?- (512)
Hint
Help VideoCorrect
Great Work!
Incorrect
Need TextPlayCurrent Time 0:00/Duration Time 0:00Remaining Time -0:00Stream TypeLIVELoaded: 0%Progress: 0%0:00Fullscreen00:00MutePlayback Rate1x- 2x
- 1.5x
- 1.25x
- 1x
- 0.75x
- 0.5x
Subtitles- subtitles off
Captions- captions off
- English
Chapters- Chapters
Fundamental Counting Principle
number of ways =m×nFirst, count the options for each drawRemember that the cards are being drawn with replacementFirst to Third draw:There 8 cards in the box. Since each drawn card is replaced, all three draws have 8 options=8Use the Fundamental Counting Principle and multiply each category’s number of options.number of ways = m×n Fundamental Counting Principle = 8×8×8 = 512 There are 512 ways of drawing 3 cards from the box with replacement512
Quizzes
- Factorial Notation
- Fundamental Counting Principle 1
- Fundamental Counting Principle 2
- Fundamental Counting Principle 3
- Combinations 1
- Combinations 2
- Combinations with Restrictions 1
- Combinations with Restrictions 2
- Combinations with Probability
- Basic Permutations 1
- Basic Permutations 2
- Basic Permutations 3
- Permutation Problems 1
- Permutation Problems 2
- Permutations with Repetitions 1
- Permutations with Repetitions 2
- Permutations with Restrictions 1
- Permutations with Restrictions 2
- Permutations with Restrictions 3
- Permutations with Restrictions 4