Permutation Problems 1
Try VividMath Premium to unlock full access
Time limit: 0
Quiz summary
0 of 6 questions completed
Questions:
- 1
- 2
- 3
- 4
- 5
- 6
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
- 6
- Answered
- Review
-
Question 1 of 6
1. Question
How many six-digit numbers can be formed using the numbers in 2 971 8352 971 835- (5040)
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, list down all place values and count the options for eachFirst digit:We can choose number 77 digits from 2 971 8352 971 835==77Second digit:From 2 971 8352 971 835, one has already been chosen for the First digit. Hence we are left with 66 choices==66Third digit:From 2 971 8352 971 835, two has already been chosen for the First and Second digits. Hence we are left with 55 choices==55Fourth digit:From 2 971 8352 971 835, three has already been chosen for the First, Second and Third digits. Hence we are left with 44 choices==44Fifth digit:From 2 971 8352 971 835, four has already been chosen for the First, Second, Third and Fourth digits. Hence we are left with 33 choices==33Sixth digit:From 2 971 8352 971 835, five has already been chosen for the First, Second, Third, Fourth and Fifth digits. Hence we are left with 22 choices==22Use the Fundamental Counting Principle and multiply each category’s number of options.number of ways == mm××nn Fundamental Counting Principle == 77××66××55××44××33××22 == 50405040 50405040 six-digit numbers can be formed using the numbers in 2 971 8352 971 835.50405040Method TwoSolve the problem using PermutationWe need to form 66-digit numbers (r)(r) from the number 2 971 8352 971 835 which has 77 digits (n)(n)r=6r=6n=7n=7nPrnPr == n!(n−r)!n!(n−r)! Permutation Formula 7P67P6 == 7!(7−6)!7!(7−6)! Substitute the values of nn and rr == 7!1!7!1! == 7⋅6⋅5⋅4⋅3⋅2⋅117⋅6⋅5⋅4⋅3⋅2⋅11 == 50405040 Cancel like terms and evaluate 50405040 six-digit numbers can be formed using the numbers in 2 971 8352 971 835.50405040 -
Question 2 of 6
2. Question
How many ways can 33 cards be drawn from a box containing 88 cards marked with numbers 11-88?- (336)
Hint
Help VideoCorrect
Nice Job!
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, list down all draws and count the options for eachFirst draw:The box contains 88 cards==88Second draw:One card has already been drawn from the box. Hence we are left with 77 cards==77Third draw:Two cards has already been drawn from the box. Hence we are left with 66 cards==66Use the Fundamental Counting Principle and multiply each draw’s number of options.number of ways == mm××nn Fundamental Counting Principle == 88××77××66 == 336336 There are 336336 ways to draw 33 cards from a box containing 88 cards336336Method TwoSolve the problem using PermutationWe need to draw 33 cards (r)(r) from a box containing 88 cards (n)(n)r=3r=3n=8n=8nPrnPr == n!(n−r)!n!(n−r)! Permutation Formula 8P38P3 == 8!(8−3)!8!(8−3)! Substitute the values of nn and rr == 8!5!8!5! == 8⋅7⋅6⋅5⋅4⋅3⋅2⋅15⋅4⋅3⋅2⋅18⋅7⋅6⋅5⋅4⋅3⋅2⋅15⋅4⋅3⋅2⋅1 == 336336 Cancel like terms and evaluate There are 336336 ways to draw 33 cards from a box containing 88 cards336336 -
Question 3 of 6
3. Question
How many ways can a Captain and Vice Captain be chosen from 1313 soccer players?- (156)
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
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 =m×nMethod OneSolve the problem using the Fundamental Counting PrincipleFirst, count the options for each stageChoosing the captain:There are 13 soccer players=13Choosing a Vice Captain:One card has already been chosen to be the Captain. Hence we are left with 12 soccer players=12Use the Fundamental Counting Principle and multiply each draw’s number of options.number of ways = m×n Fundamental Counting Principle = 13×12 = 156 There are 156 ways to choose the Captain and Vice Captain out of 13 soccer players156Method TwoSolve the problem using PermutationWe need to choose 2 players to be the Captain and Vice Captain (r) from 13 soccer players(n)r=2n=13nPr = n!(n−r)! Permutation Formula 13P2 = 13!(13−2)! Substitute the values of n and r = 13!11! = 13⋅12⋅11⋅10⋅9⋅8⋅7⋅6⋅5⋅4⋅3⋅2⋅111⋅10⋅9⋅8⋅7⋅6⋅5⋅4⋅3⋅2⋅1 = 156 Cancel like terms and evaluate There are 156 ways to choose the Captain and Vice Captain out of 13 soccer players156 -
Question 4 of 6
4. Question
How many ways can a complete soccer team of 11 players be formed from 13 soccer players?- 1.
-
2.
2578 -
3.
143 -
4.
3 113 510 400
Hint
Help VideoCorrect
Fantastic!
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) from the total number of items (n).Remember that order is important in Permutations.Permutation Formula
nPr=n!(n−r)!Fundamental Counting Principle
number of ways =m×nMethod OneSolve the problem using the Fundamental Counting PrincipleFirst, count the options for each stageFirst player:There are 13 soccer players to choose from=13Second player:From 13 players, one has already been chosen. Hence, we are left with 12 choices=12Third player:From 13 players, two has already been chosen. Hence, we are left with 11 choices=11Fourth player:From 13 players, three has already been chosen. Hence, we are left with 10 choices=10Fifth player:From 13 players, four has already been chosen. Hence, we are left with 9 choices=9Sixth player:From 13 players, five has already been chosen. Hence, we are left with 8 choices=8Seventh player:From 13 players, six has already been chosen. Hence, we are left with 7 choices=7Eighth player:From 13 players, seven has already been chosen. Hence, we are left with 6 choices=6Ninth player:From 13 players, eight has already been chosen. Hence, we are left with 5 choices=5Tenth player:From 13 players, nine has already been chosen. Hence, we are left with 4 choices=4Eleventh player:From 13 players, ten has already been chosen. Hence, we are left with 3 choices=3Use the Fundamental Counting Principle and multiply each draw’s number of options.number of ways = m×n Fundamental Counting Principle = 13×12×11×10×9×
8×7×6×5×4×3= 3 113 510 400 There are 3 113 510 400 ways to form a soccer team out of 13 soccer players3 113 510 400Method TwoSolve the problem using PermutationWe need to choose 11 players (r) from 13 soccer players(n)r=11n=13nPr = n!(n−r)! Permutation Formula 13P11 = 13!(13−11)! Substitute the values of n and r = 13!2! = 13⋅12⋅11⋅10⋅9⋅8⋅7⋅6⋅5⋅4⋅3⋅2⋅12⋅1 = 3 113 510 400 Cancel like terms and evaluate There are 3 113 510 400 ways to form a soccer team out of 13 soccer players3 113 510 400 -
Question 5 of 6
5. Question
Out of 12 Formula 1 cars, how many ways can the first, second and third places be selected?-
1.
1320 -
2.
1 -
3.
3113510400 -
4.
110
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
Use the permutations formula to find the number of ways an item can be arranged (r) from the total number of items (n).Remember that order is important in Permutations.Permutation Formula
nPr=n!(n−r)!Fundamental Counting Principle
number of ways =m×nMethod OneSolve the problem using the Fundamental Counting PrincipleFirst, count the options for each stageFirst place:There are 12 cars to choose from=12Second place:From 12 cars, one has already been chosen. Hence, we are left with 11 choices=11Third place:From 12 cars, two has already been chosen. Hence, we are left with 10 choices=10Use the Fundamental Counting Principle and multiply each draw’s number of options.number of ways = m×n Fundamental Counting Principle = 12×11×10 = 1320 There are 1320 ways to choose the first, second and third place out of 12 cars1320Method TwoWe are selecting 3 cars (r) out of 12 total cars (n)r=3n=12nPr = n!(n−r)! Permutation Formula 12P3 = 12!(12−3)! Substitute the value of n and r = 12!9! = 12⋅11⋅10⋅9⋅8⋅7⋅6⋅5⋅4⋅3⋅2⋅19⋅8⋅7⋅6⋅5⋅4⋅3⋅2⋅1 = 1320 Cancel like terms There are 1320 ways to select the first, second and third places out of 12 cars1320 -
1.
-
Question 6 of 6
6. Question
How many ways can 12 Formula 1 cars be arranged in ranking?-
1.
479 001 600 -
2.
3 012 845 922 -
3.
8236 -
4.
144
Hint
Help VideoCorrect
Correct!
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) from the total number of items (n).Remember that order is important in Permutations.Permutation Formula
nPr=n!(n−r)!Fundamental Counting Principle
number of ways =m×nMethod OneSolve the problem using the Fundamental Counting PrincipleFirst, count the options for each rankingFirst place:There are 12 cars to choose from=12Second place:From 12 cars, one has already been chosen. Hence, we are left with 11 choices=11Third place:From 12 cars, two has already been chosen. Hence, we are left with 10 choices=10Fourth place:From 12 cars, three has already been chosen. Hence, we are left with 9 choices=9Fifth place:From 12 cars, four has already been chosen. Hence, we are left with 8 choices=8Sixth place:From 12 cars, five has already been chosen. Hence, we are left with 7 choices=7Seventh place:From 12 cars, six has already been chosen. Hence, we are left with 6 choices=6Eighth place:From 12 cars, seven has already been chosen. Hence, we are left with 5 choices=5Ninth place:From 12 cars, eight has already been chosen. Hence, we are left with 4 choices=4Tenth place:From 12 cars, nine has already been chosen. Hence, we are left with 3 choices=3Eleventh place:From 12 cars, ten has already been chosen. Hence, we are left with 2 choices=2Twelfth place:From 12 cars, eleven has already been chosen. Hence, we are left with 1 choice=1Use the Fundamental Counting Principle and multiply the options for each rankingnumber of ways = m×n Fundamental Counting Principle = 12×11×10×9×8×7
×6×5×4×3×2×1= 479 001 600 There are 479 001 600 ways to rank 12 cars479 001 600Method TwoWe are ranking 12 cars (r) out of 12 total cars (n)r=12n=12nPr = n!(n−r)! Permutation Formula 12P12 = 12!(12−12)! Substitute the value of n and r = 12!0! = 12⋅11⋅10⋅9⋅8⋅7⋅6⋅5⋅4⋅3⋅2⋅11 0!=1 = 479 001 600 There are 479 001 600 ways to rank 12 cars479 001 600 -
1.
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