Question 146353: Use either the fundamental counting principle or the permutation formulas (or both) to answer the following:
Using the letters of the word YOUNG, tell how many different 5-letter combinations are possible if:
the first letter must be Y
Answer by Electrified_Levi(103) (Show Source):
You can put this solution on YOUR website! Hi, Hope I can help,
.
Using the letters of the word YOUNG, tell how many different 5-letter combinations are possible if:
the first letter must be Y
There is only one combination, but I think you mean "how many permutations are possible?"
This is the formula for permutation
.

.
Where "n" is how many choices there are, "k" is how many choices can be used at a time.
.
The "!" means you multiply all numbers down to 1.
.
Example: 
.
In our problem, there are only four choices, since "Y" has to stay where it is, it can't move, It will always have to be the first letter
.
We can use all the letters except "Y" , so we can use all four choices. Both "n" and "k" are 4.
.
We can replace "n" and "k" with 4

.

.
0! is equal to 1
.

.
.
The answer is 24, There are 24 different possibilities.
.
Hope I helped, Levi
|
|
|