How can I solve this using permutations?
$begingroup$
Delegates from 10 countries, including Russia, France, England and the United States are to be seated in a row. How many different seating arrangements are possible if the French and English delegates are to be seated next to each other and the Russian and American delegates are not to be next to each other?
The approach I took was first determining the total possible arrangements and then subtracting out the ones that won't work as per the given conditions. So, the total possible arrangments is $10!$. Take the first condition where the French and English delegates must be seated next to each other. Pick a spot for the French delegate. Now, if the French delegate is at one of the end seats, then there is only $1$ spot for the English delegate. This constitutes $2$ possibilities for their seating. Now, if the French delegate is in one of the $8$ interior seats, the English delegate has $2$ possible seats for each one so $16$ pairs. A similar approach would be taken for the Russian and American delegates. Am I heading in the right direction? Any help would be greatly appreciated. Thanks!
probability
$endgroup$
add a comment |
$begingroup$
Delegates from 10 countries, including Russia, France, England and the United States are to be seated in a row. How many different seating arrangements are possible if the French and English delegates are to be seated next to each other and the Russian and American delegates are not to be next to each other?
The approach I took was first determining the total possible arrangements and then subtracting out the ones that won't work as per the given conditions. So, the total possible arrangments is $10!$. Take the first condition where the French and English delegates must be seated next to each other. Pick a spot for the French delegate. Now, if the French delegate is at one of the end seats, then there is only $1$ spot for the English delegate. This constitutes $2$ possibilities for their seating. Now, if the French delegate is in one of the $8$ interior seats, the English delegate has $2$ possible seats for each one so $16$ pairs. A similar approach would be taken for the Russian and American delegates. Am I heading in the right direction? Any help would be greatly appreciated. Thanks!
probability
$endgroup$
add a comment |
$begingroup$
Delegates from 10 countries, including Russia, France, England and the United States are to be seated in a row. How many different seating arrangements are possible if the French and English delegates are to be seated next to each other and the Russian and American delegates are not to be next to each other?
The approach I took was first determining the total possible arrangements and then subtracting out the ones that won't work as per the given conditions. So, the total possible arrangments is $10!$. Take the first condition where the French and English delegates must be seated next to each other. Pick a spot for the French delegate. Now, if the French delegate is at one of the end seats, then there is only $1$ spot for the English delegate. This constitutes $2$ possibilities for their seating. Now, if the French delegate is in one of the $8$ interior seats, the English delegate has $2$ possible seats for each one so $16$ pairs. A similar approach would be taken for the Russian and American delegates. Am I heading in the right direction? Any help would be greatly appreciated. Thanks!
probability
$endgroup$
Delegates from 10 countries, including Russia, France, England and the United States are to be seated in a row. How many different seating arrangements are possible if the French and English delegates are to be seated next to each other and the Russian and American delegates are not to be next to each other?
The approach I took was first determining the total possible arrangements and then subtracting out the ones that won't work as per the given conditions. So, the total possible arrangments is $10!$. Take the first condition where the French and English delegates must be seated next to each other. Pick a spot for the French delegate. Now, if the French delegate is at one of the end seats, then there is only $1$ spot for the English delegate. This constitutes $2$ possibilities for their seating. Now, if the French delegate is in one of the $8$ interior seats, the English delegate has $2$ possible seats for each one so $16$ pairs. A similar approach would be taken for the Russian and American delegates. Am I heading in the right direction? Any help would be greatly appreciated. Thanks!
probability
probability
asked Jan 23 '15 at 17:10
RXY15RXY15
4711513
4711513
add a comment |
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
There are total 10 delegates.
French and English delegates are to sit together.
Considering French and English delegate as a single entity (or another delegate), there are total 9 entities which can be arranged in $9!$ ways. Also French and English delegates can be arranged in $2!=2$ ways: (FE,EF).
So total: $9!times 2!$
Now its given that US and Russian delegates should not be sited together. To calculate total count with this condition, we calculate total ways in which US and Russian delegates sit together and subtract it from above.
With French and English delegates sited together, we have total 9 entities. Out of these, now we want to find in how many ways US and Russian delegates can sit together. Following same above approach. we interpret US and Russian delegate as single entity. So we are now having 8 entities which can be arranged in $8!$ ways. US and Russian delegates can be arranged in $2!$ ways among themselves: (UR,RU). Also considering French and English delegates can be arranged in $2!=2$ ways: (FE,EF).
So total: $8!times 2!times 2!$
Final answer is obtained by subtracting number of arrangements in which both
- US-Russian sit together and
- French-English sit together
from number of arrangements in which French-English sit together:
$9!times 2! - 8! times 2! times 2! = 564480$
Notice this follows principle of inclusion-exclusion.
Another approach
French and English delegates are to sit together.
Considering French and English delegate as a single entity (or another delegate), there are total 9 entities. Also French and English delegates can be arranged in $2!=2$ ways: (FE,EF).
Now out of those 9 entities, American and Russian delegates should not seat next to each other. So we first permute remaining 7 entities (6 delegates plus one entity containing French and English delegate) in $7!$ ways.
These 7 entities will have 8 gaps between them which can be occupied by American and Russian delegates, so that they wont seat next to each other. This can be done in ${}^8P_2$ ways.
So the total count: $2!times 7!times {}^8P_2=564480$
$endgroup$
$begingroup$
probably the best answer!
$endgroup$
– laura
Jun 27 '17 at 11:10
add a comment |
$begingroup$
First solve the problem for $9$ instead of $10$ delegates, in the sense that the French and English "go together". The outcome of it must be multiplied by factor $2$ because there are two orders possible: $FE$ and $EF$.
Place Russia. In the adapted problem there are $2+7=9$ possibilities. The $2$ stands for places completely on the right and completely on the left and the $7$ stands for the other places.
Now place the US. If Russia is placed completely on the left or completely on the right then there are $7$ possibilities for the US and in the other cases there are $6$.
Now $7$ spots are left for the rest leading to $7!$ possibilities.
So finally we come to $2times[2times7+7times6]times7!$ possibilities.
$endgroup$
add a comment |
$begingroup$
This is my approach:
2!* 9 * 8! - 2! *2! * 8 * 7!
(2! => number of ways French and English delegates arrange them-self. so they are single entity )
(9 => number of ways French and English delegates can sit from remaining 8 places )
ex:
F E _ _ _ _ _ _ _ _
_ F E _ _ _ _ _ _ _
_ _ _ F E _ _ _ _ _
and so on
_ _ _ _ _ _ _ _ F E
(8! => other 8 delegates arrangement possibilities )
Now another condition is US and Russian delegates not sit together. We can calculate by subtracting number of ways they sit together from the above ans.
(2! => number of ways US and Russian arrange them-self. so they are single entity)
(2! => number of ways French and English delegates arrange them-self. so they are single entity)
(8 => number of ways US and Russian delegates can sit from remaining 7 places )
ex:
U R _ _ _ _ _ _ F E
_ U R _ _ _ _ _ F E
and so on
F E _ _ _ _ _ _ U R
(7! => number of ways remaining 7 arrange them-self. Note: French and English are single entity )
$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%2f1116705%2fhow-can-i-solve-this-using-permutations%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
$begingroup$
There are total 10 delegates.
French and English delegates are to sit together.
Considering French and English delegate as a single entity (or another delegate), there are total 9 entities which can be arranged in $9!$ ways. Also French and English delegates can be arranged in $2!=2$ ways: (FE,EF).
So total: $9!times 2!$
Now its given that US and Russian delegates should not be sited together. To calculate total count with this condition, we calculate total ways in which US and Russian delegates sit together and subtract it from above.
With French and English delegates sited together, we have total 9 entities. Out of these, now we want to find in how many ways US and Russian delegates can sit together. Following same above approach. we interpret US and Russian delegate as single entity. So we are now having 8 entities which can be arranged in $8!$ ways. US and Russian delegates can be arranged in $2!$ ways among themselves: (UR,RU). Also considering French and English delegates can be arranged in $2!=2$ ways: (FE,EF).
So total: $8!times 2!times 2!$
Final answer is obtained by subtracting number of arrangements in which both
- US-Russian sit together and
- French-English sit together
from number of arrangements in which French-English sit together:
$9!times 2! - 8! times 2! times 2! = 564480$
Notice this follows principle of inclusion-exclusion.
Another approach
French and English delegates are to sit together.
Considering French and English delegate as a single entity (or another delegate), there are total 9 entities. Also French and English delegates can be arranged in $2!=2$ ways: (FE,EF).
Now out of those 9 entities, American and Russian delegates should not seat next to each other. So we first permute remaining 7 entities (6 delegates plus one entity containing French and English delegate) in $7!$ ways.
These 7 entities will have 8 gaps between them which can be occupied by American and Russian delegates, so that they wont seat next to each other. This can be done in ${}^8P_2$ ways.
So the total count: $2!times 7!times {}^8P_2=564480$
$endgroup$
$begingroup$
probably the best answer!
$endgroup$
– laura
Jun 27 '17 at 11:10
add a comment |
$begingroup$
There are total 10 delegates.
French and English delegates are to sit together.
Considering French and English delegate as a single entity (or another delegate), there are total 9 entities which can be arranged in $9!$ ways. Also French and English delegates can be arranged in $2!=2$ ways: (FE,EF).
So total: $9!times 2!$
Now its given that US and Russian delegates should not be sited together. To calculate total count with this condition, we calculate total ways in which US and Russian delegates sit together and subtract it from above.
With French and English delegates sited together, we have total 9 entities. Out of these, now we want to find in how many ways US and Russian delegates can sit together. Following same above approach. we interpret US and Russian delegate as single entity. So we are now having 8 entities which can be arranged in $8!$ ways. US and Russian delegates can be arranged in $2!$ ways among themselves: (UR,RU). Also considering French and English delegates can be arranged in $2!=2$ ways: (FE,EF).
So total: $8!times 2!times 2!$
Final answer is obtained by subtracting number of arrangements in which both
- US-Russian sit together and
- French-English sit together
from number of arrangements in which French-English sit together:
$9!times 2! - 8! times 2! times 2! = 564480$
Notice this follows principle of inclusion-exclusion.
Another approach
French and English delegates are to sit together.
Considering French and English delegate as a single entity (or another delegate), there are total 9 entities. Also French and English delegates can be arranged in $2!=2$ ways: (FE,EF).
Now out of those 9 entities, American and Russian delegates should not seat next to each other. So we first permute remaining 7 entities (6 delegates plus one entity containing French and English delegate) in $7!$ ways.
These 7 entities will have 8 gaps between them which can be occupied by American and Russian delegates, so that they wont seat next to each other. This can be done in ${}^8P_2$ ways.
So the total count: $2!times 7!times {}^8P_2=564480$
$endgroup$
$begingroup$
probably the best answer!
$endgroup$
– laura
Jun 27 '17 at 11:10
add a comment |
$begingroup$
There are total 10 delegates.
French and English delegates are to sit together.
Considering French and English delegate as a single entity (or another delegate), there are total 9 entities which can be arranged in $9!$ ways. Also French and English delegates can be arranged in $2!=2$ ways: (FE,EF).
So total: $9!times 2!$
Now its given that US and Russian delegates should not be sited together. To calculate total count with this condition, we calculate total ways in which US and Russian delegates sit together and subtract it from above.
With French and English delegates sited together, we have total 9 entities. Out of these, now we want to find in how many ways US and Russian delegates can sit together. Following same above approach. we interpret US and Russian delegate as single entity. So we are now having 8 entities which can be arranged in $8!$ ways. US and Russian delegates can be arranged in $2!$ ways among themselves: (UR,RU). Also considering French and English delegates can be arranged in $2!=2$ ways: (FE,EF).
So total: $8!times 2!times 2!$
Final answer is obtained by subtracting number of arrangements in which both
- US-Russian sit together and
- French-English sit together
from number of arrangements in which French-English sit together:
$9!times 2! - 8! times 2! times 2! = 564480$
Notice this follows principle of inclusion-exclusion.
Another approach
French and English delegates are to sit together.
Considering French and English delegate as a single entity (or another delegate), there are total 9 entities. Also French and English delegates can be arranged in $2!=2$ ways: (FE,EF).
Now out of those 9 entities, American and Russian delegates should not seat next to each other. So we first permute remaining 7 entities (6 delegates plus one entity containing French and English delegate) in $7!$ ways.
These 7 entities will have 8 gaps between them which can be occupied by American and Russian delegates, so that they wont seat next to each other. This can be done in ${}^8P_2$ ways.
So the total count: $2!times 7!times {}^8P_2=564480$
$endgroup$
There are total 10 delegates.
French and English delegates are to sit together.
Considering French and English delegate as a single entity (or another delegate), there are total 9 entities which can be arranged in $9!$ ways. Also French and English delegates can be arranged in $2!=2$ ways: (FE,EF).
So total: $9!times 2!$
Now its given that US and Russian delegates should not be sited together. To calculate total count with this condition, we calculate total ways in which US and Russian delegates sit together and subtract it from above.
With French and English delegates sited together, we have total 9 entities. Out of these, now we want to find in how many ways US and Russian delegates can sit together. Following same above approach. we interpret US and Russian delegate as single entity. So we are now having 8 entities which can be arranged in $8!$ ways. US and Russian delegates can be arranged in $2!$ ways among themselves: (UR,RU). Also considering French and English delegates can be arranged in $2!=2$ ways: (FE,EF).
So total: $8!times 2!times 2!$
Final answer is obtained by subtracting number of arrangements in which both
- US-Russian sit together and
- French-English sit together
from number of arrangements in which French-English sit together:
$9!times 2! - 8! times 2! times 2! = 564480$
Notice this follows principle of inclusion-exclusion.
Another approach
French and English delegates are to sit together.
Considering French and English delegate as a single entity (or another delegate), there are total 9 entities. Also French and English delegates can be arranged in $2!=2$ ways: (FE,EF).
Now out of those 9 entities, American and Russian delegates should not seat next to each other. So we first permute remaining 7 entities (6 delegates plus one entity containing French and English delegate) in $7!$ ways.
These 7 entities will have 8 gaps between them which can be occupied by American and Russian delegates, so that they wont seat next to each other. This can be done in ${}^8P_2$ ways.
So the total count: $2!times 7!times {}^8P_2=564480$
edited Oct 23 '17 at 9:29
answered Apr 16 '17 at 6:40
anir123anir123
875927
875927
$begingroup$
probably the best answer!
$endgroup$
– laura
Jun 27 '17 at 11:10
add a comment |
$begingroup$
probably the best answer!
$endgroup$
– laura
Jun 27 '17 at 11:10
$begingroup$
probably the best answer!
$endgroup$
– laura
Jun 27 '17 at 11:10
$begingroup$
probably the best answer!
$endgroup$
– laura
Jun 27 '17 at 11:10
add a comment |
$begingroup$
First solve the problem for $9$ instead of $10$ delegates, in the sense that the French and English "go together". The outcome of it must be multiplied by factor $2$ because there are two orders possible: $FE$ and $EF$.
Place Russia. In the adapted problem there are $2+7=9$ possibilities. The $2$ stands for places completely on the right and completely on the left and the $7$ stands for the other places.
Now place the US. If Russia is placed completely on the left or completely on the right then there are $7$ possibilities for the US and in the other cases there are $6$.
Now $7$ spots are left for the rest leading to $7!$ possibilities.
So finally we come to $2times[2times7+7times6]times7!$ possibilities.
$endgroup$
add a comment |
$begingroup$
First solve the problem for $9$ instead of $10$ delegates, in the sense that the French and English "go together". The outcome of it must be multiplied by factor $2$ because there are two orders possible: $FE$ and $EF$.
Place Russia. In the adapted problem there are $2+7=9$ possibilities. The $2$ stands for places completely on the right and completely on the left and the $7$ stands for the other places.
Now place the US. If Russia is placed completely on the left or completely on the right then there are $7$ possibilities for the US and in the other cases there are $6$.
Now $7$ spots are left for the rest leading to $7!$ possibilities.
So finally we come to $2times[2times7+7times6]times7!$ possibilities.
$endgroup$
add a comment |
$begingroup$
First solve the problem for $9$ instead of $10$ delegates, in the sense that the French and English "go together". The outcome of it must be multiplied by factor $2$ because there are two orders possible: $FE$ and $EF$.
Place Russia. In the adapted problem there are $2+7=9$ possibilities. The $2$ stands for places completely on the right and completely on the left and the $7$ stands for the other places.
Now place the US. If Russia is placed completely on the left or completely on the right then there are $7$ possibilities for the US and in the other cases there are $6$.
Now $7$ spots are left for the rest leading to $7!$ possibilities.
So finally we come to $2times[2times7+7times6]times7!$ possibilities.
$endgroup$
First solve the problem for $9$ instead of $10$ delegates, in the sense that the French and English "go together". The outcome of it must be multiplied by factor $2$ because there are two orders possible: $FE$ and $EF$.
Place Russia. In the adapted problem there are $2+7=9$ possibilities. The $2$ stands for places completely on the right and completely on the left and the $7$ stands for the other places.
Now place the US. If Russia is placed completely on the left or completely on the right then there are $7$ possibilities for the US and in the other cases there are $6$.
Now $7$ spots are left for the rest leading to $7!$ possibilities.
So finally we come to $2times[2times7+7times6]times7!$ possibilities.
edited Jan 23 '15 at 18:53
answered Jan 23 '15 at 17:28
drhabdrhab
102k545136
102k545136
add a comment |
add a comment |
$begingroup$
This is my approach:
2!* 9 * 8! - 2! *2! * 8 * 7!
(2! => number of ways French and English delegates arrange them-self. so they are single entity )
(9 => number of ways French and English delegates can sit from remaining 8 places )
ex:
F E _ _ _ _ _ _ _ _
_ F E _ _ _ _ _ _ _
_ _ _ F E _ _ _ _ _
and so on
_ _ _ _ _ _ _ _ F E
(8! => other 8 delegates arrangement possibilities )
Now another condition is US and Russian delegates not sit together. We can calculate by subtracting number of ways they sit together from the above ans.
(2! => number of ways US and Russian arrange them-self. so they are single entity)
(2! => number of ways French and English delegates arrange them-self. so they are single entity)
(8 => number of ways US and Russian delegates can sit from remaining 7 places )
ex:
U R _ _ _ _ _ _ F E
_ U R _ _ _ _ _ F E
and so on
F E _ _ _ _ _ _ U R
(7! => number of ways remaining 7 arrange them-self. Note: French and English are single entity )
$endgroup$
add a comment |
$begingroup$
This is my approach:
2!* 9 * 8! - 2! *2! * 8 * 7!
(2! => number of ways French and English delegates arrange them-self. so they are single entity )
(9 => number of ways French and English delegates can sit from remaining 8 places )
ex:
F E _ _ _ _ _ _ _ _
_ F E _ _ _ _ _ _ _
_ _ _ F E _ _ _ _ _
and so on
_ _ _ _ _ _ _ _ F E
(8! => other 8 delegates arrangement possibilities )
Now another condition is US and Russian delegates not sit together. We can calculate by subtracting number of ways they sit together from the above ans.
(2! => number of ways US and Russian arrange them-self. so they are single entity)
(2! => number of ways French and English delegates arrange them-self. so they are single entity)
(8 => number of ways US and Russian delegates can sit from remaining 7 places )
ex:
U R _ _ _ _ _ _ F E
_ U R _ _ _ _ _ F E
and so on
F E _ _ _ _ _ _ U R
(7! => number of ways remaining 7 arrange them-self. Note: French and English are single entity )
$endgroup$
add a comment |
$begingroup$
This is my approach:
2!* 9 * 8! - 2! *2! * 8 * 7!
(2! => number of ways French and English delegates arrange them-self. so they are single entity )
(9 => number of ways French and English delegates can sit from remaining 8 places )
ex:
F E _ _ _ _ _ _ _ _
_ F E _ _ _ _ _ _ _
_ _ _ F E _ _ _ _ _
and so on
_ _ _ _ _ _ _ _ F E
(8! => other 8 delegates arrangement possibilities )
Now another condition is US and Russian delegates not sit together. We can calculate by subtracting number of ways they sit together from the above ans.
(2! => number of ways US and Russian arrange them-self. so they are single entity)
(2! => number of ways French and English delegates arrange them-self. so they are single entity)
(8 => number of ways US and Russian delegates can sit from remaining 7 places )
ex:
U R _ _ _ _ _ _ F E
_ U R _ _ _ _ _ F E
and so on
F E _ _ _ _ _ _ U R
(7! => number of ways remaining 7 arrange them-self. Note: French and English are single entity )
$endgroup$
This is my approach:
2!* 9 * 8! - 2! *2! * 8 * 7!
(2! => number of ways French and English delegates arrange them-self. so they are single entity )
(9 => number of ways French and English delegates can sit from remaining 8 places )
ex:
F E _ _ _ _ _ _ _ _
_ F E _ _ _ _ _ _ _
_ _ _ F E _ _ _ _ _
and so on
_ _ _ _ _ _ _ _ F E
(8! => other 8 delegates arrangement possibilities )
Now another condition is US and Russian delegates not sit together. We can calculate by subtracting number of ways they sit together from the above ans.
(2! => number of ways US and Russian arrange them-self. so they are single entity)
(2! => number of ways French and English delegates arrange them-self. so they are single entity)
(8 => number of ways US and Russian delegates can sit from remaining 7 places )
ex:
U R _ _ _ _ _ _ F E
_ U R _ _ _ _ _ F E
and so on
F E _ _ _ _ _ _ U R
(7! => number of ways remaining 7 arrange them-self. Note: French and English are single entity )
answered Dec 29 '18 at 10:14
loyolaloyola
1011
1011
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%2f1116705%2fhow-can-i-solve-this-using-permutations%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