Probability of matching 5 cards from a deck of 40probability about playing a deck of cardsWhat is the probability that all 4 cards have different value?Probability in deck of only face cards.Probability of drawing >18 when drawing 3 cardsProbability of cards out of a deck52 cards are randomly drawn one by one and without replacement. What is the probability that an ace will appear before any of the cards 2 through 10?Probability of picking 2 queens and 1 king from a deck of cardsFinding expected value of number of kings drawn before the first Ace and its lower bound?a deck of cards has 54 cards…Expected number of cards needed to draw from 52 card deck to get a pair
3.5% Interest Student Loan or use all of my savings on Tuition?
The (Easy) Road to Code
Does an unused member variable take up memory?
What can I do if someone tampers with my SSH public key?
Limpar string com Regex
How to make sure I'm assertive enough in contact with subordinates?
Is it a Cyclops number? "Nobody" knows!
What is the orbit and expected lifetime of Crew Dragon trunk?
Why do phishing e-mails use faked e-mail addresses instead of the real one?
Do I need a return ticket to Canada if I'm a Japanese National?
Does the US political system, in principle, allow for a no-party system?
Was it really inappropriate to write a pull request for the company I interviewed with?
Boss Telling direct supervisor I snitched
How do you make a gun that shoots melee weapons and/or swords?
Is there a logarithm base for which the logarithm becomes an identity function?
Why would /etc/passwd be used every time someone executes `ls -l` command?
Why do we call complex numbers “numbers” but we don’t consider 2-vectors numbers?
What would be the most expensive material to an intergalactic society?
Tabular environment - text vertically positions itself by bottom of tikz picture in adjacent cell
How to install "rounded" brake pads
Is "cogitate" used appropriately in "I cogitate that success relies on hard work"?
Should I apply for my boss's promotion?
How would an energy-based "projectile" blow up a spaceship?
Short story about an infectious indestructible metal bar?
Probability of matching 5 cards from a deck of 40
probability about playing a deck of cardsWhat is the probability that all 4 cards have different value?Probability in deck of only face cards.Probability of drawing >18 when drawing 3 cardsProbability of cards out of a deck52 cards are randomly drawn one by one and without replacement. What is the probability that an ace will appear before any of the cards 2 through 10?Probability of picking 2 queens and 1 king from a deck of cardsFinding expected value of number of kings drawn before the first Ace and its lower bound?a deck of cards has 54 cards…Expected number of cards needed to draw from 52 card deck to get a pair
$begingroup$
Suppose we have a deck of 40 cards which has, 5 Aces, 6 Kings, 9 Queens, 20 Jacks. A game is played where a contestant will continuously draw cards until they have 5 matching cards (not necessarily in order). The cards are drawn without replacement.
I'm trying to find the probability of the contestant getting the five matching cards they get are all Aces (i.e. they have to get this before they get any other five matching cards).
Does anyone have any idea on how to approach this?
probability
$endgroup$
add a comment |
$begingroup$
Suppose we have a deck of 40 cards which has, 5 Aces, 6 Kings, 9 Queens, 20 Jacks. A game is played where a contestant will continuously draw cards until they have 5 matching cards (not necessarily in order). The cards are drawn without replacement.
I'm trying to find the probability of the contestant getting the five matching cards they get are all Aces (i.e. they have to get this before they get any other five matching cards).
Does anyone have any idea on how to approach this?
probability
$endgroup$
add a comment |
$begingroup$
Suppose we have a deck of 40 cards which has, 5 Aces, 6 Kings, 9 Queens, 20 Jacks. A game is played where a contestant will continuously draw cards until they have 5 matching cards (not necessarily in order). The cards are drawn without replacement.
I'm trying to find the probability of the contestant getting the five matching cards they get are all Aces (i.e. they have to get this before they get any other five matching cards).
Does anyone have any idea on how to approach this?
probability
$endgroup$
Suppose we have a deck of 40 cards which has, 5 Aces, 6 Kings, 9 Queens, 20 Jacks. A game is played where a contestant will continuously draw cards until they have 5 matching cards (not necessarily in order). The cards are drawn without replacement.
I'm trying to find the probability of the contestant getting the five matching cards they get are all Aces (i.e. they have to get this before they get any other five matching cards).
Does anyone have any idea on how to approach this?
probability
probability
asked 16 hours ago
DH.DH.
59115
59115
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Suppose a win occurs when the fifth ace is drawn on draw $r+1$, for $0 le r le 16$. On the previous draw, the hand must have contained four aces and no more than four of any of the other ranks, and then the contestant must draw an ace on draw $r+1$.
Let's try to find the probability of being in a favorable state on draw $r$. There are $binom40r$ possible hands of $r$ cards, all of which we assume are equally likely. We would like to count the number of hands containing exactly four aces and no more than four of any other rank, which we will call a "favorable hand". To do this, we will find the generating function of the number of favorable hands. Numbering the ranks from ace to jack as $1$ through $4$, let's say $n_i$ is the initial number of cards in the deck of rank $i$, for $i=1,2,3,4$, so $n_1 = 5$, $n_2=6$, etc. If we consider only cards of rank $i$, then the generating function for the number of hands containing zero to four of those cards is
$$sum_j=0^4 binomn_ij x^j$$
The generating function for the number of ways to draw exactly four aces is simply $binom54x^4$; so the generating function for the number of favorable hands containing cards of all ranks is
$$f(x) = binom54x^4 prod_i=2^4 sum_j=0^4 binomn_ij x^j$$
I.e., the coefficient of $x^r$ when $f(x)$ is expanded, which which we will denote by $[x^r]f(x)$, is the number of hands containing exactly four aces and no more than four of any other rank. After some computation (I used Mathematica, but a pencil and paper computation should not be difficult),
$$f(x) = 5 x^4+175 x^5+2975 x^6+32725 x^7+261800 x^8+ \
1544980 x^9+6741525 x^10+21960225
x^11+53723775 x^12+ \ 96756975 x^13+122906250 x^14 +102343500
x^15+45785250 x^16$$
The probability of a favorable hand of $r$ cards is then
$$frac[x^r]f(x)binom40r$$
In order to win on draw $r+1$ the player must have a favorable hand on draw $r$ and then draw an ace on draw $r+1$, when there is one ace left in the deck and $40-r$ cards total. So the probability of a win on draw $r+1$ is
$$frac[x^r]f(x)binom40r cdot frac140-r$$
and the overall probability of winning is
$$sum_r=0^16 frac[x^r]f(x)binom40r cdot frac140-r = boxed0.00194347$$
$endgroup$
$begingroup$
@user What do you mean by $p_1$?
$endgroup$
– awkward
10 hours ago
$begingroup$
@user Oh I see, you mean $p_i$ is the probability that rank $i$ is the first rank to get 5 cards. I haven't computed those other probabilities, but the probability I computed for aces is consistent with Monte Carlo results, so I'm pretty sure it's correct. If you see something wrong with the solution, please be specific.
$endgroup$
– awkward
9 hours ago
$begingroup$
@user OK, what are your numbers?
$endgroup$
– awkward
9 hours ago
$begingroup$
@awkward my monte carlo simulation comes up with the same answer as you awkward. Do you have any material to read about generating functions as I have not come across them before?
$endgroup$
– DH.
8 hours ago
$begingroup$
@DH. I would recommend actuarial course notes (if you can get your hands on them) great source for material on generating functions!
$endgroup$
– The Problem
8 hours ago
|
show 5 more comments
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%2f3140034%2fprobability-of-matching-5-cards-from-a-deck-of-40%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$
Suppose a win occurs when the fifth ace is drawn on draw $r+1$, for $0 le r le 16$. On the previous draw, the hand must have contained four aces and no more than four of any of the other ranks, and then the contestant must draw an ace on draw $r+1$.
Let's try to find the probability of being in a favorable state on draw $r$. There are $binom40r$ possible hands of $r$ cards, all of which we assume are equally likely. We would like to count the number of hands containing exactly four aces and no more than four of any other rank, which we will call a "favorable hand". To do this, we will find the generating function of the number of favorable hands. Numbering the ranks from ace to jack as $1$ through $4$, let's say $n_i$ is the initial number of cards in the deck of rank $i$, for $i=1,2,3,4$, so $n_1 = 5$, $n_2=6$, etc. If we consider only cards of rank $i$, then the generating function for the number of hands containing zero to four of those cards is
$$sum_j=0^4 binomn_ij x^j$$
The generating function for the number of ways to draw exactly four aces is simply $binom54x^4$; so the generating function for the number of favorable hands containing cards of all ranks is
$$f(x) = binom54x^4 prod_i=2^4 sum_j=0^4 binomn_ij x^j$$
I.e., the coefficient of $x^r$ when $f(x)$ is expanded, which which we will denote by $[x^r]f(x)$, is the number of hands containing exactly four aces and no more than four of any other rank. After some computation (I used Mathematica, but a pencil and paper computation should not be difficult),
$$f(x) = 5 x^4+175 x^5+2975 x^6+32725 x^7+261800 x^8+ \
1544980 x^9+6741525 x^10+21960225
x^11+53723775 x^12+ \ 96756975 x^13+122906250 x^14 +102343500
x^15+45785250 x^16$$
The probability of a favorable hand of $r$ cards is then
$$frac[x^r]f(x)binom40r$$
In order to win on draw $r+1$ the player must have a favorable hand on draw $r$ and then draw an ace on draw $r+1$, when there is one ace left in the deck and $40-r$ cards total. So the probability of a win on draw $r+1$ is
$$frac[x^r]f(x)binom40r cdot frac140-r$$
and the overall probability of winning is
$$sum_r=0^16 frac[x^r]f(x)binom40r cdot frac140-r = boxed0.00194347$$
$endgroup$
$begingroup$
@user What do you mean by $p_1$?
$endgroup$
– awkward
10 hours ago
$begingroup$
@user Oh I see, you mean $p_i$ is the probability that rank $i$ is the first rank to get 5 cards. I haven't computed those other probabilities, but the probability I computed for aces is consistent with Monte Carlo results, so I'm pretty sure it's correct. If you see something wrong with the solution, please be specific.
$endgroup$
– awkward
9 hours ago
$begingroup$
@user OK, what are your numbers?
$endgroup$
– awkward
9 hours ago
$begingroup$
@awkward my monte carlo simulation comes up with the same answer as you awkward. Do you have any material to read about generating functions as I have not come across them before?
$endgroup$
– DH.
8 hours ago
$begingroup$
@DH. I would recommend actuarial course notes (if you can get your hands on them) great source for material on generating functions!
$endgroup$
– The Problem
8 hours ago
|
show 5 more comments
$begingroup$
Suppose a win occurs when the fifth ace is drawn on draw $r+1$, for $0 le r le 16$. On the previous draw, the hand must have contained four aces and no more than four of any of the other ranks, and then the contestant must draw an ace on draw $r+1$.
Let's try to find the probability of being in a favorable state on draw $r$. There are $binom40r$ possible hands of $r$ cards, all of which we assume are equally likely. We would like to count the number of hands containing exactly four aces and no more than four of any other rank, which we will call a "favorable hand". To do this, we will find the generating function of the number of favorable hands. Numbering the ranks from ace to jack as $1$ through $4$, let's say $n_i$ is the initial number of cards in the deck of rank $i$, for $i=1,2,3,4$, so $n_1 = 5$, $n_2=6$, etc. If we consider only cards of rank $i$, then the generating function for the number of hands containing zero to four of those cards is
$$sum_j=0^4 binomn_ij x^j$$
The generating function for the number of ways to draw exactly four aces is simply $binom54x^4$; so the generating function for the number of favorable hands containing cards of all ranks is
$$f(x) = binom54x^4 prod_i=2^4 sum_j=0^4 binomn_ij x^j$$
I.e., the coefficient of $x^r$ when $f(x)$ is expanded, which which we will denote by $[x^r]f(x)$, is the number of hands containing exactly four aces and no more than four of any other rank. After some computation (I used Mathematica, but a pencil and paper computation should not be difficult),
$$f(x) = 5 x^4+175 x^5+2975 x^6+32725 x^7+261800 x^8+ \
1544980 x^9+6741525 x^10+21960225
x^11+53723775 x^12+ \ 96756975 x^13+122906250 x^14 +102343500
x^15+45785250 x^16$$
The probability of a favorable hand of $r$ cards is then
$$frac[x^r]f(x)binom40r$$
In order to win on draw $r+1$ the player must have a favorable hand on draw $r$ and then draw an ace on draw $r+1$, when there is one ace left in the deck and $40-r$ cards total. So the probability of a win on draw $r+1$ is
$$frac[x^r]f(x)binom40r cdot frac140-r$$
and the overall probability of winning is
$$sum_r=0^16 frac[x^r]f(x)binom40r cdot frac140-r = boxed0.00194347$$
$endgroup$
$begingroup$
@user What do you mean by $p_1$?
$endgroup$
– awkward
10 hours ago
$begingroup$
@user Oh I see, you mean $p_i$ is the probability that rank $i$ is the first rank to get 5 cards. I haven't computed those other probabilities, but the probability I computed for aces is consistent with Monte Carlo results, so I'm pretty sure it's correct. If you see something wrong with the solution, please be specific.
$endgroup$
– awkward
9 hours ago
$begingroup$
@user OK, what are your numbers?
$endgroup$
– awkward
9 hours ago
$begingroup$
@awkward my monte carlo simulation comes up with the same answer as you awkward. Do you have any material to read about generating functions as I have not come across them before?
$endgroup$
– DH.
8 hours ago
$begingroup$
@DH. I would recommend actuarial course notes (if you can get your hands on them) great source for material on generating functions!
$endgroup$
– The Problem
8 hours ago
|
show 5 more comments
$begingroup$
Suppose a win occurs when the fifth ace is drawn on draw $r+1$, for $0 le r le 16$. On the previous draw, the hand must have contained four aces and no more than four of any of the other ranks, and then the contestant must draw an ace on draw $r+1$.
Let's try to find the probability of being in a favorable state on draw $r$. There are $binom40r$ possible hands of $r$ cards, all of which we assume are equally likely. We would like to count the number of hands containing exactly four aces and no more than four of any other rank, which we will call a "favorable hand". To do this, we will find the generating function of the number of favorable hands. Numbering the ranks from ace to jack as $1$ through $4$, let's say $n_i$ is the initial number of cards in the deck of rank $i$, for $i=1,2,3,4$, so $n_1 = 5$, $n_2=6$, etc. If we consider only cards of rank $i$, then the generating function for the number of hands containing zero to four of those cards is
$$sum_j=0^4 binomn_ij x^j$$
The generating function for the number of ways to draw exactly four aces is simply $binom54x^4$; so the generating function for the number of favorable hands containing cards of all ranks is
$$f(x) = binom54x^4 prod_i=2^4 sum_j=0^4 binomn_ij x^j$$
I.e., the coefficient of $x^r$ when $f(x)$ is expanded, which which we will denote by $[x^r]f(x)$, is the number of hands containing exactly four aces and no more than four of any other rank. After some computation (I used Mathematica, but a pencil and paper computation should not be difficult),
$$f(x) = 5 x^4+175 x^5+2975 x^6+32725 x^7+261800 x^8+ \
1544980 x^9+6741525 x^10+21960225
x^11+53723775 x^12+ \ 96756975 x^13+122906250 x^14 +102343500
x^15+45785250 x^16$$
The probability of a favorable hand of $r$ cards is then
$$frac[x^r]f(x)binom40r$$
In order to win on draw $r+1$ the player must have a favorable hand on draw $r$ and then draw an ace on draw $r+1$, when there is one ace left in the deck and $40-r$ cards total. So the probability of a win on draw $r+1$ is
$$frac[x^r]f(x)binom40r cdot frac140-r$$
and the overall probability of winning is
$$sum_r=0^16 frac[x^r]f(x)binom40r cdot frac140-r = boxed0.00194347$$
$endgroup$
Suppose a win occurs when the fifth ace is drawn on draw $r+1$, for $0 le r le 16$. On the previous draw, the hand must have contained four aces and no more than four of any of the other ranks, and then the contestant must draw an ace on draw $r+1$.
Let's try to find the probability of being in a favorable state on draw $r$. There are $binom40r$ possible hands of $r$ cards, all of which we assume are equally likely. We would like to count the number of hands containing exactly four aces and no more than four of any other rank, which we will call a "favorable hand". To do this, we will find the generating function of the number of favorable hands. Numbering the ranks from ace to jack as $1$ through $4$, let's say $n_i$ is the initial number of cards in the deck of rank $i$, for $i=1,2,3,4$, so $n_1 = 5$, $n_2=6$, etc. If we consider only cards of rank $i$, then the generating function for the number of hands containing zero to four of those cards is
$$sum_j=0^4 binomn_ij x^j$$
The generating function for the number of ways to draw exactly four aces is simply $binom54x^4$; so the generating function for the number of favorable hands containing cards of all ranks is
$$f(x) = binom54x^4 prod_i=2^4 sum_j=0^4 binomn_ij x^j$$
I.e., the coefficient of $x^r$ when $f(x)$ is expanded, which which we will denote by $[x^r]f(x)$, is the number of hands containing exactly four aces and no more than four of any other rank. After some computation (I used Mathematica, but a pencil and paper computation should not be difficult),
$$f(x) = 5 x^4+175 x^5+2975 x^6+32725 x^7+261800 x^8+ \
1544980 x^9+6741525 x^10+21960225
x^11+53723775 x^12+ \ 96756975 x^13+122906250 x^14 +102343500
x^15+45785250 x^16$$
The probability of a favorable hand of $r$ cards is then
$$frac[x^r]f(x)binom40r$$
In order to win on draw $r+1$ the player must have a favorable hand on draw $r$ and then draw an ace on draw $r+1$, when there is one ace left in the deck and $40-r$ cards total. So the probability of a win on draw $r+1$ is
$$frac[x^r]f(x)binom40r cdot frac140-r$$
and the overall probability of winning is
$$sum_r=0^16 frac[x^r]f(x)binom40r cdot frac140-r = boxed0.00194347$$
edited 7 hours ago
answered 12 hours ago
awkwardawkward
6,24811022
6,24811022
$begingroup$
@user What do you mean by $p_1$?
$endgroup$
– awkward
10 hours ago
$begingroup$
@user Oh I see, you mean $p_i$ is the probability that rank $i$ is the first rank to get 5 cards. I haven't computed those other probabilities, but the probability I computed for aces is consistent with Monte Carlo results, so I'm pretty sure it's correct. If you see something wrong with the solution, please be specific.
$endgroup$
– awkward
9 hours ago
$begingroup$
@user OK, what are your numbers?
$endgroup$
– awkward
9 hours ago
$begingroup$
@awkward my monte carlo simulation comes up with the same answer as you awkward. Do you have any material to read about generating functions as I have not come across them before?
$endgroup$
– DH.
8 hours ago
$begingroup$
@DH. I would recommend actuarial course notes (if you can get your hands on them) great source for material on generating functions!
$endgroup$
– The Problem
8 hours ago
|
show 5 more comments
$begingroup$
@user What do you mean by $p_1$?
$endgroup$
– awkward
10 hours ago
$begingroup$
@user Oh I see, you mean $p_i$ is the probability that rank $i$ is the first rank to get 5 cards. I haven't computed those other probabilities, but the probability I computed for aces is consistent with Monte Carlo results, so I'm pretty sure it's correct. If you see something wrong with the solution, please be specific.
$endgroup$
– awkward
9 hours ago
$begingroup$
@user OK, what are your numbers?
$endgroup$
– awkward
9 hours ago
$begingroup$
@awkward my monte carlo simulation comes up with the same answer as you awkward. Do you have any material to read about generating functions as I have not come across them before?
$endgroup$
– DH.
8 hours ago
$begingroup$
@DH. I would recommend actuarial course notes (if you can get your hands on them) great source for material on generating functions!
$endgroup$
– The Problem
8 hours ago
$begingroup$
@user What do you mean by $p_1$?
$endgroup$
– awkward
10 hours ago
$begingroup$
@user What do you mean by $p_1$?
$endgroup$
– awkward
10 hours ago
$begingroup$
@user Oh I see, you mean $p_i$ is the probability that rank $i$ is the first rank to get 5 cards. I haven't computed those other probabilities, but the probability I computed for aces is consistent with Monte Carlo results, so I'm pretty sure it's correct. If you see something wrong with the solution, please be specific.
$endgroup$
– awkward
9 hours ago
$begingroup$
@user Oh I see, you mean $p_i$ is the probability that rank $i$ is the first rank to get 5 cards. I haven't computed those other probabilities, but the probability I computed for aces is consistent with Monte Carlo results, so I'm pretty sure it's correct. If you see something wrong with the solution, please be specific.
$endgroup$
– awkward
9 hours ago
$begingroup$
@user OK, what are your numbers?
$endgroup$
– awkward
9 hours ago
$begingroup$
@user OK, what are your numbers?
$endgroup$
– awkward
9 hours ago
$begingroup$
@awkward my monte carlo simulation comes up with the same answer as you awkward. Do you have any material to read about generating functions as I have not come across them before?
$endgroup$
– DH.
8 hours ago
$begingroup$
@awkward my monte carlo simulation comes up with the same answer as you awkward. Do you have any material to read about generating functions as I have not come across them before?
$endgroup$
– DH.
8 hours ago
$begingroup$
@DH. I would recommend actuarial course notes (if you can get your hands on them) great source for material on generating functions!
$endgroup$
– The Problem
8 hours ago
$begingroup$
@DH. I would recommend actuarial course notes (if you can get your hands on them) great source for material on generating functions!
$endgroup$
– The Problem
8 hours ago
|
show 5 more comments
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%2f3140034%2fprobability-of-matching-5-cards-from-a-deck-of-40%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