<< Chapter < Page | Chapter >> Page > |
How many permutations of the letters of the word ARTICLE have consonants in the first and last positions?
In the word ARTICLE, there are 4 consonants.
Since the first letter must be a consonant, we have four choices for the first position, and once we use up a consonant, there are only three consonants left for the last spot. We show as follows:
4 | 3 |
Since there are no more restrictions, we can go ahead and make the choices for the rest of the positions.
So far we have used up 2 letters, therefore, five remain. So for the next position there are five choices, for the position after that there are four choices, and so on. We get
4 | 5 | 4 | 3 | 2 | 1 | 3 |
So the total permutations are .
Given five letters . Find the following:
The number of four-letter word sequences.
The number of three-letter word sequences.
The number of two-letter word sequences.
The problem is easily solved by the multiplication axiom, and answers are as follows:
a. The number of four-letter word sequences is .
b. The number of three-letter word sequences is .
c. The number of two-letter word sequences is .
We often encounter situations where we have a set of objects and we are selecting objects to form permutations. We refer to this as permutations of objects taken at a time , and we write it as .
Therefore, [link] can also be answered as listed below.
The number of four-letter word sequences is .
The number of three-letter word sequences is .
The number of two-letter word sequences is .
Before we give a formula for , we'd like to introduce a symbol that we will use a great deal in this as well as in [link] .
Now we define .
, or
Where and are natural numbers.
The reader should become familiar with both formulas and should feel comfortable in applying either.
Compute the following using both formulas.
We will identify and in each case and solve using the formulas provided.
, alternately
, or
Next we consider some more permutation problems to get further insight into these concepts.
In how many different ways can 4 people be seated in a straight line if two of them insist on sitting next to each other?
Let us suppose we have four people , , , and . Further suppose that and want to sit together. For the sake of argument, we tie and together and treat them as one person.
The four people are . Since is treated as one person, we have the following possible arrangements.
Note that there are six more such permutations because and could also be tied in the order . And they are
So altogether there are 12 different permutations.
Let us now do the problem using the multiplication axiom.
After we tie two of the people together and treat them as one person, we can say we have only three people. The multiplication axiom tells us that three people can be seated in ways. Since two people can be tied together ways, there are different arrangements.
Notification Switch
Would you like to follow the 'Applied finite mathematics' conversation and receive update notifications?