Information
You have already completed the quiz before. Hence you can not start it again.
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
Loading...
-
Question 1 of 5
How many arrangements can be made with ABC?
Incorrect
Loaded: 0%
Progress: 0%
0:00
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.
Method One
Solve the problem using the Fundamental Counting Principle
First, count the options for each stage
First letter:
We can choose 3 letters: A,B and C
=3
Second letter:
One has already been chosen from A,B and C. Hence we are left with 2 choices
=2
Second spot:
Two have already been chosen from A,B and C. Hence we are left with 1 choice
=1
Use the Fundamental Counting Principle and multiply each draws number of options.
number of ways |
= |
m×n |
Fundamental Counting Principle |
|
= |
3×2×1 |
|
= |
12 |
There are 6 ways to arrange ABC
Method Two
We need to arrange 3 letters (r) into 3 positions (n)
nPr |
= |
n!(n−r)! |
Permutation Formula |
|
3P3 |
= |
3!(3−3)! |
Substitute the values of n and r |
|
|
= |
3!0! |
|
|
= |
3⋅2⋅1 |
0!=1 |
|
= |
6 |
There are 6 ways to arrange ABC
-
Question 2 of 5
Incorrect
Loaded: 0%
Progress: 0%
0:00
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.
First, identify the values in the formula.
Substitute the values into the permutation formula.
nPr |
= |
n!(n−r)! |
Permutation Formula |
|
4P2 |
= |
4!(4−2)! |
Substitute the values of n and r |
|
|
= |
4!2! |
|
|
= |
4⋅3⋅2⋅12⋅1 |
|
|
= |
4⋅3 |
Cancel like terms |
|
= |
12 |
-
Question 3 of 5
Incorrect
Loaded: 0%
Progress: 0%
0:00
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.
First, identify the values in the formula.
Substitute the values into the permutation formula.
nPr |
= |
n!(n−r)! |
Permutation Formula |
|
8P1 |
= |
8!(8−1)! |
Substitute the values of n and r |
|
|
= |
8!7! |
|
|
= |
8⋅7⋅6⋅5⋅4⋅3⋅2⋅17⋅6⋅5⋅4⋅3⋅2⋅1 |
|
|
= |
8 |
Cancel like terms |
-
Question 4 of 5
Incorrect
Loaded: 0%
Progress: 0%
0:00
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.
First, identify the values in the formula.
Substitute the values into the permutation formula.
nPr |
= |
n!(n−r)! |
Permutation Formula |
|
4P2 |
= |
7!(7−7)! |
Substitute the values of n and r |
|
|
= |
7!0! |
|
|
= |
7⋅6⋅5⋅4⋅3⋅2⋅11 |
0!=1 |
|
|
= |
5040 |
-
Question 5 of 5
How many arrangements can be made with MOUSE?
Incorrect
Loaded: 0%
Progress: 0%
0:00
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.
Method One
Solve the problem using the Fundamental Counting Principle
First, count the options for each stage
First letter:
We can choose from 5 letters: M,O,U,S and E
=5
Second letter:
One has already been chosen from M,O,U,S and E. Hence we are left with 4 choices
=4
Third letter:
Two have already been chosen from M,O,U,S and E. Hence we are left with 3 choices
=3
Fourth letter:
Three have already been chosen from M,O,U,S and E. Hence we are left with 2 choices
=2
Fifth letter:
Four have already been chosen from M,O,U,S and E. Hence we are left with 1 choice
=1
Use the Fundamental Counting Principle and multiply each draws number of options.
number of ways |
= |
m×n |
Fundamental Counting Principle |
|
= |
5×4×3×2×1 |
|
= |
120 |
There are 120 ways to arrange MOUSE
Method Two
We need to arrange 5 letters (r) into 5 positions (n)
nPr |
= |
n!(n−r)! |
Permutation Formula |
|
5P5 |
= |
5!(5−5)! |
Substitute the values of n and r |
|
|
= |
5!0! |
|
|
= |
5⋅4⋅3⋅2⋅1 |
0!=1 |
|
= |
120 |
There are 120 ways to arrange MOUSE