what is the probability that the letters e, g, and k are all in the same subset?
$begingroup$
the 26 letters of the alphabet are to be randomly partitioned into subsets with 5,10, and 11 letters respectively. what is the probability that the letters e, g, and k are all in the same subset?
I am unsure about how to go about this. I have tried 3!/5!10!11! And I know that is not it and have also tried (5C3)(10C3)(11C3)/(26C3) and that isnt correst either. I just need a push in the right direction
probability
asked Dec 9 '18 at 14:42
CourtCourt
1
$endgroup$
add a comment |
$begingroup$
the 26 letters of the alphabet are to be randomly partitioned into subsets with 5,10, and 11 letters respectively. what is the probability that the letters e, g, and k are all in the same subset?
I am unsure about how to go about this. I have tried 3!/5!10!11! And I know that is not it and have also tried (5C3)(10C3)(11C3)/(26C3) and that isnt correst either. I just need a push in the right direction
probability
asked Dec 9 '18 at 14:42
CourtCourt
1
$endgroup$
$begingroup$
Do you know how to count the ways of splitting 26 letters into subsets of sizes 5,10, and 11?
$endgroup$
– Ben
Dec 9 '18 at 14:46
$begingroup$
Once you’ve done that you can break it into three cases: egk are in the subset of size 5,10, or 11. How many ways are there for each case to happen?
$endgroup$
– Ben
Dec 9 '18 at 14:49
$begingroup$
This helps a lot, thank you!
$endgroup$
– Court
Dec 9 '18 at 14:51
1
$begingroup$
I’m glad! You should write the answer yourself down below once you solve it :)
$endgroup$
– Ben
Dec 9 '18 at 15:01
add a comment |
$begingroup$
the 26 letters of the alphabet are to be randomly partitioned into subsets with 5,10, and 11 letters respectively. what is the probability that the letters e, g, and k are all in the same subset?
I am unsure about how to go about this. I have tried 3!/5!10!11! And I know that is not it and have also tried (5C3)(10C3)(11C3)/(26C3) and that isnt correst either. I just need a push in the right direction
probability
asked Dec 9 '18 at 14:42
CourtCourt
1
$endgroup$
the 26 letters of the alphabet are to be randomly partitioned into subsets with 5,10, and 11 letters respectively. what is the probability that the letters e, g, and k are all in the same subset?
I am unsure about how to go about this. I have tried 3!/5!10!11! And I know that is not it and have also tried (5C3)(10C3)(11C3)/(26C3) and that isnt correst either. I just need a push in the right direction
probability
probability
asked Dec 9 '18 at 14:42
CourtCourt
1
asked Dec 9 '18 at 14:42
CourtCourt
1
asked Dec 9 '18 at 14:42
CourtCourt
1
asked Dec 9 '18 at 14:42
CourtCourt
1
asked Dec 9 '18 at 14:42
CourtCourt
1
1
$begingroup$
Do you know how to count the ways of splitting 26 letters into subsets of sizes 5,10, and 11?
$endgroup$
– Ben
Dec 9 '18 at 14:46
$begingroup$
Once you’ve done that you can break it into three cases: egk are in the subset of size 5,10, or 11. How many ways are there for each case to happen?
$endgroup$
– Ben
Dec 9 '18 at 14:49
$begingroup$
This helps a lot, thank you!
$endgroup$
– Court
Dec 9 '18 at 14:51
1
$begingroup$
I’m glad! You should write the answer yourself down below once you solve it :)
$endgroup$
– Ben
Dec 9 '18 at 15:01
add a comment |
$begingroup$
Do you know how to count the ways of splitting 26 letters into subsets of sizes 5,10, and 11?
$endgroup$
– Ben
Dec 9 '18 at 14:46
$begingroup$
Once you’ve done that you can break it into three cases: egk are in the subset of size 5,10, or 11. How many ways are there for each case to happen?
$endgroup$
– Ben
Dec 9 '18 at 14:49
$begingroup$
This helps a lot, thank you!
$endgroup$
– Court
Dec 9 '18 at 14:51
1
$begingroup$
I’m glad! You should write the answer yourself down below once you solve it :)
$endgroup$
– Ben
Dec 9 '18 at 15:01
$begingroup$
Do you know how to count the ways of splitting 26 letters into subsets of sizes 5,10, and 11?
$endgroup$
– Ben
Dec 9 '18 at 14:46
$begingroup$
Do you know how to count the ways of splitting 26 letters into subsets of sizes 5,10, and 11?
$endgroup$
– Ben
Dec 9 '18 at 14:46
$begingroup$
Once you’ve done that you can break it into three cases: egk are in the subset of size 5,10, or 11. How many ways are there for each case to happen?
$endgroup$
– Ben
Dec 9 '18 at 14:49
$begingroup$
Once you’ve done that you can break it into three cases: egk are in the subset of size 5,10, or 11. How many ways are there for each case to happen?
$endgroup$
– Ben
Dec 9 '18 at 14:49
$begingroup$
This helps a lot, thank you!
$endgroup$
– Court
Dec 9 '18 at 14:51
$begingroup$
This helps a lot, thank you!
$endgroup$
– Court
Dec 9 '18 at 14:51
1
1
$begingroup$
I’m glad! You should write the answer yourself down below once you solve it :)
$endgroup$
– Ben
Dec 9 '18 at 15:01
$begingroup$
I’m glad! You should write the answer yourself down below once you solve it :)
$endgroup$
– Ben
Dec 9 '18 at 15:01
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Hint:
If $S$ is a randomly chosen subset of ${text{a,b,}cdotstext{,z}}$ having $n$ elements then:
$P(text{e}in Swedgetext{g}in Swedgetext{k}in S)=P(text{e}in S)P(text{g}in Smidtext{e}in S)P(text{k}in Smidtext{g}in Swedgetext{e}in S)=frac{n}{26}frac{n-1}{25}frac{n-2}{24}$
answered Dec 9 '18 at 15:14
drhabdrhab
100k544130
$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%2f3032438%2fwhat-is-the-probability-that-the-letters-e-g-and-k-are-all-in-the-same-subset%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Hint:
If $S$ is a randomly chosen subset of ${text{a,b,}cdotstext{,z}}$ having $n$ elements then:
$P(text{e}in Swedgetext{g}in Swedgetext{k}in S)=P(text{e}in S)P(text{g}in Smidtext{e}in S)P(text{k}in Smidtext{g}in Swedgetext{e}in S)=frac{n}{26}frac{n-1}{25}frac{n-2}{24}$
answered Dec 9 '18 at 15:14
drhabdrhab
100k544130
$endgroup$
add a comment |
$begingroup$
Hint:
If $S$ is a randomly chosen subset of ${text{a,b,}cdotstext{,z}}$ having $n$ elements then:
$P(text{e}in Swedgetext{g}in Swedgetext{k}in S)=P(text{e}in S)P(text{g}in Smidtext{e}in S)P(text{k}in Smidtext{g}in Swedgetext{e}in S)=frac{n}{26}frac{n-1}{25}frac{n-2}{24}$
answered Dec 9 '18 at 15:14
drhabdrhab
100k544130
$endgroup$
add a comment |
$begingroup$
Hint:
If $S$ is a randomly chosen subset of ${text{a,b,}cdotstext{,z}}$ having $n$ elements then:
$P(text{e}in Swedgetext{g}in Swedgetext{k}in S)=P(text{e}in S)P(text{g}in Smidtext{e}in S)P(text{k}in Smidtext{g}in Swedgetext{e}in S)=frac{n}{26}frac{n-1}{25}frac{n-2}{24}$
answered Dec 9 '18 at 15:14
drhabdrhab
100k544130
$endgroup$
Hint:
If $S$ is a randomly chosen subset of ${text{a,b,}cdotstext{,z}}$ having $n$ elements then:
$P(text{e}in Swedgetext{g}in Swedgetext{k}in S)=P(text{e}in S)P(text{g}in Smidtext{e}in S)P(text{k}in Smidtext{g}in Swedgetext{e}in S)=frac{n}{26}frac{n-1}{25}frac{n-2}{24}$
answered Dec 9 '18 at 15:14
drhabdrhab
100k544130
answered Dec 9 '18 at 15:14
drhabdrhab
100k544130
answered Dec 9 '18 at 15:14
drhabdrhab
100k544130
answered Dec 9 '18 at 15:14
drhabdrhab
100k544130
100k544130
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%2f3032438%2fwhat-is-the-probability-that-the-letters-e-g-and-k-are-all-in-the-same-subset%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
$begingroup$
Do you know how to count the ways of splitting 26 letters into subsets of sizes 5,10, and 11?
$endgroup$
– Ben
Dec 9 '18 at 14:46
$begingroup$
Once you’ve done that you can break it into three cases: egk are in the subset of size 5,10, or 11. How many ways are there for each case to happen?
$endgroup$
– Ben
Dec 9 '18 at 14:49
$begingroup$
This helps a lot, thank you!
$endgroup$
– Court
Dec 9 '18 at 14:51
1
$begingroup$
I’m glad! You should write the answer yourself down below once you solve it :)
$endgroup$
– Ben
Dec 9 '18 at 15:01