Set of possible decks of cards The Next CEO of Stack OverflowCalculating a combination of...
Make solar eclipses exceedingly rare, but still have new moons
Does soap repel water?
Is there a way to save my career from absolute disaster?
What happened in Rome, when the western empire "fell"?
Is French Guiana a (hard) EU border?
Does Germany produce more waste than the US?
How to invert MapIndexed on a ragged structure? How to construct a tree from rules?
Legal workarounds for testamentary trust perceived as unfair
Rotate a column
How did people program for Consoles with multiple CPUs?
How to get from Geneva Airport to Metabief, Doubs, France by public transport?
Is wanting to ask what to write an indication that you need to change your story?
Why do airplanes bank sharply to the right after air-to-air refueling?
What steps are necessary to read a Modern SSD in Medieval Europe?
Why does standard notation not preserve intervals (visually)
TikZ: How to reverse arrow direction without switching start/end point?
When you upcast Blindness/Deafness, do all targets suffer the same effect?
Which one is the true statement?
Domestic-to-international connection at Orlando (MCO)
Poetry, calligrams and TikZ/PStricks challenge
Is the D&D universe the same as the Forgotten Realms universe?
How do I align (1) and (2)?
Where do students learn to solve polynomial equations these days?
How to prove a simple equation?
Set of possible decks of cards
The Next CEO of Stack OverflowCalculating a combination of probabilitiesOdds of each hand size in a game of Go FishProbability of sharing cards drawn from different decks?Which player is most likely to win when drawing cards?What is the probability that all four aces will be received by the same player?Probability that a five-card poker hand contains the ace of hearts?A standard deck of playing cards consists of 52 cards. Each card has a rank and a suit.Calculating probabilities for drawing specific cards from multiple decks?Probability of each player withdrawing 4 aces given 3 cards each on a 40 card deck?
$begingroup$
Let S be the set of all 52 cards. For our purposes here, we consider a "deck" as a permutation of these 52 cards, $(c_1, c_2,...,c_{52})$ where $c_1$ is the first card, $c_2$ the second card and so on. We let $Omega$ be the set of all possible decks.
a) Is $Omega$ a subset of $S^{52}$ and is $S^{52}$ a subset of $Omega%$
I think they are equal and therefore subsets of each other, but is $S^{52}$ standard notation?
b) A deck of cards is distributed to four players - A,B,C and D, each receiving $13$. The set of cards each player receives is called their hand. Let $mathcal{A}$ be the hand of player A. Is $mathcal{A}$ a subset of $S^{52}, S^{13} text{ or }Omega$?
I am again unsure of notation with the S's, but is it a subset of $Omega$ or would each subset of $Omega$ need to have 52 elements?
c) The cards are distributed in the cycle A-B-C-D-A-B-C-D.... Given a deck, $(c_1,...,c_{52})$ what is $mathcal{A}$?
Clearly, $(c_1,c_5,c_9,c_{13},...,c_{49})$
d) What is the subset of $Omega$ corresponding to player A has the ace of diamonds?
Would this just be $(c_1, c_2,...,c_{52})$ where the ace of diamonds is $c_i$ and $i equiv 1 text{ mod }4$
Any help or clarification of notation will be much appreciated. Thanks.
probability elementary-set-theory
$endgroup$
add a comment |
$begingroup$
Let S be the set of all 52 cards. For our purposes here, we consider a "deck" as a permutation of these 52 cards, $(c_1, c_2,...,c_{52})$ where $c_1$ is the first card, $c_2$ the second card and so on. We let $Omega$ be the set of all possible decks.
a) Is $Omega$ a subset of $S^{52}$ and is $S^{52}$ a subset of $Omega%$
I think they are equal and therefore subsets of each other, but is $S^{52}$ standard notation?
b) A deck of cards is distributed to four players - A,B,C and D, each receiving $13$. The set of cards each player receives is called their hand. Let $mathcal{A}$ be the hand of player A. Is $mathcal{A}$ a subset of $S^{52}, S^{13} text{ or }Omega$?
I am again unsure of notation with the S's, but is it a subset of $Omega$ or would each subset of $Omega$ need to have 52 elements?
c) The cards are distributed in the cycle A-B-C-D-A-B-C-D.... Given a deck, $(c_1,...,c_{52})$ what is $mathcal{A}$?
Clearly, $(c_1,c_5,c_9,c_{13},...,c_{49})$
d) What is the subset of $Omega$ corresponding to player A has the ace of diamonds?
Would this just be $(c_1, c_2,...,c_{52})$ where the ace of diamonds is $c_i$ and $i equiv 1 text{ mod }4$
Any help or clarification of notation will be much appreciated. Thanks.
probability elementary-set-theory
$endgroup$
add a comment |
$begingroup$
Let S be the set of all 52 cards. For our purposes here, we consider a "deck" as a permutation of these 52 cards, $(c_1, c_2,...,c_{52})$ where $c_1$ is the first card, $c_2$ the second card and so on. We let $Omega$ be the set of all possible decks.
a) Is $Omega$ a subset of $S^{52}$ and is $S^{52}$ a subset of $Omega%$
I think they are equal and therefore subsets of each other, but is $S^{52}$ standard notation?
b) A deck of cards is distributed to four players - A,B,C and D, each receiving $13$. The set of cards each player receives is called their hand. Let $mathcal{A}$ be the hand of player A. Is $mathcal{A}$ a subset of $S^{52}, S^{13} text{ or }Omega$?
I am again unsure of notation with the S's, but is it a subset of $Omega$ or would each subset of $Omega$ need to have 52 elements?
c) The cards are distributed in the cycle A-B-C-D-A-B-C-D.... Given a deck, $(c_1,...,c_{52})$ what is $mathcal{A}$?
Clearly, $(c_1,c_5,c_9,c_{13},...,c_{49})$
d) What is the subset of $Omega$ corresponding to player A has the ace of diamonds?
Would this just be $(c_1, c_2,...,c_{52})$ where the ace of diamonds is $c_i$ and $i equiv 1 text{ mod }4$
Any help or clarification of notation will be much appreciated. Thanks.
probability elementary-set-theory
$endgroup$
Let S be the set of all 52 cards. For our purposes here, we consider a "deck" as a permutation of these 52 cards, $(c_1, c_2,...,c_{52})$ where $c_1$ is the first card, $c_2$ the second card and so on. We let $Omega$ be the set of all possible decks.
a) Is $Omega$ a subset of $S^{52}$ and is $S^{52}$ a subset of $Omega%$
I think they are equal and therefore subsets of each other, but is $S^{52}$ standard notation?
b) A deck of cards is distributed to four players - A,B,C and D, each receiving $13$. The set of cards each player receives is called their hand. Let $mathcal{A}$ be the hand of player A. Is $mathcal{A}$ a subset of $S^{52}, S^{13} text{ or }Omega$?
I am again unsure of notation with the S's, but is it a subset of $Omega$ or would each subset of $Omega$ need to have 52 elements?
c) The cards are distributed in the cycle A-B-C-D-A-B-C-D.... Given a deck, $(c_1,...,c_{52})$ what is $mathcal{A}$?
Clearly, $(c_1,c_5,c_9,c_{13},...,c_{49})$
d) What is the subset of $Omega$ corresponding to player A has the ace of diamonds?
Would this just be $(c_1, c_2,...,c_{52})$ where the ace of diamonds is $c_i$ and $i equiv 1 text{ mod }4$
Any help or clarification of notation will be much appreciated. Thanks.
probability elementary-set-theory
probability elementary-set-theory
asked Mar 17 at 7:45
AndrewAndrew
357213
357213
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
a)
If $X$ and $Y$ are sets then $Y^X$ denotes the set of functions $Xto Y$. Secondly $52$ can be interpreted as the set ${0,1,2,3,dots,51}$ so that $S^{52}$ can be looked at as the set of functions ${0,1,2,3,dots,51}to S$.
It does harm to replace $52={0,1,2,3,dots,51}$ by $[52]={1,2,3,dots,51,52}$ but in that case I would prefer the notation $S^{[52]}$.
Every deck can be recognized as an element of $S^{[52]}$ but not vice versa. Actually the decks can be identified as the bijections. So if $Omega$ denotes the set of all possible decks then $Omega$ is a proper subset of $S^{[52]}$ defined by: $$Omega={omegain S^{[52]}mid omegatext{ is bijective}}subsetneq S^{[52]}$$
Let me remark here that you can still take $S^{[52]}$ as the "set of outcomes" but in that case you must be aware of the fact that there are outcomes with $P({omega})=0$.
Any element $omegainOmega$ can be denoted as $(omega(1),omega(2),dots, omega(52))$.
b) and c)
You can define:
- $A={4k-3mid kin{1,2,dots,13}}$
- $B={4k-2mid kin{1,2,dots,13}}$
- $C={4k-1mid kin{1,2,dots,13}}$
- $D={4kmid kin{1,2,dots,13}}$
These sets are disjoint, covering and equinumberable subsets of $[52]$.
Then every $omegainOmega$ induces "hands" $mathcal A(omega),mathcal B(omega),mathcal C(omega),mathcal D(omega)$.
Here e.g. $mathcal A(omega)=omegaupharpoonleft A$ and can be denoted as $(omega(1),omega(5),dots,omega(49))$.
So actually $mathcal A$ is the function $OmegatoOmega_A={omegaupharpoonleft Amid omegainOmega}$ prescribed by $omegamapstoomegaupharpoonleft A$.
d)
Let it be that $c_k$ is the ace of diamonds.
Then ${text{A receives ace of diamonds}}={omegainOmegamid c_kintext{image of }mathcal A(omega)}$.
$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%2f3151246%2fset-of-possible-decks-of-cards%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$
a)
If $X$ and $Y$ are sets then $Y^X$ denotes the set of functions $Xto Y$. Secondly $52$ can be interpreted as the set ${0,1,2,3,dots,51}$ so that $S^{52}$ can be looked at as the set of functions ${0,1,2,3,dots,51}to S$.
It does harm to replace $52={0,1,2,3,dots,51}$ by $[52]={1,2,3,dots,51,52}$ but in that case I would prefer the notation $S^{[52]}$.
Every deck can be recognized as an element of $S^{[52]}$ but not vice versa. Actually the decks can be identified as the bijections. So if $Omega$ denotes the set of all possible decks then $Omega$ is a proper subset of $S^{[52]}$ defined by: $$Omega={omegain S^{[52]}mid omegatext{ is bijective}}subsetneq S^{[52]}$$
Let me remark here that you can still take $S^{[52]}$ as the "set of outcomes" but in that case you must be aware of the fact that there are outcomes with $P({omega})=0$.
Any element $omegainOmega$ can be denoted as $(omega(1),omega(2),dots, omega(52))$.
b) and c)
You can define:
- $A={4k-3mid kin{1,2,dots,13}}$
- $B={4k-2mid kin{1,2,dots,13}}$
- $C={4k-1mid kin{1,2,dots,13}}$
- $D={4kmid kin{1,2,dots,13}}$
These sets are disjoint, covering and equinumberable subsets of $[52]$.
Then every $omegainOmega$ induces "hands" $mathcal A(omega),mathcal B(omega),mathcal C(omega),mathcal D(omega)$.
Here e.g. $mathcal A(omega)=omegaupharpoonleft A$ and can be denoted as $(omega(1),omega(5),dots,omega(49))$.
So actually $mathcal A$ is the function $OmegatoOmega_A={omegaupharpoonleft Amid omegainOmega}$ prescribed by $omegamapstoomegaupharpoonleft A$.
d)
Let it be that $c_k$ is the ace of diamonds.
Then ${text{A receives ace of diamonds}}={omegainOmegamid c_kintext{image of }mathcal A(omega)}$.
$endgroup$
add a comment |
$begingroup$
a)
If $X$ and $Y$ are sets then $Y^X$ denotes the set of functions $Xto Y$. Secondly $52$ can be interpreted as the set ${0,1,2,3,dots,51}$ so that $S^{52}$ can be looked at as the set of functions ${0,1,2,3,dots,51}to S$.
It does harm to replace $52={0,1,2,3,dots,51}$ by $[52]={1,2,3,dots,51,52}$ but in that case I would prefer the notation $S^{[52]}$.
Every deck can be recognized as an element of $S^{[52]}$ but not vice versa. Actually the decks can be identified as the bijections. So if $Omega$ denotes the set of all possible decks then $Omega$ is a proper subset of $S^{[52]}$ defined by: $$Omega={omegain S^{[52]}mid omegatext{ is bijective}}subsetneq S^{[52]}$$
Let me remark here that you can still take $S^{[52]}$ as the "set of outcomes" but in that case you must be aware of the fact that there are outcomes with $P({omega})=0$.
Any element $omegainOmega$ can be denoted as $(omega(1),omega(2),dots, omega(52))$.
b) and c)
You can define:
- $A={4k-3mid kin{1,2,dots,13}}$
- $B={4k-2mid kin{1,2,dots,13}}$
- $C={4k-1mid kin{1,2,dots,13}}$
- $D={4kmid kin{1,2,dots,13}}$
These sets are disjoint, covering and equinumberable subsets of $[52]$.
Then every $omegainOmega$ induces "hands" $mathcal A(omega),mathcal B(omega),mathcal C(omega),mathcal D(omega)$.
Here e.g. $mathcal A(omega)=omegaupharpoonleft A$ and can be denoted as $(omega(1),omega(5),dots,omega(49))$.
So actually $mathcal A$ is the function $OmegatoOmega_A={omegaupharpoonleft Amid omegainOmega}$ prescribed by $omegamapstoomegaupharpoonleft A$.
d)
Let it be that $c_k$ is the ace of diamonds.
Then ${text{A receives ace of diamonds}}={omegainOmegamid c_kintext{image of }mathcal A(omega)}$.
$endgroup$
add a comment |
$begingroup$
a)
If $X$ and $Y$ are sets then $Y^X$ denotes the set of functions $Xto Y$. Secondly $52$ can be interpreted as the set ${0,1,2,3,dots,51}$ so that $S^{52}$ can be looked at as the set of functions ${0,1,2,3,dots,51}to S$.
It does harm to replace $52={0,1,2,3,dots,51}$ by $[52]={1,2,3,dots,51,52}$ but in that case I would prefer the notation $S^{[52]}$.
Every deck can be recognized as an element of $S^{[52]}$ but not vice versa. Actually the decks can be identified as the bijections. So if $Omega$ denotes the set of all possible decks then $Omega$ is a proper subset of $S^{[52]}$ defined by: $$Omega={omegain S^{[52]}mid omegatext{ is bijective}}subsetneq S^{[52]}$$
Let me remark here that you can still take $S^{[52]}$ as the "set of outcomes" but in that case you must be aware of the fact that there are outcomes with $P({omega})=0$.
Any element $omegainOmega$ can be denoted as $(omega(1),omega(2),dots, omega(52))$.
b) and c)
You can define:
- $A={4k-3mid kin{1,2,dots,13}}$
- $B={4k-2mid kin{1,2,dots,13}}$
- $C={4k-1mid kin{1,2,dots,13}}$
- $D={4kmid kin{1,2,dots,13}}$
These sets are disjoint, covering and equinumberable subsets of $[52]$.
Then every $omegainOmega$ induces "hands" $mathcal A(omega),mathcal B(omega),mathcal C(omega),mathcal D(omega)$.
Here e.g. $mathcal A(omega)=omegaupharpoonleft A$ and can be denoted as $(omega(1),omega(5),dots,omega(49))$.
So actually $mathcal A$ is the function $OmegatoOmega_A={omegaupharpoonleft Amid omegainOmega}$ prescribed by $omegamapstoomegaupharpoonleft A$.
d)
Let it be that $c_k$ is the ace of diamonds.
Then ${text{A receives ace of diamonds}}={omegainOmegamid c_kintext{image of }mathcal A(omega)}$.
$endgroup$
a)
If $X$ and $Y$ are sets then $Y^X$ denotes the set of functions $Xto Y$. Secondly $52$ can be interpreted as the set ${0,1,2,3,dots,51}$ so that $S^{52}$ can be looked at as the set of functions ${0,1,2,3,dots,51}to S$.
It does harm to replace $52={0,1,2,3,dots,51}$ by $[52]={1,2,3,dots,51,52}$ but in that case I would prefer the notation $S^{[52]}$.
Every deck can be recognized as an element of $S^{[52]}$ but not vice versa. Actually the decks can be identified as the bijections. So if $Omega$ denotes the set of all possible decks then $Omega$ is a proper subset of $S^{[52]}$ defined by: $$Omega={omegain S^{[52]}mid omegatext{ is bijective}}subsetneq S^{[52]}$$
Let me remark here that you can still take $S^{[52]}$ as the "set of outcomes" but in that case you must be aware of the fact that there are outcomes with $P({omega})=0$.
Any element $omegainOmega$ can be denoted as $(omega(1),omega(2),dots, omega(52))$.
b) and c)
You can define:
- $A={4k-3mid kin{1,2,dots,13}}$
- $B={4k-2mid kin{1,2,dots,13}}$
- $C={4k-1mid kin{1,2,dots,13}}$
- $D={4kmid kin{1,2,dots,13}}$
These sets are disjoint, covering and equinumberable subsets of $[52]$.
Then every $omegainOmega$ induces "hands" $mathcal A(omega),mathcal B(omega),mathcal C(omega),mathcal D(omega)$.
Here e.g. $mathcal A(omega)=omegaupharpoonleft A$ and can be denoted as $(omega(1),omega(5),dots,omega(49))$.
So actually $mathcal A$ is the function $OmegatoOmega_A={omegaupharpoonleft Amid omegainOmega}$ prescribed by $omegamapstoomegaupharpoonleft A$.
d)
Let it be that $c_k$ is the ace of diamonds.
Then ${text{A receives ace of diamonds}}={omegainOmegamid c_kintext{image of }mathcal A(omega)}$.
edited Mar 17 at 11:50
answered Mar 17 at 8:43
drhabdrhab
104k545136
104k545136
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%2f3151246%2fset-of-possible-decks-of-cards%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