How to distribute 5 cards among 3 people $A,B,C$ so that none of the person have empty hands
$begingroup$
How to distribute 5 cards among 3 people $A,B,C$ so that none of the person have empty hands?
My try:
5 cards can be distributed among $A,B,C$ in $2,2,1$ ways.
Now there are three ways of arranging $2,2,1$ .
Once I decide whether A or B or C is 2 or 1 we have $binom 5 2$ ways of distributing 2 cards to the person who has 2 cards ,$binom 3 2$ ways of distributing 2 cards to another person who has 2 cards
Thus the answer is $binom 5 2times binom 3 2times 3$
Is the answer correct??
Please correct if not .
combinatorics number-theory divisor-counting-function
$endgroup$
add a comment |
$begingroup$
How to distribute 5 cards among 3 people $A,B,C$ so that none of the person have empty hands?
My try:
5 cards can be distributed among $A,B,C$ in $2,2,1$ ways.
Now there are three ways of arranging $2,2,1$ .
Once I decide whether A or B or C is 2 or 1 we have $binom 5 2$ ways of distributing 2 cards to the person who has 2 cards ,$binom 3 2$ ways of distributing 2 cards to another person who has 2 cards
Thus the answer is $binom 5 2times binom 3 2times 3$
Is the answer correct??
Please correct if not .
combinatorics number-theory divisor-counting-function
$endgroup$
2
$begingroup$
That's correct, but you are forgetting the case $1,1,3$
$endgroup$
– Shubham Johri
Dec 17 '18 at 15:45
add a comment |
$begingroup$
How to distribute 5 cards among 3 people $A,B,C$ so that none of the person have empty hands?
My try:
5 cards can be distributed among $A,B,C$ in $2,2,1$ ways.
Now there are three ways of arranging $2,2,1$ .
Once I decide whether A or B or C is 2 or 1 we have $binom 5 2$ ways of distributing 2 cards to the person who has 2 cards ,$binom 3 2$ ways of distributing 2 cards to another person who has 2 cards
Thus the answer is $binom 5 2times binom 3 2times 3$
Is the answer correct??
Please correct if not .
combinatorics number-theory divisor-counting-function
$endgroup$
How to distribute 5 cards among 3 people $A,B,C$ so that none of the person have empty hands?
My try:
5 cards can be distributed among $A,B,C$ in $2,2,1$ ways.
Now there are three ways of arranging $2,2,1$ .
Once I decide whether A or B or C is 2 or 1 we have $binom 5 2$ ways of distributing 2 cards to the person who has 2 cards ,$binom 3 2$ ways of distributing 2 cards to another person who has 2 cards
Thus the answer is $binom 5 2times binom 3 2times 3$
Is the answer correct??
Please correct if not .
combinatorics number-theory divisor-counting-function
combinatorics number-theory divisor-counting-function
asked Dec 17 '18 at 15:39
user596656
2
$begingroup$
That's correct, but you are forgetting the case $1,1,3$
$endgroup$
– Shubham Johri
Dec 17 '18 at 15:45
add a comment |
2
$begingroup$
That's correct, but you are forgetting the case $1,1,3$
$endgroup$
– Shubham Johri
Dec 17 '18 at 15:45
2
2
$begingroup$
That's correct, but you are forgetting the case $1,1,3$
$endgroup$
– Shubham Johri
Dec 17 '18 at 15:45
$begingroup$
That's correct, but you are forgetting the case $1,1,3$
$endgroup$
– Shubham Johri
Dec 17 '18 at 15:45
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
That's correct, but you are forgetting the case $1,1,3$. We can permute $1,1,3$ in $3$ ways, select 3 cards in $binom53$ ways, the next 2 cards in $binom21,binom11$ ways respectively. The total ways are $3binom53binom21binom11=60$. Add to it $3binom52binom32=90$ to get a total of $150$.
answered Dec 17 '18 at 15:50
Shubham JohriShubham Johri
5,262718
$endgroup$
$begingroup$
Oh yes ! Thank you very much
$endgroup$
– user596656
Dec 17 '18 at 16:04
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%2f3044094%2fhow-to-distribute-5-cards-among-3-people-a-b-c-so-that-none-of-the-person-have%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$
That's correct, but you are forgetting the case $1,1,3$. We can permute $1,1,3$ in $3$ ways, select 3 cards in $binom53$ ways, the next 2 cards in $binom21,binom11$ ways respectively. The total ways are $3binom53binom21binom11=60$. Add to it $3binom52binom32=90$ to get a total of $150$.
answered Dec 17 '18 at 15:50
Shubham JohriShubham Johri
5,262718
$endgroup$
$begingroup$
Oh yes ! Thank you very much
$endgroup$
– user596656
Dec 17 '18 at 16:04
add a comment |
$begingroup$
That's correct, but you are forgetting the case $1,1,3$. We can permute $1,1,3$ in $3$ ways, select 3 cards in $binom53$ ways, the next 2 cards in $binom21,binom11$ ways respectively. The total ways are $3binom53binom21binom11=60$. Add to it $3binom52binom32=90$ to get a total of $150$.
answered Dec 17 '18 at 15:50
Shubham JohriShubham Johri
5,262718
$endgroup$
$begingroup$
Oh yes ! Thank you very much
$endgroup$
– user596656
Dec 17 '18 at 16:04
add a comment |
$begingroup$
That's correct, but you are forgetting the case $1,1,3$. We can permute $1,1,3$ in $3$ ways, select 3 cards in $binom53$ ways, the next 2 cards in $binom21,binom11$ ways respectively. The total ways are $3binom53binom21binom11=60$. Add to it $3binom52binom32=90$ to get a total of $150$.
answered Dec 17 '18 at 15:50
Shubham JohriShubham Johri
5,262718
$endgroup$
That's correct, but you are forgetting the case $1,1,3$. We can permute $1,1,3$ in $3$ ways, select 3 cards in $binom53$ ways, the next 2 cards in $binom21,binom11$ ways respectively. The total ways are $3binom53binom21binom11=60$. Add to it $3binom52binom32=90$ to get a total of $150$.
answered Dec 17 '18 at 15:50
Shubham JohriShubham Johri
5,262718
answered Dec 17 '18 at 15:50
Shubham JohriShubham Johri
5,262718
answered Dec 17 '18 at 15:50
Shubham JohriShubham Johri
5,262718
answered Dec 17 '18 at 15:50
Shubham JohriShubham Johri
5,262718
5,262718
$begingroup$
Oh yes ! Thank you very much
$endgroup$
– user596656
Dec 17 '18 at 16:04
add a comment |
$begingroup$
Oh yes ! Thank you very much
$endgroup$
– user596656
Dec 17 '18 at 16:04
$begingroup$
Oh yes ! Thank you very much
$endgroup$
– user596656
Dec 17 '18 at 16:04
$begingroup$
Oh yes ! Thank you very much
$endgroup$
– user596656
Dec 17 '18 at 16:04
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%2f3044094%2fhow-to-distribute-5-cards-among-3-people-a-b-c-so-that-none-of-the-person-have%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
2
$begingroup$
That's correct, but you are forgetting the case $1,1,3$
$endgroup$
– Shubham Johri
Dec 17 '18 at 15:45