Finding combinations with groups.
$begingroup$
Suppose I have four groups A, B, C, D filled with items belonging to groups:
- A
- A1
- A2
- A3
- B
- B1
- B2
- B3
- B4
- C
- C1
- C2
- D
- D1
- D2
- D3
I would like to create a combination with four items, for example:
- A1, B2, C1, D2
- A2, B1, C2, D1
- so on ...
Such that every item must be from a different group.
This would be wrong: A1, A2, B1, B2 because we cannot have two items from same group.
Is it mathematically possible to create such combinations given the groups and number of items and know how many would be there?
combinations
$endgroup$
add a comment |
$begingroup$
Suppose I have four groups A, B, C, D filled with items belonging to groups:
- A
- A1
- A2
- A3
- B
- B1
- B2
- B3
- B4
- C
- C1
- C2
- D
- D1
- D2
- D3
I would like to create a combination with four items, for example:
- A1, B2, C1, D2
- A2, B1, C2, D1
- so on ...
Such that every item must be from a different group.
This would be wrong: A1, A2, B1, B2 because we cannot have two items from same group.
Is it mathematically possible to create such combinations given the groups and number of items and know how many would be there?
combinations
$endgroup$
add a comment |
$begingroup$
Suppose I have four groups A, B, C, D filled with items belonging to groups:
- A
- A1
- A2
- A3
- B
- B1
- B2
- B3
- B4
- C
- C1
- C2
- D
- D1
- D2
- D3
I would like to create a combination with four items, for example:
- A1, B2, C1, D2
- A2, B1, C2, D1
- so on ...
Such that every item must be from a different group.
This would be wrong: A1, A2, B1, B2 because we cannot have two items from same group.
Is it mathematically possible to create such combinations given the groups and number of items and know how many would be there?
combinations
$endgroup$
Suppose I have four groups A, B, C, D filled with items belonging to groups:
- A
- A1
- A2
- A3
- B
- B1
- B2
- B3
- B4
- C
- C1
- C2
- D
- D1
- D2
- D3
I would like to create a combination with four items, for example:
- A1, B2, C1, D2
- A2, B1, C2, D1
- so on ...
Such that every item must be from a different group.
This would be wrong: A1, A2, B1, B2 because we cannot have two items from same group.
Is it mathematically possible to create such combinations given the groups and number of items and know how many would be there?
combinations
combinations
asked Jan 6 at 16:43
user963241user963241
17318
17318
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Yes, you can. We can, in fact, count the number of such combinations. Since for the first group you have $3$ choices, for the second group you have $4$ choices, for the third group you have $2$ choices and the for the fourth group you have $3$ choices thus the number of such groups is
$$3cdot 4cdot 2cdot 3=72.$$
$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%2f3064092%2ffinding-combinations-with-groups%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$
Yes, you can. We can, in fact, count the number of such combinations. Since for the first group you have $3$ choices, for the second group you have $4$ choices, for the third group you have $2$ choices and the for the fourth group you have $3$ choices thus the number of such groups is
$$3cdot 4cdot 2cdot 3=72.$$
$endgroup$
add a comment |
$begingroup$
Yes, you can. We can, in fact, count the number of such combinations. Since for the first group you have $3$ choices, for the second group you have $4$ choices, for the third group you have $2$ choices and the for the fourth group you have $3$ choices thus the number of such groups is
$$3cdot 4cdot 2cdot 3=72.$$
$endgroup$
add a comment |
$begingroup$
Yes, you can. We can, in fact, count the number of such combinations. Since for the first group you have $3$ choices, for the second group you have $4$ choices, for the third group you have $2$ choices and the for the fourth group you have $3$ choices thus the number of such groups is
$$3cdot 4cdot 2cdot 3=72.$$
$endgroup$
Yes, you can. We can, in fact, count the number of such combinations. Since for the first group you have $3$ choices, for the second group you have $4$ choices, for the third group you have $2$ choices and the for the fourth group you have $3$ choices thus the number of such groups is
$$3cdot 4cdot 2cdot 3=72.$$
answered Jan 6 at 16:46
model_checkermodel_checker
4,18621931
4,18621931
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%2f3064092%2ffinding-combinations-with-groups%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