Mixing
How to solve this counting problem easily?
$begingroup$
Letters of the word $BRILLIANT$ are rearranged. What is the probability that the extreme positions are always occupied by consonants? Assume that all permutations are equally likely to occur.
My attempt:
There are 6 consonants (B, R, L, L, N and T). Select two of these in $binom{6}{2}$ ways. These 2 letters can be permuted in 2! ways. Put these 2 selected consonants at the extremes and then the remaining 7 characters can be permuted in 7! ways. But we are over-counting since there are 2 Is and 2 Ls. I am unable to proceed further.
probability combinatorics permutations
asked Jan 27 at 11:04
Stupid ManStupid Man
11117
$endgroup$
add a comment |
$begingroup$
Letters of the word $BRILLIANT$ are rearranged. What is the probability that the extreme positions are always occupied by consonants? Assume that all permutations are equally likely to occur.
My attempt:
There are 6 consonants (B, R, L, L, N and T). Select two of these in $binom{6}{2}$ ways. These 2 letters can be permuted in 2! ways. Put these 2 selected consonants at the extremes and then the remaining 7 characters can be permuted in 7! ways. But we are over-counting since there are 2 Is and 2 Ls. I am unable to proceed further.
probability combinatorics permutations
asked Jan 27 at 11:04
Stupid ManStupid Man
11117
$endgroup$
1
$begingroup$
You are already doing it correctly and do not need to worry about over-counting. You can think of it as numbering the letters from 1 to 9 (repeated letters get their own number) and then just let $Csubseteq {1, 2, ..., 9}$ be the subset corresponding to consonants. So then you can repeat your same argument without worrying about repeated letters. It is like a "balls in bin" problem where there are 9 balls, 6 are red: You sequentially choose 9 without replacement and want to know the probability the first and last are red. [In fact you might as well choose the "last" location second.]
$endgroup$
– Michael
Jan 27 at 11:23
add a comment |
$begingroup$
Letters of the word $BRILLIANT$ are rearranged. What is the probability that the extreme positions are always occupied by consonants? Assume that all permutations are equally likely to occur.
My attempt:
There are 6 consonants (B, R, L, L, N and T). Select two of these in $binom{6}{2}$ ways. These 2 letters can be permuted in 2! ways. Put these 2 selected consonants at the extremes and then the remaining 7 characters can be permuted in 7! ways. But we are over-counting since there are 2 Is and 2 Ls. I am unable to proceed further.
probability combinatorics permutations
asked Jan 27 at 11:04
Stupid ManStupid Man
11117
$endgroup$
Letters of the word $BRILLIANT$ are rearranged. What is the probability that the extreme positions are always occupied by consonants? Assume that all permutations are equally likely to occur.
My attempt:
There are 6 consonants (B, R, L, L, N and T). Select two of these in $binom{6}{2}$ ways. These 2 letters can be permuted in 2! ways. Put these 2 selected consonants at the extremes and then the remaining 7 characters can be permuted in 7! ways. But we are over-counting since there are 2 Is and 2 Ls. I am unable to proceed further.
probability combinatorics permutations
probability combinatorics permutations
asked Jan 27 at 11:04
Stupid ManStupid Man
11117
asked Jan 27 at 11:04
Stupid ManStupid Man
11117
asked Jan 27 at 11:04
Stupid ManStupid Man
11117
asked Jan 27 at 11:04
Stupid ManStupid Man
11117
asked Jan 27 at 11:04
Stupid ManStupid Man
11117
11117
1
$begingroup$
You are already doing it correctly and do not need to worry about over-counting. You can think of it as numbering the letters from 1 to 9 (repeated letters get their own number) and then just let $Csubseteq {1, 2, ..., 9}$ be the subset corresponding to consonants. So then you can repeat your same argument without worrying about repeated letters. It is like a "balls in bin" problem where there are 9 balls, 6 are red: You sequentially choose 9 without replacement and want to know the probability the first and last are red. [In fact you might as well choose the "last" location second.]
$endgroup$
– Michael
Jan 27 at 11:23
add a comment |
1
$begingroup$
You are already doing it correctly and do not need to worry about over-counting. You can think of it as numbering the letters from 1 to 9 (repeated letters get their own number) and then just let $Csubseteq {1, 2, ..., 9}$ be the subset corresponding to consonants. So then you can repeat your same argument without worrying about repeated letters. It is like a "balls in bin" problem where there are 9 balls, 6 are red: You sequentially choose 9 without replacement and want to know the probability the first and last are red. [In fact you might as well choose the "last" location second.]
$endgroup$
– Michael
Jan 27 at 11:23
1
1
$begingroup$
You are already doing it correctly and do not need to worry about over-counting. You can think of it as numbering the letters from 1 to 9 (repeated letters get their own number) and then just let $Csubseteq {1, 2, ..., 9}$ be the subset corresponding to consonants. So then you can repeat your same argument without worrying about repeated letters. It is like a "balls in bin" problem where there are 9 balls, 6 are red: You sequentially choose 9 without replacement and want to know the probability the first and last are red. [In fact you might as well choose the "last" location second.]
$endgroup$
– Michael
Jan 27 at 11:23
$begingroup$
You are already doing it correctly and do not need to worry about over-counting. You can think of it as numbering the letters from 1 to 9 (repeated letters get their own number) and then just let $Csubseteq {1, 2, ..., 9}$ be the subset corresponding to consonants. So then you can repeat your same argument without worrying about repeated letters. It is like a "balls in bin" problem where there are 9 balls, 6 are red: You sequentially choose 9 without replacement and want to know the probability the first and last are red. [In fact you might as well choose the "last" location second.]
$endgroup$
– Michael
Jan 27 at 11:23
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
You can calculate it like this:
Probability of first letter becoming a consonant = 6 / 9
(Total letters = 9, Consonants = 6)
Probability of first letter becoming a consonant = 5 / 8
(After first letter becoming a consonant, remaining counts are: Total letters = 8, Consonants = 5)
Therefore probability of first AND last letters becoming a consonant
= (6 / 9) * (5 / 8)
= 30 / 72
= 5 / 12
answered Jan 27 at 11:41
Prasad KarunagodaPrasad Karunagoda
1562
$endgroup$
$begingroup$
Can you also explain the approach where we actually count the valid strings?
$endgroup$
– Stupid Man
Jan 27 at 14:17
$begingroup$
@StupidMan, counting valid strings? Is there a part like that in the question? I don't see.
$endgroup$
– Prasad Karunagoda
Jan 27 at 14:49
$begingroup$
Your answer is correct and I have already accepted it as the correct answer. I am just interested in knowing another way to solve this, which is by actually counting the valid strings and dividing by the total number of permutations of the string "BRILLIANT".
$endgroup$
– Stupid Man
Jan 27 at 15:23
$begingroup$
Oh ok. Now I understood your question :)
$endgroup$
– Prasad Karunagoda
Jan 27 at 15:34
add a comment |
$begingroup$
In the comments, you requested a solution in which the probability is calculated by dividing the number of arrangements in which both ends are filled by consonants by the total number of arrangements.
The word BRILLIANT contains nine letters, including one B, one R, two Is, two Ls, one A, one N, and one T.
First, we count the number of distinguishable arrangements of the word BRILLIANT. Choose two of the nine positions for the Is, two of the remaining seven positions for the Ls, and then arrange the remaining five distinct letters in the remaining five positions.
There are $$binom{9}{2}binom{7}{2}5! = frac{9!}{2!7!} cdot frac{7!}{2!5!} cdot 5! = frac{9!}{2!2!}$$ distinguishable arrrangements of the letters of the word BRILLIANT. The factors of $2!$ in the denominator represent the number of ways the two Is and two Ls can be permuted within an arrangement without producing an arrangement that is distinguishable from the given arrangement.
Next, we count the number of arrangements of the word BRILLIANT in which both ends are occupied by consonants. Note that this means that the three vowels must be located in the seven interior positions. Choose two of those seven positions for the Is and one of the remaining five interior positions for the A. That leaves six positions to fill, including both ends. Choose two of those six positions for the two Ls. Arrange the remaining four distinct consonants in the remaining four positions.
There are $$binom{7}{2}binom{5}{1}binom{6}{2}4! = frac{7!}{2!5!} cdot frac{5!}{1!4!} cdot frac{6!}{2!4!} cdot 4! = frac{7! cdot 6 cdot 5}{2!2!}$$
Thus, the desired probability is
$$frac{dbinom{7}{2}dbinom{5}{1}dbinom{6}{2}4!}{dbinom{9}{2}dbinom{7}{2}5!} = frac{dfrac{7! cdot 6 cdot 5}{2!2!}}{dfrac{9!}{2!2!}} = frac{7! cdot 6 cdot 5}{9!} = frac{6 cdot 5}{9 cdot 8}$$ which agrees with the simpler calculation given by Prasad Kaunagoda.
answered Jan 29 at 11:04
N. F. TaussigN. F. Taussig
44.8k103358
$endgroup$
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%2f3089416%2fhow-to-solve-this-counting-problem-easily%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
You can calculate it like this:
Probability of first letter becoming a consonant = 6 / 9
(Total letters = 9, Consonants = 6)
Probability of first letter becoming a consonant = 5 / 8
(After first letter becoming a consonant, remaining counts are: Total letters = 8, Consonants = 5)
Therefore probability of first AND last letters becoming a consonant
= (6 / 9) * (5 / 8)
= 30 / 72
= 5 / 12
answered Jan 27 at 11:41
Prasad KarunagodaPrasad Karunagoda
1562
$endgroup$
$begingroup$
Can you also explain the approach where we actually count the valid strings?
$endgroup$
– Stupid Man
Jan 27 at 14:17
$begingroup$
@StupidMan, counting valid strings? Is there a part like that in the question? I don't see.
$endgroup$
– Prasad Karunagoda
Jan 27 at 14:49
$begingroup$
Your answer is correct and I have already accepted it as the correct answer. I am just interested in knowing another way to solve this, which is by actually counting the valid strings and dividing by the total number of permutations of the string "BRILLIANT".
$endgroup$
– Stupid Man
Jan 27 at 15:23
$begingroup$
Oh ok. Now I understood your question :)
$endgroup$
– Prasad Karunagoda
Jan 27 at 15:34
add a comment |
$begingroup$
You can calculate it like this:
Probability of first letter becoming a consonant = 6 / 9
(Total letters = 9, Consonants = 6)
Probability of first letter becoming a consonant = 5 / 8
(After first letter becoming a consonant, remaining counts are: Total letters = 8, Consonants = 5)
Therefore probability of first AND last letters becoming a consonant
= (6 / 9) * (5 / 8)
= 30 / 72
= 5 / 12
answered Jan 27 at 11:41
Prasad KarunagodaPrasad Karunagoda
1562
$endgroup$
$begingroup$
Can you also explain the approach where we actually count the valid strings?
$endgroup$
– Stupid Man
Jan 27 at 14:17
$begingroup$
@StupidMan, counting valid strings? Is there a part like that in the question? I don't see.
$endgroup$
– Prasad Karunagoda
Jan 27 at 14:49
$begingroup$
Your answer is correct and I have already accepted it as the correct answer. I am just interested in knowing another way to solve this, which is by actually counting the valid strings and dividing by the total number of permutations of the string "BRILLIANT".
$endgroup$
– Stupid Man
Jan 27 at 15:23
$begingroup$
Oh ok. Now I understood your question :)
$endgroup$
– Prasad Karunagoda
Jan 27 at 15:34
add a comment |
$begingroup$
You can calculate it like this:
Probability of first letter becoming a consonant = 6 / 9
(Total letters = 9, Consonants = 6)
Probability of first letter becoming a consonant = 5 / 8
(After first letter becoming a consonant, remaining counts are: Total letters = 8, Consonants = 5)
Therefore probability of first AND last letters becoming a consonant
= (6 / 9) * (5 / 8)
= 30 / 72
= 5 / 12
answered Jan 27 at 11:41
Prasad KarunagodaPrasad Karunagoda
1562
$endgroup$
You can calculate it like this:
Probability of first letter becoming a consonant = 6 / 9
(Total letters = 9, Consonants = 6)
Probability of first letter becoming a consonant = 5 / 8
(After first letter becoming a consonant, remaining counts are: Total letters = 8, Consonants = 5)
Therefore probability of first AND last letters becoming a consonant
= (6 / 9) * (5 / 8)
= 30 / 72
= 5 / 12
answered Jan 27 at 11:41
Prasad KarunagodaPrasad Karunagoda
1562
answered Jan 27 at 11:41
Prasad KarunagodaPrasad Karunagoda
1562
answered Jan 27 at 11:41
Prasad KarunagodaPrasad Karunagoda
1562
answered Jan 27 at 11:41
Prasad KarunagodaPrasad Karunagoda
1562
1562
$begingroup$
Can you also explain the approach where we actually count the valid strings?
$endgroup$
– Stupid Man
Jan 27 at 14:17
$begingroup$
@StupidMan, counting valid strings? Is there a part like that in the question? I don't see.
$endgroup$
– Prasad Karunagoda
Jan 27 at 14:49
$begingroup$
Your answer is correct and I have already accepted it as the correct answer. I am just interested in knowing another way to solve this, which is by actually counting the valid strings and dividing by the total number of permutations of the string "BRILLIANT".
$endgroup$
– Stupid Man
Jan 27 at 15:23
$begingroup$
Oh ok. Now I understood your question :)
$endgroup$
– Prasad Karunagoda
Jan 27 at 15:34
add a comment |
$begingroup$
Can you also explain the approach where we actually count the valid strings?
$endgroup$
– Stupid Man
Jan 27 at 14:17
$begingroup$
@StupidMan, counting valid strings? Is there a part like that in the question? I don't see.
$endgroup$
– Prasad Karunagoda
Jan 27 at 14:49
$begingroup$
Your answer is correct and I have already accepted it as the correct answer. I am just interested in knowing another way to solve this, which is by actually counting the valid strings and dividing by the total number of permutations of the string "BRILLIANT".
$endgroup$
– Stupid Man
Jan 27 at 15:23
$begingroup$
Oh ok. Now I understood your question :)
$endgroup$
– Prasad Karunagoda
Jan 27 at 15:34
$begingroup$
Can you also explain the approach where we actually count the valid strings?
$endgroup$
– Stupid Man
Jan 27 at 14:17
$begingroup$
Can you also explain the approach where we actually count the valid strings?
$endgroup$
– Stupid Man
Jan 27 at 14:17
$begingroup$
@StupidMan, counting valid strings? Is there a part like that in the question? I don't see.
$endgroup$
– Prasad Karunagoda
Jan 27 at 14:49
$begingroup$
@StupidMan, counting valid strings? Is there a part like that in the question? I don't see.
$endgroup$
– Prasad Karunagoda
Jan 27 at 14:49
$begingroup$
Your answer is correct and I have already accepted it as the correct answer. I am just interested in knowing another way to solve this, which is by actually counting the valid strings and dividing by the total number of permutations of the string "BRILLIANT".
$endgroup$
– Stupid Man
Jan 27 at 15:23
$begingroup$
Your answer is correct and I have already accepted it as the correct answer. I am just interested in knowing another way to solve this, which is by actually counting the valid strings and dividing by the total number of permutations of the string "BRILLIANT".
$endgroup$
– Stupid Man
Jan 27 at 15:23
$begingroup$
Oh ok. Now I understood your question :)
$endgroup$
– Prasad Karunagoda
Jan 27 at 15:34
$begingroup$
Oh ok. Now I understood your question :)
$endgroup$
– Prasad Karunagoda
Jan 27 at 15:34
add a comment |
$begingroup$
In the comments, you requested a solution in which the probability is calculated by dividing the number of arrangements in which both ends are filled by consonants by the total number of arrangements.
The word BRILLIANT contains nine letters, including one B, one R, two Is, two Ls, one A, one N, and one T.
First, we count the number of distinguishable arrangements of the word BRILLIANT. Choose two of the nine positions for the Is, two of the remaining seven positions for the Ls, and then arrange the remaining five distinct letters in the remaining five positions.
There are $$binom{9}{2}binom{7}{2}5! = frac{9!}{2!7!} cdot frac{7!}{2!5!} cdot 5! = frac{9!}{2!2!}$$ distinguishable arrrangements of the letters of the word BRILLIANT. The factors of $2!$ in the denominator represent the number of ways the two Is and two Ls can be permuted within an arrangement without producing an arrangement that is distinguishable from the given arrangement.
Next, we count the number of arrangements of the word BRILLIANT in which both ends are occupied by consonants. Note that this means that the three vowels must be located in the seven interior positions. Choose two of those seven positions for the Is and one of the remaining five interior positions for the A. That leaves six positions to fill, including both ends. Choose two of those six positions for the two Ls. Arrange the remaining four distinct consonants in the remaining four positions.
There are $$binom{7}{2}binom{5}{1}binom{6}{2}4! = frac{7!}{2!5!} cdot frac{5!}{1!4!} cdot frac{6!}{2!4!} cdot 4! = frac{7! cdot 6 cdot 5}{2!2!}$$
Thus, the desired probability is
$$frac{dbinom{7}{2}dbinom{5}{1}dbinom{6}{2}4!}{dbinom{9}{2}dbinom{7}{2}5!} = frac{dfrac{7! cdot 6 cdot 5}{2!2!}}{dfrac{9!}{2!2!}} = frac{7! cdot 6 cdot 5}{9!} = frac{6 cdot 5}{9 cdot 8}$$ which agrees with the simpler calculation given by Prasad Kaunagoda.
answered Jan 29 at 11:04
N. F. TaussigN. F. Taussig
44.8k103358
$endgroup$
add a comment |
$begingroup$
In the comments, you requested a solution in which the probability is calculated by dividing the number of arrangements in which both ends are filled by consonants by the total number of arrangements.
The word BRILLIANT contains nine letters, including one B, one R, two Is, two Ls, one A, one N, and one T.
First, we count the number of distinguishable arrangements of the word BRILLIANT. Choose two of the nine positions for the Is, two of the remaining seven positions for the Ls, and then arrange the remaining five distinct letters in the remaining five positions.
There are $$binom{9}{2}binom{7}{2}5! = frac{9!}{2!7!} cdot frac{7!}{2!5!} cdot 5! = frac{9!}{2!2!}$$ distinguishable arrrangements of the letters of the word BRILLIANT. The factors of $2!$ in the denominator represent the number of ways the two Is and two Ls can be permuted within an arrangement without producing an arrangement that is distinguishable from the given arrangement.
Next, we count the number of arrangements of the word BRILLIANT in which both ends are occupied by consonants. Note that this means that the three vowels must be located in the seven interior positions. Choose two of those seven positions for the Is and one of the remaining five interior positions for the A. That leaves six positions to fill, including both ends. Choose two of those six positions for the two Ls. Arrange the remaining four distinct consonants in the remaining four positions.
There are $$binom{7}{2}binom{5}{1}binom{6}{2}4! = frac{7!}{2!5!} cdot frac{5!}{1!4!} cdot frac{6!}{2!4!} cdot 4! = frac{7! cdot 6 cdot 5}{2!2!}$$
Thus, the desired probability is
$$frac{dbinom{7}{2}dbinom{5}{1}dbinom{6}{2}4!}{dbinom{9}{2}dbinom{7}{2}5!} = frac{dfrac{7! cdot 6 cdot 5}{2!2!}}{dfrac{9!}{2!2!}} = frac{7! cdot 6 cdot 5}{9!} = frac{6 cdot 5}{9 cdot 8}$$ which agrees with the simpler calculation given by Prasad Kaunagoda.
answered Jan 29 at 11:04
N. F. TaussigN. F. Taussig
44.8k103358
$endgroup$
add a comment |
$begingroup$
In the comments, you requested a solution in which the probability is calculated by dividing the number of arrangements in which both ends are filled by consonants by the total number of arrangements.
The word BRILLIANT contains nine letters, including one B, one R, two Is, two Ls, one A, one N, and one T.
First, we count the number of distinguishable arrangements of the word BRILLIANT. Choose two of the nine positions for the Is, two of the remaining seven positions for the Ls, and then arrange the remaining five distinct letters in the remaining five positions.
There are $$binom{9}{2}binom{7}{2}5! = frac{9!}{2!7!} cdot frac{7!}{2!5!} cdot 5! = frac{9!}{2!2!}$$ distinguishable arrrangements of the letters of the word BRILLIANT. The factors of $2!$ in the denominator represent the number of ways the two Is and two Ls can be permuted within an arrangement without producing an arrangement that is distinguishable from the given arrangement.
Next, we count the number of arrangements of the word BRILLIANT in which both ends are occupied by consonants. Note that this means that the three vowels must be located in the seven interior positions. Choose two of those seven positions for the Is and one of the remaining five interior positions for the A. That leaves six positions to fill, including both ends. Choose two of those six positions for the two Ls. Arrange the remaining four distinct consonants in the remaining four positions.
There are $$binom{7}{2}binom{5}{1}binom{6}{2}4! = frac{7!}{2!5!} cdot frac{5!}{1!4!} cdot frac{6!}{2!4!} cdot 4! = frac{7! cdot 6 cdot 5}{2!2!}$$
Thus, the desired probability is
$$frac{dbinom{7}{2}dbinom{5}{1}dbinom{6}{2}4!}{dbinom{9}{2}dbinom{7}{2}5!} = frac{dfrac{7! cdot 6 cdot 5}{2!2!}}{dfrac{9!}{2!2!}} = frac{7! cdot 6 cdot 5}{9!} = frac{6 cdot 5}{9 cdot 8}$$ which agrees with the simpler calculation given by Prasad Kaunagoda.
answered Jan 29 at 11:04
N. F. TaussigN. F. Taussig
44.8k103358
$endgroup$
In the comments, you requested a solution in which the probability is calculated by dividing the number of arrangements in which both ends are filled by consonants by the total number of arrangements.
The word BRILLIANT contains nine letters, including one B, one R, two Is, two Ls, one A, one N, and one T.
First, we count the number of distinguishable arrangements of the word BRILLIANT. Choose two of the nine positions for the Is, two of the remaining seven positions for the Ls, and then arrange the remaining five distinct letters in the remaining five positions.
There are $$binom{9}{2}binom{7}{2}5! = frac{9!}{2!7!} cdot frac{7!}{2!5!} cdot 5! = frac{9!}{2!2!}$$ distinguishable arrrangements of the letters of the word BRILLIANT. The factors of $2!$ in the denominator represent the number of ways the two Is and two Ls can be permuted within an arrangement without producing an arrangement that is distinguishable from the given arrangement.
Next, we count the number of arrangements of the word BRILLIANT in which both ends are occupied by consonants. Note that this means that the three vowels must be located in the seven interior positions. Choose two of those seven positions for the Is and one of the remaining five interior positions for the A. That leaves six positions to fill, including both ends. Choose two of those six positions for the two Ls. Arrange the remaining four distinct consonants in the remaining four positions.
There are $$binom{7}{2}binom{5}{1}binom{6}{2}4! = frac{7!}{2!5!} cdot frac{5!}{1!4!} cdot frac{6!}{2!4!} cdot 4! = frac{7! cdot 6 cdot 5}{2!2!}$$
Thus, the desired probability is
$$frac{dbinom{7}{2}dbinom{5}{1}dbinom{6}{2}4!}{dbinom{9}{2}dbinom{7}{2}5!} = frac{dfrac{7! cdot 6 cdot 5}{2!2!}}{dfrac{9!}{2!2!}} = frac{7! cdot 6 cdot 5}{9!} = frac{6 cdot 5}{9 cdot 8}$$ which agrees with the simpler calculation given by Prasad Kaunagoda.
answered Jan 29 at 11:04
N. F. TaussigN. F. Taussig
44.8k103358
answered Jan 29 at 11:04
N. F. TaussigN. F. Taussig
44.8k103358
answered Jan 29 at 11:04
N. F. TaussigN. F. Taussig
44.8k103358
answered Jan 29 at 11:04
N. F. TaussigN. F. Taussig
44.8k103358
44.8k103358
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.
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%2f3089416%2fhow-to-solve-this-counting-problem-easily%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
1
$begingroup$
You are already doing it correctly and do not need to worry about over-counting. You can think of it as numbering the letters from 1 to 9 (repeated letters get their own number) and then just let $Csubseteq {1, 2, ..., 9}$ be the subset corresponding to consonants. So then you can repeat your same argument without worrying about repeated letters. It is like a "balls in bin" problem where there are 9 balls, 6 are red: You sequentially choose 9 without replacement and want to know the probability the first and last are red. [In fact you might as well choose the "last" location second.]
$endgroup$
– Michael
Jan 27 at 11:23