Counting the ways to form 4 different teams
$begingroup$
We have 40 players and we need to form 4 teams. For each team is necessary to indicate explicitly 6 players and 4 reserves. How many ways can teams be formed?
My attempt: first we can start to calculate in how many ways we can choose 6 players and 4 reserves. Since a distinction is made between players and reserves, I think we should consider it in the calculation (in the sense that, otherwise, it would have been simply 11 players). I think that we can calculate this number by multiplicate $binom{40}{6}$ ways to choose the players and $binom{34}{4}$ ways to choose the reserves. Now, the multiplication produces a very large number and makes me believe that I'm wrong (because then I need to calculate in how many ways we can assign one of the combinations to a team). Am I wrong? Is this a correct reasoning?
combinatorics
$endgroup$
add a comment |
$begingroup$
We have 40 players and we need to form 4 teams. For each team is necessary to indicate explicitly 6 players and 4 reserves. How many ways can teams be formed?
My attempt: first we can start to calculate in how many ways we can choose 6 players and 4 reserves. Since a distinction is made between players and reserves, I think we should consider it in the calculation (in the sense that, otherwise, it would have been simply 11 players). I think that we can calculate this number by multiplicate $binom{40}{6}$ ways to choose the players and $binom{34}{4}$ ways to choose the reserves. Now, the multiplication produces a very large number and makes me believe that I'm wrong (because then I need to calculate in how many ways we can assign one of the combinations to a team). Am I wrong? Is this a correct reasoning?
combinatorics
$endgroup$
add a comment |
$begingroup$
We have 40 players and we need to form 4 teams. For each team is necessary to indicate explicitly 6 players and 4 reserves. How many ways can teams be formed?
My attempt: first we can start to calculate in how many ways we can choose 6 players and 4 reserves. Since a distinction is made between players and reserves, I think we should consider it in the calculation (in the sense that, otherwise, it would have been simply 11 players). I think that we can calculate this number by multiplicate $binom{40}{6}$ ways to choose the players and $binom{34}{4}$ ways to choose the reserves. Now, the multiplication produces a very large number and makes me believe that I'm wrong (because then I need to calculate in how many ways we can assign one of the combinations to a team). Am I wrong? Is this a correct reasoning?
combinatorics
$endgroup$
We have 40 players and we need to form 4 teams. For each team is necessary to indicate explicitly 6 players and 4 reserves. How many ways can teams be formed?
My attempt: first we can start to calculate in how many ways we can choose 6 players and 4 reserves. Since a distinction is made between players and reserves, I think we should consider it in the calculation (in the sense that, otherwise, it would have been simply 11 players). I think that we can calculate this number by multiplicate $binom{40}{6}$ ways to choose the players and $binom{34}{4}$ ways to choose the reserves. Now, the multiplication produces a very large number and makes me believe that I'm wrong (because then I need to calculate in how many ways we can assign one of the combinations to a team). Am I wrong? Is this a correct reasoning?
combinatorics
combinatorics
asked 2 days ago
PCNFPCNF
1027
1027
add a comment |
add a comment |
4 Answers
4
active
oldest
votes
$begingroup$
You're on the right track.
The number of ways to pick Team 1 is equal to $binom{40}6cdotbinom{34}4$. After that, the number of ways to pick out Team 2 is $binom{30}6cdot binom{24}4$. And so on.
Ultimately, the number of ways to pick out the full $4$ teams is
$$
binom{40}6cdotbinom{34}4cdotbinom{30}6cdotbinom{24}4cdotbinom{20}6cdotbinom{14}4cdotbinom{10}6cdotbinom{4}4\
= frac{40!}{(6!)^4cdot (4!)^4}
$$
(Also known as the multinomial coefficient $binom{40}{6, 4, 6, 4, 6, 4, 6, 4}$.)
However, we don't care which team is Team 1 and which team is Team 4. We just care which four teams are picked. Since the same four teams can be picked out in $4!$ ways, the total number of different team compositions is
$$
frac{40!}{(6!)^4cdot (4!)^5}
$$
$endgroup$
add a comment |
$begingroup$
I would do it a little different. First split 40 players in to groups of 10 players, that we can do on $$a= {1over 4!} cdot {40choose 10}cdot {30choose 10}cdot {20choose 10}cdot {10choose 10}$$
ways.
Now in each group choose 4 reserve players, so we can do that on $b={10choose 4}^4$ ways.
Thus the result is $$ acdot b = {40!over 4!^5cdot 6!^4}$$
$endgroup$
$begingroup$
Wow, your method is much quicker than mine! +1
$endgroup$
– Zubin Mukerjee
2 days ago
add a comment |
$begingroup$
The number of ways to choose which players are reserves is $$binom{40}{16} $$
The remaining $24$ players are starters.
The number of ways to choose the $6$ starters on the first team is $$binom{24}{6} $$
Given this, the number of ways to choose the $6$ starters on the second team from the remaining $18$ choices is $$binom{18}{6}$$
Similarly, the third team's starters: $$binom{12}{6} $$
The remaining $6$ must start for the last team.
The total number of ways to arrange the starters within teams is
$$ binom{24}{6} binom{18}{6} binom{12}{6}$$
The same reasoning applies to reserves, and the total number of ways to arrange the reserves within teams is
$$ binom{16}{4} binom{12}{4} binom{8}{4}$$
Finally, the teams are not given distinguishing features (such as names) beforehand, so the order in which a set of four rosters is obtained is irrelevant. We've counted every assignment of the players $4!=24$ times instead of just once.
To compensate for this we can simply divide by $24$.
The final result is
$$ displaystylefrac{ displaystylebinom{40}{16} displaystylebinom{24}{6} displaystylebinom{18}{6} displaystylebinom{12}{6} displaystylebinom{16}{4} displaystylebinom{12}{4} displaystylebinom{8}{4}}{24} $$
$endgroup$
add a comment |
$begingroup$
There are: $$frac{40!}{4!^46!^4}$$ways to split up the $40$ players in $4$ groups of $4$ and $4$ groups of $6$ in such a way that every player is member of exactly one group, and ordering of the groups of $4$ as well as ordering of the groups of $6$ counts.
Then there are: $$frac1{4!}frac1{4!}frac{40!}{4!^46!^4}=frac{40!}{4!^66!^4}$$ways to split up the $40$ players in $4$ groups of $4$ and $4$ groups of $6$ in such a way that every player is member of exactly one group, and ordering of the groups of $4$ as well as ordering of the groups of $6$ does not count.
This determines $4$ selections and $4$ reserve-teams.
There are $4!$ ways to connect each selection with one reserve team.
That gives a total of: $$4!timesfrac{40!}{4!^66!^4}=frac{40!}{4!^56!^4}$$possibilities.
$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%2f3078168%2fcounting-the-ways-to-form-4-different-teams%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
You're on the right track.
The number of ways to pick Team 1 is equal to $binom{40}6cdotbinom{34}4$. After that, the number of ways to pick out Team 2 is $binom{30}6cdot binom{24}4$. And so on.
Ultimately, the number of ways to pick out the full $4$ teams is
$$
binom{40}6cdotbinom{34}4cdotbinom{30}6cdotbinom{24}4cdotbinom{20}6cdotbinom{14}4cdotbinom{10}6cdotbinom{4}4\
= frac{40!}{(6!)^4cdot (4!)^4}
$$
(Also known as the multinomial coefficient $binom{40}{6, 4, 6, 4, 6, 4, 6, 4}$.)
However, we don't care which team is Team 1 and which team is Team 4. We just care which four teams are picked. Since the same four teams can be picked out in $4!$ ways, the total number of different team compositions is
$$
frac{40!}{(6!)^4cdot (4!)^5}
$$
$endgroup$
add a comment |
$begingroup$
You're on the right track.
The number of ways to pick Team 1 is equal to $binom{40}6cdotbinom{34}4$. After that, the number of ways to pick out Team 2 is $binom{30}6cdot binom{24}4$. And so on.
Ultimately, the number of ways to pick out the full $4$ teams is
$$
binom{40}6cdotbinom{34}4cdotbinom{30}6cdotbinom{24}4cdotbinom{20}6cdotbinom{14}4cdotbinom{10}6cdotbinom{4}4\
= frac{40!}{(6!)^4cdot (4!)^4}
$$
(Also known as the multinomial coefficient $binom{40}{6, 4, 6, 4, 6, 4, 6, 4}$.)
However, we don't care which team is Team 1 and which team is Team 4. We just care which four teams are picked. Since the same four teams can be picked out in $4!$ ways, the total number of different team compositions is
$$
frac{40!}{(6!)^4cdot (4!)^5}
$$
$endgroup$
add a comment |
$begingroup$
You're on the right track.
The number of ways to pick Team 1 is equal to $binom{40}6cdotbinom{34}4$. After that, the number of ways to pick out Team 2 is $binom{30}6cdot binom{24}4$. And so on.
Ultimately, the number of ways to pick out the full $4$ teams is
$$
binom{40}6cdotbinom{34}4cdotbinom{30}6cdotbinom{24}4cdotbinom{20}6cdotbinom{14}4cdotbinom{10}6cdotbinom{4}4\
= frac{40!}{(6!)^4cdot (4!)^4}
$$
(Also known as the multinomial coefficient $binom{40}{6, 4, 6, 4, 6, 4, 6, 4}$.)
However, we don't care which team is Team 1 and which team is Team 4. We just care which four teams are picked. Since the same four teams can be picked out in $4!$ ways, the total number of different team compositions is
$$
frac{40!}{(6!)^4cdot (4!)^5}
$$
$endgroup$
You're on the right track.
The number of ways to pick Team 1 is equal to $binom{40}6cdotbinom{34}4$. After that, the number of ways to pick out Team 2 is $binom{30}6cdot binom{24}4$. And so on.
Ultimately, the number of ways to pick out the full $4$ teams is
$$
binom{40}6cdotbinom{34}4cdotbinom{30}6cdotbinom{24}4cdotbinom{20}6cdotbinom{14}4cdotbinom{10}6cdotbinom{4}4\
= frac{40!}{(6!)^4cdot (4!)^4}
$$
(Also known as the multinomial coefficient $binom{40}{6, 4, 6, 4, 6, 4, 6, 4}$.)
However, we don't care which team is Team 1 and which team is Team 4. We just care which four teams are picked. Since the same four teams can be picked out in $4!$ ways, the total number of different team compositions is
$$
frac{40!}{(6!)^4cdot (4!)^5}
$$
answered 2 days ago
ArthurArthur
112k7109192
112k7109192
add a comment |
add a comment |
$begingroup$
I would do it a little different. First split 40 players in to groups of 10 players, that we can do on $$a= {1over 4!} cdot {40choose 10}cdot {30choose 10}cdot {20choose 10}cdot {10choose 10}$$
ways.
Now in each group choose 4 reserve players, so we can do that on $b={10choose 4}^4$ ways.
Thus the result is $$ acdot b = {40!over 4!^5cdot 6!^4}$$
$endgroup$
$begingroup$
Wow, your method is much quicker than mine! +1
$endgroup$
– Zubin Mukerjee
2 days ago
add a comment |
$begingroup$
I would do it a little different. First split 40 players in to groups of 10 players, that we can do on $$a= {1over 4!} cdot {40choose 10}cdot {30choose 10}cdot {20choose 10}cdot {10choose 10}$$
ways.
Now in each group choose 4 reserve players, so we can do that on $b={10choose 4}^4$ ways.
Thus the result is $$ acdot b = {40!over 4!^5cdot 6!^4}$$
$endgroup$
$begingroup$
Wow, your method is much quicker than mine! +1
$endgroup$
– Zubin Mukerjee
2 days ago
add a comment |
$begingroup$
I would do it a little different. First split 40 players in to groups of 10 players, that we can do on $$a= {1over 4!} cdot {40choose 10}cdot {30choose 10}cdot {20choose 10}cdot {10choose 10}$$
ways.
Now in each group choose 4 reserve players, so we can do that on $b={10choose 4}^4$ ways.
Thus the result is $$ acdot b = {40!over 4!^5cdot 6!^4}$$
$endgroup$
I would do it a little different. First split 40 players in to groups of 10 players, that we can do on $$a= {1over 4!} cdot {40choose 10}cdot {30choose 10}cdot {20choose 10}cdot {10choose 10}$$
ways.
Now in each group choose 4 reserve players, so we can do that on $b={10choose 4}^4$ ways.
Thus the result is $$ acdot b = {40!over 4!^5cdot 6!^4}$$
answered 2 days ago
greedoidgreedoid
39k114797
39k114797
$begingroup$
Wow, your method is much quicker than mine! +1
$endgroup$
– Zubin Mukerjee
2 days ago
add a comment |
$begingroup$
Wow, your method is much quicker than mine! +1
$endgroup$
– Zubin Mukerjee
2 days ago
$begingroup$
Wow, your method is much quicker than mine! +1
$endgroup$
– Zubin Mukerjee
2 days ago
$begingroup$
Wow, your method is much quicker than mine! +1
$endgroup$
– Zubin Mukerjee
2 days ago
add a comment |
$begingroup$
The number of ways to choose which players are reserves is $$binom{40}{16} $$
The remaining $24$ players are starters.
The number of ways to choose the $6$ starters on the first team is $$binom{24}{6} $$
Given this, the number of ways to choose the $6$ starters on the second team from the remaining $18$ choices is $$binom{18}{6}$$
Similarly, the third team's starters: $$binom{12}{6} $$
The remaining $6$ must start for the last team.
The total number of ways to arrange the starters within teams is
$$ binom{24}{6} binom{18}{6} binom{12}{6}$$
The same reasoning applies to reserves, and the total number of ways to arrange the reserves within teams is
$$ binom{16}{4} binom{12}{4} binom{8}{4}$$
Finally, the teams are not given distinguishing features (such as names) beforehand, so the order in which a set of four rosters is obtained is irrelevant. We've counted every assignment of the players $4!=24$ times instead of just once.
To compensate for this we can simply divide by $24$.
The final result is
$$ displaystylefrac{ displaystylebinom{40}{16} displaystylebinom{24}{6} displaystylebinom{18}{6} displaystylebinom{12}{6} displaystylebinom{16}{4} displaystylebinom{12}{4} displaystylebinom{8}{4}}{24} $$
$endgroup$
add a comment |
$begingroup$
The number of ways to choose which players are reserves is $$binom{40}{16} $$
The remaining $24$ players are starters.
The number of ways to choose the $6$ starters on the first team is $$binom{24}{6} $$
Given this, the number of ways to choose the $6$ starters on the second team from the remaining $18$ choices is $$binom{18}{6}$$
Similarly, the third team's starters: $$binom{12}{6} $$
The remaining $6$ must start for the last team.
The total number of ways to arrange the starters within teams is
$$ binom{24}{6} binom{18}{6} binom{12}{6}$$
The same reasoning applies to reserves, and the total number of ways to arrange the reserves within teams is
$$ binom{16}{4} binom{12}{4} binom{8}{4}$$
Finally, the teams are not given distinguishing features (such as names) beforehand, so the order in which a set of four rosters is obtained is irrelevant. We've counted every assignment of the players $4!=24$ times instead of just once.
To compensate for this we can simply divide by $24$.
The final result is
$$ displaystylefrac{ displaystylebinom{40}{16} displaystylebinom{24}{6} displaystylebinom{18}{6} displaystylebinom{12}{6} displaystylebinom{16}{4} displaystylebinom{12}{4} displaystylebinom{8}{4}}{24} $$
$endgroup$
add a comment |
$begingroup$
The number of ways to choose which players are reserves is $$binom{40}{16} $$
The remaining $24$ players are starters.
The number of ways to choose the $6$ starters on the first team is $$binom{24}{6} $$
Given this, the number of ways to choose the $6$ starters on the second team from the remaining $18$ choices is $$binom{18}{6}$$
Similarly, the third team's starters: $$binom{12}{6} $$
The remaining $6$ must start for the last team.
The total number of ways to arrange the starters within teams is
$$ binom{24}{6} binom{18}{6} binom{12}{6}$$
The same reasoning applies to reserves, and the total number of ways to arrange the reserves within teams is
$$ binom{16}{4} binom{12}{4} binom{8}{4}$$
Finally, the teams are not given distinguishing features (such as names) beforehand, so the order in which a set of four rosters is obtained is irrelevant. We've counted every assignment of the players $4!=24$ times instead of just once.
To compensate for this we can simply divide by $24$.
The final result is
$$ displaystylefrac{ displaystylebinom{40}{16} displaystylebinom{24}{6} displaystylebinom{18}{6} displaystylebinom{12}{6} displaystylebinom{16}{4} displaystylebinom{12}{4} displaystylebinom{8}{4}}{24} $$
$endgroup$
The number of ways to choose which players are reserves is $$binom{40}{16} $$
The remaining $24$ players are starters.
The number of ways to choose the $6$ starters on the first team is $$binom{24}{6} $$
Given this, the number of ways to choose the $6$ starters on the second team from the remaining $18$ choices is $$binom{18}{6}$$
Similarly, the third team's starters: $$binom{12}{6} $$
The remaining $6$ must start for the last team.
The total number of ways to arrange the starters within teams is
$$ binom{24}{6} binom{18}{6} binom{12}{6}$$
The same reasoning applies to reserves, and the total number of ways to arrange the reserves within teams is
$$ binom{16}{4} binom{12}{4} binom{8}{4}$$
Finally, the teams are not given distinguishing features (such as names) beforehand, so the order in which a set of four rosters is obtained is irrelevant. We've counted every assignment of the players $4!=24$ times instead of just once.
To compensate for this we can simply divide by $24$.
The final result is
$$ displaystylefrac{ displaystylebinom{40}{16} displaystylebinom{24}{6} displaystylebinom{18}{6} displaystylebinom{12}{6} displaystylebinom{16}{4} displaystylebinom{12}{4} displaystylebinom{8}{4}}{24} $$
answered 2 days ago
Zubin MukerjeeZubin Mukerjee
14.9k32658
14.9k32658
add a comment |
add a comment |
$begingroup$
There are: $$frac{40!}{4!^46!^4}$$ways to split up the $40$ players in $4$ groups of $4$ and $4$ groups of $6$ in such a way that every player is member of exactly one group, and ordering of the groups of $4$ as well as ordering of the groups of $6$ counts.
Then there are: $$frac1{4!}frac1{4!}frac{40!}{4!^46!^4}=frac{40!}{4!^66!^4}$$ways to split up the $40$ players in $4$ groups of $4$ and $4$ groups of $6$ in such a way that every player is member of exactly one group, and ordering of the groups of $4$ as well as ordering of the groups of $6$ does not count.
This determines $4$ selections and $4$ reserve-teams.
There are $4!$ ways to connect each selection with one reserve team.
That gives a total of: $$4!timesfrac{40!}{4!^66!^4}=frac{40!}{4!^56!^4}$$possibilities.
$endgroup$
add a comment |
$begingroup$
There are: $$frac{40!}{4!^46!^4}$$ways to split up the $40$ players in $4$ groups of $4$ and $4$ groups of $6$ in such a way that every player is member of exactly one group, and ordering of the groups of $4$ as well as ordering of the groups of $6$ counts.
Then there are: $$frac1{4!}frac1{4!}frac{40!}{4!^46!^4}=frac{40!}{4!^66!^4}$$ways to split up the $40$ players in $4$ groups of $4$ and $4$ groups of $6$ in such a way that every player is member of exactly one group, and ordering of the groups of $4$ as well as ordering of the groups of $6$ does not count.
This determines $4$ selections and $4$ reserve-teams.
There are $4!$ ways to connect each selection with one reserve team.
That gives a total of: $$4!timesfrac{40!}{4!^66!^4}=frac{40!}{4!^56!^4}$$possibilities.
$endgroup$
add a comment |
$begingroup$
There are: $$frac{40!}{4!^46!^4}$$ways to split up the $40$ players in $4$ groups of $4$ and $4$ groups of $6$ in such a way that every player is member of exactly one group, and ordering of the groups of $4$ as well as ordering of the groups of $6$ counts.
Then there are: $$frac1{4!}frac1{4!}frac{40!}{4!^46!^4}=frac{40!}{4!^66!^4}$$ways to split up the $40$ players in $4$ groups of $4$ and $4$ groups of $6$ in such a way that every player is member of exactly one group, and ordering of the groups of $4$ as well as ordering of the groups of $6$ does not count.
This determines $4$ selections and $4$ reserve-teams.
There are $4!$ ways to connect each selection with one reserve team.
That gives a total of: $$4!timesfrac{40!}{4!^66!^4}=frac{40!}{4!^56!^4}$$possibilities.
$endgroup$
There are: $$frac{40!}{4!^46!^4}$$ways to split up the $40$ players in $4$ groups of $4$ and $4$ groups of $6$ in such a way that every player is member of exactly one group, and ordering of the groups of $4$ as well as ordering of the groups of $6$ counts.
Then there are: $$frac1{4!}frac1{4!}frac{40!}{4!^46!^4}=frac{40!}{4!^66!^4}$$ways to split up the $40$ players in $4$ groups of $4$ and $4$ groups of $6$ in such a way that every player is member of exactly one group, and ordering of the groups of $4$ as well as ordering of the groups of $6$ does not count.
This determines $4$ selections and $4$ reserve-teams.
There are $4!$ ways to connect each selection with one reserve team.
That gives a total of: $$4!timesfrac{40!}{4!^66!^4}=frac{40!}{4!^56!^4}$$possibilities.
edited 2 days ago
answered 2 days ago
drhabdrhab
99.3k544130
99.3k544130
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%2f3078168%2fcounting-the-ways-to-form-4-different-teams%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