In how many ways can the letters of ENGRAVER be arranged if vowels need to be separated?
In how many ways can the letters of ENGRAVER be arranged if vowels need to be separated?
There are $6$ spots the AEE can go into to get separated.
And there are $5$ ways to arrange the N,G,R,V,R $to$ $5!/2!$.
For the AEE way, do I just do $6P3$ or $3!/2!$?
combinatorics permutations
add a comment |
In how many ways can the letters of ENGRAVER be arranged if vowels need to be separated?
There are $6$ spots the AEE can go into to get separated.
And there are $5$ ways to arrange the N,G,R,V,R $to$ $5!/2!$.
For the AEE way, do I just do $6P3$ or $3!/2!$?
combinatorics permutations
add a comment |
In how many ways can the letters of ENGRAVER be arranged if vowels need to be separated?
There are $6$ spots the AEE can go into to get separated.
And there are $5$ ways to arrange the N,G,R,V,R $to$ $5!/2!$.
For the AEE way, do I just do $6P3$ or $3!/2!$?
combinatorics permutations
In how many ways can the letters of ENGRAVER be arranged if vowels need to be separated?
There are $6$ spots the AEE can go into to get separated.
And there are $5$ ways to arrange the N,G,R,V,R $to$ $5!/2!$.
For the AEE way, do I just do $6P3$ or $3!/2!$?
combinatorics permutations
combinatorics permutations
edited Nov 28 at 20:45
N. F. Taussig
43.5k93355
43.5k93355
asked Nov 28 at 17:22
Erikien
494
494
add a comment |
add a comment |
3 Answers
3
active
oldest
votes
Consider ENGRAVIS instead, so the consonants and vowels are distinct.
Now you can place four slots between the consonants and one at either side:
$$rm
_ C_1 _ C_2 _ C_3 _ C_4 _ C_5 _
$$
This can be done in $5!$ ways.
You have to choose three out of the six slots to fill in the vowels, which can be done in $binom{6}{3}$ ways. Once the choice is made, we can choose among $3!$ ways to fill in the vowels.
Now we take into account that S is actually R and I is actually E, so we have counted each placement four times, precisely $2!cdot2!$.
Hence the total number is
$$
frac{1}{2!,2!}cdot5!cdotbinom{6}{3}cdot3!
$$
add a comment |
${6choose3}frac {5!}{2!}frac {3!}{2!}$
The first factor is the arrangement of vowels and consonants. The second is the arrangement of consonants, and the 3rd is the arrangement of vowels.
add a comment |
First, we arrange the five consonants, then we insert the vowels.
Arranging the five consonants: Choose two of the five positions for the $R$s, which can be done in $binom{5}{2}$ ways, then arrange the remaining three distinct consonants in the remaining three positions, which can be done in $3!$ ways. Hence, the consonants can be arranged in
$$binom{5}{2}3!$$
distinguishable ways.
As you can verify, this is equal to your answer
$$frac{5!}{2!}$$
for the number of distinguishable arrangements of the consonants.
This creates six spaces, four between successive consonants and two at the ends of the row. For instance,
$$square R square N square G square R square V square$$
Inserting the vowels: To separate the three vowels, we must place them in three of these six spaces. Choose two of the six spaces for the two $E$s and one of the remaining four spaces for the $A$. This can be done in
$$binom{6}{2}binom{4}{1}$$
distinguishable ways.
Total: Since these choices can be made independently, the number of distinguishable arrangements of the letters of the word $ENGRAVER$ in which no two vowels are adjacent is
$$binom{5}{2}3! cdot binom{6}{2}binom{4}{1}$$
Why are your proposed answers for the number of arrangements of the vowels incorrect?
The quantity $P(6, 3)$ is incorrect since the two $E$s are indistinguishable. Notice that dividing $P(6, 3)$ by the $2!$ ways we could permute the $E$s within an arrangement without producing an arrangement distinguishable from the given arrangement yields
$$frac{P(6, 3)}{2!} = binom{6}{2}binom{4}{1}$$
The quantity $frac{3!}{2!}$ is incorrect because you have not accounted for the $binom{6}{3}$ ways you could place the two vowels. Notice that
$$binom{6}{3} cdot frac{3!}{2!} = binom{6}{2}binom{4}{1}$$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3017421%2fin-how-many-ways-can-the-letters-of-engraver-be-arranged-if-vowels-need-to-be-se%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
Consider ENGRAVIS instead, so the consonants and vowels are distinct.
Now you can place four slots between the consonants and one at either side:
$$rm
_ C_1 _ C_2 _ C_3 _ C_4 _ C_5 _
$$
This can be done in $5!$ ways.
You have to choose three out of the six slots to fill in the vowels, which can be done in $binom{6}{3}$ ways. Once the choice is made, we can choose among $3!$ ways to fill in the vowels.
Now we take into account that S is actually R and I is actually E, so we have counted each placement four times, precisely $2!cdot2!$.
Hence the total number is
$$
frac{1}{2!,2!}cdot5!cdotbinom{6}{3}cdot3!
$$
add a comment |
Consider ENGRAVIS instead, so the consonants and vowels are distinct.
Now you can place four slots between the consonants and one at either side:
$$rm
_ C_1 _ C_2 _ C_3 _ C_4 _ C_5 _
$$
This can be done in $5!$ ways.
You have to choose three out of the six slots to fill in the vowels, which can be done in $binom{6}{3}$ ways. Once the choice is made, we can choose among $3!$ ways to fill in the vowels.
Now we take into account that S is actually R and I is actually E, so we have counted each placement four times, precisely $2!cdot2!$.
Hence the total number is
$$
frac{1}{2!,2!}cdot5!cdotbinom{6}{3}cdot3!
$$
add a comment |
Consider ENGRAVIS instead, so the consonants and vowels are distinct.
Now you can place four slots between the consonants and one at either side:
$$rm
_ C_1 _ C_2 _ C_3 _ C_4 _ C_5 _
$$
This can be done in $5!$ ways.
You have to choose three out of the six slots to fill in the vowels, which can be done in $binom{6}{3}$ ways. Once the choice is made, we can choose among $3!$ ways to fill in the vowels.
Now we take into account that S is actually R and I is actually E, so we have counted each placement four times, precisely $2!cdot2!$.
Hence the total number is
$$
frac{1}{2!,2!}cdot5!cdotbinom{6}{3}cdot3!
$$
Consider ENGRAVIS instead, so the consonants and vowels are distinct.
Now you can place four slots between the consonants and one at either side:
$$rm
_ C_1 _ C_2 _ C_3 _ C_4 _ C_5 _
$$
This can be done in $5!$ ways.
You have to choose three out of the six slots to fill in the vowels, which can be done in $binom{6}{3}$ ways. Once the choice is made, we can choose among $3!$ ways to fill in the vowels.
Now we take into account that S is actually R and I is actually E, so we have counted each placement four times, precisely $2!cdot2!$.
Hence the total number is
$$
frac{1}{2!,2!}cdot5!cdotbinom{6}{3}cdot3!
$$
answered Nov 28 at 21:08
egreg
177k1484198
177k1484198
add a comment |
add a comment |
${6choose3}frac {5!}{2!}frac {3!}{2!}$
The first factor is the arrangement of vowels and consonants. The second is the arrangement of consonants, and the 3rd is the arrangement of vowels.
add a comment |
${6choose3}frac {5!}{2!}frac {3!}{2!}$
The first factor is the arrangement of vowels and consonants. The second is the arrangement of consonants, and the 3rd is the arrangement of vowels.
add a comment |
${6choose3}frac {5!}{2!}frac {3!}{2!}$
The first factor is the arrangement of vowels and consonants. The second is the arrangement of consonants, and the 3rd is the arrangement of vowels.
${6choose3}frac {5!}{2!}frac {3!}{2!}$
The first factor is the arrangement of vowels and consonants. The second is the arrangement of consonants, and the 3rd is the arrangement of vowels.
edited Nov 28 at 21:15
answered Nov 28 at 17:31
Doug M
43.9k31854
43.9k31854
add a comment |
add a comment |
First, we arrange the five consonants, then we insert the vowels.
Arranging the five consonants: Choose two of the five positions for the $R$s, which can be done in $binom{5}{2}$ ways, then arrange the remaining three distinct consonants in the remaining three positions, which can be done in $3!$ ways. Hence, the consonants can be arranged in
$$binom{5}{2}3!$$
distinguishable ways.
As you can verify, this is equal to your answer
$$frac{5!}{2!}$$
for the number of distinguishable arrangements of the consonants.
This creates six spaces, four between successive consonants and two at the ends of the row. For instance,
$$square R square N square G square R square V square$$
Inserting the vowels: To separate the three vowels, we must place them in three of these six spaces. Choose two of the six spaces for the two $E$s and one of the remaining four spaces for the $A$. This can be done in
$$binom{6}{2}binom{4}{1}$$
distinguishable ways.
Total: Since these choices can be made independently, the number of distinguishable arrangements of the letters of the word $ENGRAVER$ in which no two vowels are adjacent is
$$binom{5}{2}3! cdot binom{6}{2}binom{4}{1}$$
Why are your proposed answers for the number of arrangements of the vowels incorrect?
The quantity $P(6, 3)$ is incorrect since the two $E$s are indistinguishable. Notice that dividing $P(6, 3)$ by the $2!$ ways we could permute the $E$s within an arrangement without producing an arrangement distinguishable from the given arrangement yields
$$frac{P(6, 3)}{2!} = binom{6}{2}binom{4}{1}$$
The quantity $frac{3!}{2!}$ is incorrect because you have not accounted for the $binom{6}{3}$ ways you could place the two vowels. Notice that
$$binom{6}{3} cdot frac{3!}{2!} = binom{6}{2}binom{4}{1}$$
add a comment |
First, we arrange the five consonants, then we insert the vowels.
Arranging the five consonants: Choose two of the five positions for the $R$s, which can be done in $binom{5}{2}$ ways, then arrange the remaining three distinct consonants in the remaining three positions, which can be done in $3!$ ways. Hence, the consonants can be arranged in
$$binom{5}{2}3!$$
distinguishable ways.
As you can verify, this is equal to your answer
$$frac{5!}{2!}$$
for the number of distinguishable arrangements of the consonants.
This creates six spaces, four between successive consonants and two at the ends of the row. For instance,
$$square R square N square G square R square V square$$
Inserting the vowels: To separate the three vowels, we must place them in three of these six spaces. Choose two of the six spaces for the two $E$s and one of the remaining four spaces for the $A$. This can be done in
$$binom{6}{2}binom{4}{1}$$
distinguishable ways.
Total: Since these choices can be made independently, the number of distinguishable arrangements of the letters of the word $ENGRAVER$ in which no two vowels are adjacent is
$$binom{5}{2}3! cdot binom{6}{2}binom{4}{1}$$
Why are your proposed answers for the number of arrangements of the vowels incorrect?
The quantity $P(6, 3)$ is incorrect since the two $E$s are indistinguishable. Notice that dividing $P(6, 3)$ by the $2!$ ways we could permute the $E$s within an arrangement without producing an arrangement distinguishable from the given arrangement yields
$$frac{P(6, 3)}{2!} = binom{6}{2}binom{4}{1}$$
The quantity $frac{3!}{2!}$ is incorrect because you have not accounted for the $binom{6}{3}$ ways you could place the two vowels. Notice that
$$binom{6}{3} cdot frac{3!}{2!} = binom{6}{2}binom{4}{1}$$
add a comment |
First, we arrange the five consonants, then we insert the vowels.
Arranging the five consonants: Choose two of the five positions for the $R$s, which can be done in $binom{5}{2}$ ways, then arrange the remaining three distinct consonants in the remaining three positions, which can be done in $3!$ ways. Hence, the consonants can be arranged in
$$binom{5}{2}3!$$
distinguishable ways.
As you can verify, this is equal to your answer
$$frac{5!}{2!}$$
for the number of distinguishable arrangements of the consonants.
This creates six spaces, four between successive consonants and two at the ends of the row. For instance,
$$square R square N square G square R square V square$$
Inserting the vowels: To separate the three vowels, we must place them in three of these six spaces. Choose two of the six spaces for the two $E$s and one of the remaining four spaces for the $A$. This can be done in
$$binom{6}{2}binom{4}{1}$$
distinguishable ways.
Total: Since these choices can be made independently, the number of distinguishable arrangements of the letters of the word $ENGRAVER$ in which no two vowels are adjacent is
$$binom{5}{2}3! cdot binom{6}{2}binom{4}{1}$$
Why are your proposed answers for the number of arrangements of the vowels incorrect?
The quantity $P(6, 3)$ is incorrect since the two $E$s are indistinguishable. Notice that dividing $P(6, 3)$ by the $2!$ ways we could permute the $E$s within an arrangement without producing an arrangement distinguishable from the given arrangement yields
$$frac{P(6, 3)}{2!} = binom{6}{2}binom{4}{1}$$
The quantity $frac{3!}{2!}$ is incorrect because you have not accounted for the $binom{6}{3}$ ways you could place the two vowels. Notice that
$$binom{6}{3} cdot frac{3!}{2!} = binom{6}{2}binom{4}{1}$$
First, we arrange the five consonants, then we insert the vowels.
Arranging the five consonants: Choose two of the five positions for the $R$s, which can be done in $binom{5}{2}$ ways, then arrange the remaining three distinct consonants in the remaining three positions, which can be done in $3!$ ways. Hence, the consonants can be arranged in
$$binom{5}{2}3!$$
distinguishable ways.
As you can verify, this is equal to your answer
$$frac{5!}{2!}$$
for the number of distinguishable arrangements of the consonants.
This creates six spaces, four between successive consonants and two at the ends of the row. For instance,
$$square R square N square G square R square V square$$
Inserting the vowels: To separate the three vowels, we must place them in three of these six spaces. Choose two of the six spaces for the two $E$s and one of the remaining four spaces for the $A$. This can be done in
$$binom{6}{2}binom{4}{1}$$
distinguishable ways.
Total: Since these choices can be made independently, the number of distinguishable arrangements of the letters of the word $ENGRAVER$ in which no two vowels are adjacent is
$$binom{5}{2}3! cdot binom{6}{2}binom{4}{1}$$
Why are your proposed answers for the number of arrangements of the vowels incorrect?
The quantity $P(6, 3)$ is incorrect since the two $E$s are indistinguishable. Notice that dividing $P(6, 3)$ by the $2!$ ways we could permute the $E$s within an arrangement without producing an arrangement distinguishable from the given arrangement yields
$$frac{P(6, 3)}{2!} = binom{6}{2}binom{4}{1}$$
The quantity $frac{3!}{2!}$ is incorrect because you have not accounted for the $binom{6}{3}$ ways you could place the two vowels. Notice that
$$binom{6}{3} cdot frac{3!}{2!} = binom{6}{2}binom{4}{1}$$
edited Nov 28 at 22:22
answered Nov 28 at 20:07
N. F. Taussig
43.5k93355
43.5k93355
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3017421%2fin-how-many-ways-can-the-letters-of-engraver-be-arranged-if-vowels-need-to-be-se%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown