How many group combinations of 3 can I make of 6 people?
How many different combinations of groups of $3$ can I make of $6$ people: $A, B, C, D, E,$ and $F$?
{(group1), (group2), (group3)}
- The order of each group doesn't matter
- The order of the whole set of groups doesn't matter either
One combination:
$(A,B), (C,D), (E,F)$
Another valid combination
$(A,B), (C,E), (D,F)$
The order of the 3 groups doesn't matter so:
This combination: $(A,B), (C,E), (D,F)$, is the same as: $(C,E), (D,F), (A,B)$
The order of each of the 3 groups consisting members doesn't matter too.
This combination: $(A,B), (C,E), (D,F)$, is the same as: $(B, A), (E, C), (F,D)$
What formula can be used to determine this?
combinatorics
add a comment |
How many different combinations of groups of $3$ can I make of $6$ people: $A, B, C, D, E,$ and $F$?
{(group1), (group2), (group3)}
- The order of each group doesn't matter
- The order of the whole set of groups doesn't matter either
One combination:
$(A,B), (C,D), (E,F)$
Another valid combination
$(A,B), (C,E), (D,F)$
The order of the 3 groups doesn't matter so:
This combination: $(A,B), (C,E), (D,F)$, is the same as: $(C,E), (D,F), (A,B)$
The order of each of the 3 groups consisting members doesn't matter too.
This combination: $(A,B), (C,E), (D,F)$, is the same as: $(B, A), (E, C), (F,D)$
What formula can be used to determine this?
combinatorics
Your examples don't seem to be groups of 3. Does order of groups/between groups matter? (make this explicit either way). You should also edit the question to share your attempts on the problem; questions of the form "here's my problem, solve it for me" are generally not well-received on this site.
– platty
Dec 1 at 19:23
I have no clue on how to solve this problem, so I have not attempted anything.
– Ryan Cameron
Dec 1 at 19:26
Your examples are still not groups of 3. Is this what you want?
– platty
Dec 1 at 19:29
What do you mean patty, it is indeed groups of three? {(group1), (group2), (group3)} - The order of each group doesn't matter, the order of the whole set of groups doesn't matter either
– Ryan Cameron
Dec 1 at 19:30
So you are splitting the six objects into three groups, not groups of three (the latter means that each group has size 3).
– platty
Dec 1 at 19:31
add a comment |
How many different combinations of groups of $3$ can I make of $6$ people: $A, B, C, D, E,$ and $F$?
{(group1), (group2), (group3)}
- The order of each group doesn't matter
- The order of the whole set of groups doesn't matter either
One combination:
$(A,B), (C,D), (E,F)$
Another valid combination
$(A,B), (C,E), (D,F)$
The order of the 3 groups doesn't matter so:
This combination: $(A,B), (C,E), (D,F)$, is the same as: $(C,E), (D,F), (A,B)$
The order of each of the 3 groups consisting members doesn't matter too.
This combination: $(A,B), (C,E), (D,F)$, is the same as: $(B, A), (E, C), (F,D)$
What formula can be used to determine this?
combinatorics
How many different combinations of groups of $3$ can I make of $6$ people: $A, B, C, D, E,$ and $F$?
{(group1), (group2), (group3)}
- The order of each group doesn't matter
- The order of the whole set of groups doesn't matter either
One combination:
$(A,B), (C,D), (E,F)$
Another valid combination
$(A,B), (C,E), (D,F)$
The order of the 3 groups doesn't matter so:
This combination: $(A,B), (C,E), (D,F)$, is the same as: $(C,E), (D,F), (A,B)$
The order of each of the 3 groups consisting members doesn't matter too.
This combination: $(A,B), (C,E), (D,F)$, is the same as: $(B, A), (E, C), (F,D)$
What formula can be used to determine this?
combinatorics
combinatorics
edited Dec 1 at 19:31
asked Dec 1 at 19:20
Ryan Cameron
397
397
Your examples don't seem to be groups of 3. Does order of groups/between groups matter? (make this explicit either way). You should also edit the question to share your attempts on the problem; questions of the form "here's my problem, solve it for me" are generally not well-received on this site.
– platty
Dec 1 at 19:23
I have no clue on how to solve this problem, so I have not attempted anything.
– Ryan Cameron
Dec 1 at 19:26
Your examples are still not groups of 3. Is this what you want?
– platty
Dec 1 at 19:29
What do you mean patty, it is indeed groups of three? {(group1), (group2), (group3)} - The order of each group doesn't matter, the order of the whole set of groups doesn't matter either
– Ryan Cameron
Dec 1 at 19:30
So you are splitting the six objects into three groups, not groups of three (the latter means that each group has size 3).
– platty
Dec 1 at 19:31
add a comment |
Your examples don't seem to be groups of 3. Does order of groups/between groups matter? (make this explicit either way). You should also edit the question to share your attempts on the problem; questions of the form "here's my problem, solve it for me" are generally not well-received on this site.
– platty
Dec 1 at 19:23
I have no clue on how to solve this problem, so I have not attempted anything.
– Ryan Cameron
Dec 1 at 19:26
Your examples are still not groups of 3. Is this what you want?
– platty
Dec 1 at 19:29
What do you mean patty, it is indeed groups of three? {(group1), (group2), (group3)} - The order of each group doesn't matter, the order of the whole set of groups doesn't matter either
– Ryan Cameron
Dec 1 at 19:30
So you are splitting the six objects into three groups, not groups of three (the latter means that each group has size 3).
– platty
Dec 1 at 19:31
Your examples don't seem to be groups of 3. Does order of groups/between groups matter? (make this explicit either way). You should also edit the question to share your attempts on the problem; questions of the form "here's my problem, solve it for me" are generally not well-received on this site.
– platty
Dec 1 at 19:23
Your examples don't seem to be groups of 3. Does order of groups/between groups matter? (make this explicit either way). You should also edit the question to share your attempts on the problem; questions of the form "here's my problem, solve it for me" are generally not well-received on this site.
– platty
Dec 1 at 19:23
I have no clue on how to solve this problem, so I have not attempted anything.
– Ryan Cameron
Dec 1 at 19:26
I have no clue on how to solve this problem, so I have not attempted anything.
– Ryan Cameron
Dec 1 at 19:26
Your examples are still not groups of 3. Is this what you want?
– platty
Dec 1 at 19:29
Your examples are still not groups of 3. Is this what you want?
– platty
Dec 1 at 19:29
What do you mean patty, it is indeed groups of three? {(group1), (group2), (group3)} - The order of each group doesn't matter, the order of the whole set of groups doesn't matter either
– Ryan Cameron
Dec 1 at 19:30
What do you mean patty, it is indeed groups of three? {(group1), (group2), (group3)} - The order of each group doesn't matter, the order of the whole set of groups doesn't matter either
– Ryan Cameron
Dec 1 at 19:30
So you are splitting the six objects into three groups, not groups of three (the latter means that each group has size 3).
– platty
Dec 1 at 19:31
So you are splitting the six objects into three groups, not groups of three (the latter means that each group has size 3).
– platty
Dec 1 at 19:31
add a comment |
3 Answers
3
active
oldest
votes
The solution to your problem is
$$frac{binom{6}{2}binom{4}{2}binom{2}{2}}{3!}=15$$
Why does this work? Well, there are $binom{6}{2}$ ways to pick the first pair of objects, $binom{4}{2}$ ways to pick the second pair of objects, and $binom{2}{2}$ ways to pick the third pair of objects. But since you don't care about the order in which you pick these pairs, and there are $3!$ possible orders, you must divide the product of these numbers by $3!$, and use
$$frac{binom{6}{2}binom{4}{2}binom{2}{2}}{3!}=15$$
There will be repetition in this. Same selections will be counted multiple times as the order of the groups don't count
– Sauhard Sharma
Dec 1 at 19:36
@SauhardSharma No, I prevented multiple counting by dividing by $3!$.
– Frpzzd
Dec 1 at 19:36
Sorry, my mistake :)
– Sauhard Sharma
Dec 1 at 19:40
What does $binom{6}{2}$ indicate? Is it the same as writing $C_{6,2}=6*5$ ? Are you refering to combinations or permutations here?
– Ryan Cameron
Dec 6 at 22:04
@RyanCameron Combinations.
– Frpzzd
Dec 7 at 20:06
add a comment |
The solution by @Frpzzd is perfectly fine. This is just another approach I read somewhere.
You first start by putting them all in a line and starting from the first, selecting the two adjacent to form a group. This gives you a total of
$$N=6!$$
Now since the ordering of groups don't matter, you divide by $3!$ to get
$$N=frac{6!}{3!}$$
Also since the group members inside any group can be interchanged with each other, or swapped; so we have two options for each group - swap or don't. As there are $3$ groups
$$N=frac{6!}{2^3cdot 3!} = 15$$
add a comment |
Here is another way to find your answer. This method also directly implies a way to write a computer program to write out all the answers, in lexicographical order without any repetitions. This also is the shortest way to write the answer.
First, we consider the "first" person in the group. We can choose "first" in any way we choose--let's use the first one in alphabetical order by name. So we have chosen A
. This person must be linked with another person. There are 5
other people so we have 5
choices here.
Now we choose the "next" person other than the two that we have already put into a group. If we chose B
last time, that means C
, otherwise that means B
. We now choose a partner for that person, and there are 3
people left, so we have 3
choices.
Next we choose the "next" person other than the four that we have already put into a group, again using alphabetical order. Now there is only one other person, so that is the last partner we choose. This was 1
choice.
The number of choices was set, regardless of the actual choices we had made previously. Therefore we multiply those numbers, and the total number of possibilities was
$$5 cdot 3 cdot 1 = 15$$
Note that if we had $n$ people to break into pairs, then the number of possibilities is
$$(n-1) cdot (n-3) cdot (n-5) cdots 3 cdot 1$$
This is the double factorial or semifactorial of $n-1$, written as $(n-1)!!$. So the final, briefest answer to your question is
$$(6-1)!! = 5!! = 5 cdot 3 cdot 1 = 15$$
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%2f3021707%2fhow-many-group-combinations-of-3-can-i-make-of-6-people%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
The solution to your problem is
$$frac{binom{6}{2}binom{4}{2}binom{2}{2}}{3!}=15$$
Why does this work? Well, there are $binom{6}{2}$ ways to pick the first pair of objects, $binom{4}{2}$ ways to pick the second pair of objects, and $binom{2}{2}$ ways to pick the third pair of objects. But since you don't care about the order in which you pick these pairs, and there are $3!$ possible orders, you must divide the product of these numbers by $3!$, and use
$$frac{binom{6}{2}binom{4}{2}binom{2}{2}}{3!}=15$$
There will be repetition in this. Same selections will be counted multiple times as the order of the groups don't count
– Sauhard Sharma
Dec 1 at 19:36
@SauhardSharma No, I prevented multiple counting by dividing by $3!$.
– Frpzzd
Dec 1 at 19:36
Sorry, my mistake :)
– Sauhard Sharma
Dec 1 at 19:40
What does $binom{6}{2}$ indicate? Is it the same as writing $C_{6,2}=6*5$ ? Are you refering to combinations or permutations here?
– Ryan Cameron
Dec 6 at 22:04
@RyanCameron Combinations.
– Frpzzd
Dec 7 at 20:06
add a comment |
The solution to your problem is
$$frac{binom{6}{2}binom{4}{2}binom{2}{2}}{3!}=15$$
Why does this work? Well, there are $binom{6}{2}$ ways to pick the first pair of objects, $binom{4}{2}$ ways to pick the second pair of objects, and $binom{2}{2}$ ways to pick the third pair of objects. But since you don't care about the order in which you pick these pairs, and there are $3!$ possible orders, you must divide the product of these numbers by $3!$, and use
$$frac{binom{6}{2}binom{4}{2}binom{2}{2}}{3!}=15$$
There will be repetition in this. Same selections will be counted multiple times as the order of the groups don't count
– Sauhard Sharma
Dec 1 at 19:36
@SauhardSharma No, I prevented multiple counting by dividing by $3!$.
– Frpzzd
Dec 1 at 19:36
Sorry, my mistake :)
– Sauhard Sharma
Dec 1 at 19:40
What does $binom{6}{2}$ indicate? Is it the same as writing $C_{6,2}=6*5$ ? Are you refering to combinations or permutations here?
– Ryan Cameron
Dec 6 at 22:04
@RyanCameron Combinations.
– Frpzzd
Dec 7 at 20:06
add a comment |
The solution to your problem is
$$frac{binom{6}{2}binom{4}{2}binom{2}{2}}{3!}=15$$
Why does this work? Well, there are $binom{6}{2}$ ways to pick the first pair of objects, $binom{4}{2}$ ways to pick the second pair of objects, and $binom{2}{2}$ ways to pick the third pair of objects. But since you don't care about the order in which you pick these pairs, and there are $3!$ possible orders, you must divide the product of these numbers by $3!$, and use
$$frac{binom{6}{2}binom{4}{2}binom{2}{2}}{3!}=15$$
The solution to your problem is
$$frac{binom{6}{2}binom{4}{2}binom{2}{2}}{3!}=15$$
Why does this work? Well, there are $binom{6}{2}$ ways to pick the first pair of objects, $binom{4}{2}$ ways to pick the second pair of objects, and $binom{2}{2}$ ways to pick the third pair of objects. But since you don't care about the order in which you pick these pairs, and there are $3!$ possible orders, you must divide the product of these numbers by $3!$, and use
$$frac{binom{6}{2}binom{4}{2}binom{2}{2}}{3!}=15$$
answered Dec 1 at 19:28
Frpzzd
21.8k839107
21.8k839107
There will be repetition in this. Same selections will be counted multiple times as the order of the groups don't count
– Sauhard Sharma
Dec 1 at 19:36
@SauhardSharma No, I prevented multiple counting by dividing by $3!$.
– Frpzzd
Dec 1 at 19:36
Sorry, my mistake :)
– Sauhard Sharma
Dec 1 at 19:40
What does $binom{6}{2}$ indicate? Is it the same as writing $C_{6,2}=6*5$ ? Are you refering to combinations or permutations here?
– Ryan Cameron
Dec 6 at 22:04
@RyanCameron Combinations.
– Frpzzd
Dec 7 at 20:06
add a comment |
There will be repetition in this. Same selections will be counted multiple times as the order of the groups don't count
– Sauhard Sharma
Dec 1 at 19:36
@SauhardSharma No, I prevented multiple counting by dividing by $3!$.
– Frpzzd
Dec 1 at 19:36
Sorry, my mistake :)
– Sauhard Sharma
Dec 1 at 19:40
What does $binom{6}{2}$ indicate? Is it the same as writing $C_{6,2}=6*5$ ? Are you refering to combinations or permutations here?
– Ryan Cameron
Dec 6 at 22:04
@RyanCameron Combinations.
– Frpzzd
Dec 7 at 20:06
There will be repetition in this. Same selections will be counted multiple times as the order of the groups don't count
– Sauhard Sharma
Dec 1 at 19:36
There will be repetition in this. Same selections will be counted multiple times as the order of the groups don't count
– Sauhard Sharma
Dec 1 at 19:36
@SauhardSharma No, I prevented multiple counting by dividing by $3!$.
– Frpzzd
Dec 1 at 19:36
@SauhardSharma No, I prevented multiple counting by dividing by $3!$.
– Frpzzd
Dec 1 at 19:36
Sorry, my mistake :)
– Sauhard Sharma
Dec 1 at 19:40
Sorry, my mistake :)
– Sauhard Sharma
Dec 1 at 19:40
What does $binom{6}{2}$ indicate? Is it the same as writing $C_{6,2}=6*5$ ? Are you refering to combinations or permutations here?
– Ryan Cameron
Dec 6 at 22:04
What does $binom{6}{2}$ indicate? Is it the same as writing $C_{6,2}=6*5$ ? Are you refering to combinations or permutations here?
– Ryan Cameron
Dec 6 at 22:04
@RyanCameron Combinations.
– Frpzzd
Dec 7 at 20:06
@RyanCameron Combinations.
– Frpzzd
Dec 7 at 20:06
add a comment |
The solution by @Frpzzd is perfectly fine. This is just another approach I read somewhere.
You first start by putting them all in a line and starting from the first, selecting the two adjacent to form a group. This gives you a total of
$$N=6!$$
Now since the ordering of groups don't matter, you divide by $3!$ to get
$$N=frac{6!}{3!}$$
Also since the group members inside any group can be interchanged with each other, or swapped; so we have two options for each group - swap or don't. As there are $3$ groups
$$N=frac{6!}{2^3cdot 3!} = 15$$
add a comment |
The solution by @Frpzzd is perfectly fine. This is just another approach I read somewhere.
You first start by putting them all in a line and starting from the first, selecting the two adjacent to form a group. This gives you a total of
$$N=6!$$
Now since the ordering of groups don't matter, you divide by $3!$ to get
$$N=frac{6!}{3!}$$
Also since the group members inside any group can be interchanged with each other, or swapped; so we have two options for each group - swap or don't. As there are $3$ groups
$$N=frac{6!}{2^3cdot 3!} = 15$$
add a comment |
The solution by @Frpzzd is perfectly fine. This is just another approach I read somewhere.
You first start by putting them all in a line and starting from the first, selecting the two adjacent to form a group. This gives you a total of
$$N=6!$$
Now since the ordering of groups don't matter, you divide by $3!$ to get
$$N=frac{6!}{3!}$$
Also since the group members inside any group can be interchanged with each other, or swapped; so we have two options for each group - swap or don't. As there are $3$ groups
$$N=frac{6!}{2^3cdot 3!} = 15$$
The solution by @Frpzzd is perfectly fine. This is just another approach I read somewhere.
You first start by putting them all in a line and starting from the first, selecting the two adjacent to form a group. This gives you a total of
$$N=6!$$
Now since the ordering of groups don't matter, you divide by $3!$ to get
$$N=frac{6!}{3!}$$
Also since the group members inside any group can be interchanged with each other, or swapped; so we have two options for each group - swap or don't. As there are $3$ groups
$$N=frac{6!}{2^3cdot 3!} = 15$$
answered Dec 1 at 19:46
Sauhard Sharma
60013
60013
add a comment |
add a comment |
Here is another way to find your answer. This method also directly implies a way to write a computer program to write out all the answers, in lexicographical order without any repetitions. This also is the shortest way to write the answer.
First, we consider the "first" person in the group. We can choose "first" in any way we choose--let's use the first one in alphabetical order by name. So we have chosen A
. This person must be linked with another person. There are 5
other people so we have 5
choices here.
Now we choose the "next" person other than the two that we have already put into a group. If we chose B
last time, that means C
, otherwise that means B
. We now choose a partner for that person, and there are 3
people left, so we have 3
choices.
Next we choose the "next" person other than the four that we have already put into a group, again using alphabetical order. Now there is only one other person, so that is the last partner we choose. This was 1
choice.
The number of choices was set, regardless of the actual choices we had made previously. Therefore we multiply those numbers, and the total number of possibilities was
$$5 cdot 3 cdot 1 = 15$$
Note that if we had $n$ people to break into pairs, then the number of possibilities is
$$(n-1) cdot (n-3) cdot (n-5) cdots 3 cdot 1$$
This is the double factorial or semifactorial of $n-1$, written as $(n-1)!!$. So the final, briefest answer to your question is
$$(6-1)!! = 5!! = 5 cdot 3 cdot 1 = 15$$
add a comment |
Here is another way to find your answer. This method also directly implies a way to write a computer program to write out all the answers, in lexicographical order without any repetitions. This also is the shortest way to write the answer.
First, we consider the "first" person in the group. We can choose "first" in any way we choose--let's use the first one in alphabetical order by name. So we have chosen A
. This person must be linked with another person. There are 5
other people so we have 5
choices here.
Now we choose the "next" person other than the two that we have already put into a group. If we chose B
last time, that means C
, otherwise that means B
. We now choose a partner for that person, and there are 3
people left, so we have 3
choices.
Next we choose the "next" person other than the four that we have already put into a group, again using alphabetical order. Now there is only one other person, so that is the last partner we choose. This was 1
choice.
The number of choices was set, regardless of the actual choices we had made previously. Therefore we multiply those numbers, and the total number of possibilities was
$$5 cdot 3 cdot 1 = 15$$
Note that if we had $n$ people to break into pairs, then the number of possibilities is
$$(n-1) cdot (n-3) cdot (n-5) cdots 3 cdot 1$$
This is the double factorial or semifactorial of $n-1$, written as $(n-1)!!$. So the final, briefest answer to your question is
$$(6-1)!! = 5!! = 5 cdot 3 cdot 1 = 15$$
add a comment |
Here is another way to find your answer. This method also directly implies a way to write a computer program to write out all the answers, in lexicographical order without any repetitions. This also is the shortest way to write the answer.
First, we consider the "first" person in the group. We can choose "first" in any way we choose--let's use the first one in alphabetical order by name. So we have chosen A
. This person must be linked with another person. There are 5
other people so we have 5
choices here.
Now we choose the "next" person other than the two that we have already put into a group. If we chose B
last time, that means C
, otherwise that means B
. We now choose a partner for that person, and there are 3
people left, so we have 3
choices.
Next we choose the "next" person other than the four that we have already put into a group, again using alphabetical order. Now there is only one other person, so that is the last partner we choose. This was 1
choice.
The number of choices was set, regardless of the actual choices we had made previously. Therefore we multiply those numbers, and the total number of possibilities was
$$5 cdot 3 cdot 1 = 15$$
Note that if we had $n$ people to break into pairs, then the number of possibilities is
$$(n-1) cdot (n-3) cdot (n-5) cdots 3 cdot 1$$
This is the double factorial or semifactorial of $n-1$, written as $(n-1)!!$. So the final, briefest answer to your question is
$$(6-1)!! = 5!! = 5 cdot 3 cdot 1 = 15$$
Here is another way to find your answer. This method also directly implies a way to write a computer program to write out all the answers, in lexicographical order without any repetitions. This also is the shortest way to write the answer.
First, we consider the "first" person in the group. We can choose "first" in any way we choose--let's use the first one in alphabetical order by name. So we have chosen A
. This person must be linked with another person. There are 5
other people so we have 5
choices here.
Now we choose the "next" person other than the two that we have already put into a group. If we chose B
last time, that means C
, otherwise that means B
. We now choose a partner for that person, and there are 3
people left, so we have 3
choices.
Next we choose the "next" person other than the four that we have already put into a group, again using alphabetical order. Now there is only one other person, so that is the last partner we choose. This was 1
choice.
The number of choices was set, regardless of the actual choices we had made previously. Therefore we multiply those numbers, and the total number of possibilities was
$$5 cdot 3 cdot 1 = 15$$
Note that if we had $n$ people to break into pairs, then the number of possibilities is
$$(n-1) cdot (n-3) cdot (n-5) cdots 3 cdot 1$$
This is the double factorial or semifactorial of $n-1$, written as $(n-1)!!$. So the final, briefest answer to your question is
$$(6-1)!! = 5!! = 5 cdot 3 cdot 1 = 15$$
edited Dec 1 at 20:43
answered Dec 1 at 20:38
Rory Daulton
29.3k53254
29.3k53254
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%2f3021707%2fhow-many-group-combinations-of-3-can-i-make-of-6-people%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
Your examples don't seem to be groups of 3. Does order of groups/between groups matter? (make this explicit either way). You should also edit the question to share your attempts on the problem; questions of the form "here's my problem, solve it for me" are generally not well-received on this site.
– platty
Dec 1 at 19:23
I have no clue on how to solve this problem, so I have not attempted anything.
– Ryan Cameron
Dec 1 at 19:26
Your examples are still not groups of 3. Is this what you want?
– platty
Dec 1 at 19:29
What do you mean patty, it is indeed groups of three? {(group1), (group2), (group3)} - The order of each group doesn't matter, the order of the whole set of groups doesn't matter either
– Ryan Cameron
Dec 1 at 19:30
So you are splitting the six objects into three groups, not groups of three (the latter means that each group has size 3).
– platty
Dec 1 at 19:31