Seating Arrangement and Independent Events?
PROBLEM: Alice, Bob, Catherine, Doug, and Edna are randomly assigned seats at a circular table in a perfectly circular room. Assume that rotations of the table do not matter, so there are exactly 24 possible outcomes in the sample space.
Bob and Catherine are married. Doug and Edna are married. When people are married they love to sit beside each other.
Let T denote the event that Bob and Catherine are sitting next to each other. Let U be the event that Alice and Bob are sitting next to each other. Are events T and U independent? Why? Justify your answer.
My QUESTIONS:
1. Problem statement says couples love to sit beside each other. Why did author include this statement? Does he mean by "love to sit beside each other" that "they are always sitting beside each other" or he is just trying to confuse you ?
2. How to start solving the problem. I mean I can't even think of with what I should starts ;(
If by "love to" author meant they are "always sitting together" then nothing matters and $P(T) = 1$ and Alice has choice to sit next to rest 4 people: $P(U) = frac14$
Since they always sit together and Alice got its own wish to sit anywhere, no one is forcing her, they are independent events. This is the reasoning I could come up with.
probability combinatorics independence
add a comment |
PROBLEM: Alice, Bob, Catherine, Doug, and Edna are randomly assigned seats at a circular table in a perfectly circular room. Assume that rotations of the table do not matter, so there are exactly 24 possible outcomes in the sample space.
Bob and Catherine are married. Doug and Edna are married. When people are married they love to sit beside each other.
Let T denote the event that Bob and Catherine are sitting next to each other. Let U be the event that Alice and Bob are sitting next to each other. Are events T and U independent? Why? Justify your answer.
My QUESTIONS:
1. Problem statement says couples love to sit beside each other. Why did author include this statement? Does he mean by "love to sit beside each other" that "they are always sitting beside each other" or he is just trying to confuse you ?
2. How to start solving the problem. I mean I can't even think of with what I should starts ;(
If by "love to" author meant they are "always sitting together" then nothing matters and $P(T) = 1$ and Alice has choice to sit next to rest 4 people: $P(U) = frac14$
Since they always sit together and Alice got its own wish to sit anywhere, no one is forcing her, they are independent events. This is the reasoning I could come up with.
probability combinatorics independence
add a comment |
PROBLEM: Alice, Bob, Catherine, Doug, and Edna are randomly assigned seats at a circular table in a perfectly circular room. Assume that rotations of the table do not matter, so there are exactly 24 possible outcomes in the sample space.
Bob and Catherine are married. Doug and Edna are married. When people are married they love to sit beside each other.
Let T denote the event that Bob and Catherine are sitting next to each other. Let U be the event that Alice and Bob are sitting next to each other. Are events T and U independent? Why? Justify your answer.
My QUESTIONS:
1. Problem statement says couples love to sit beside each other. Why did author include this statement? Does he mean by "love to sit beside each other" that "they are always sitting beside each other" or he is just trying to confuse you ?
2. How to start solving the problem. I mean I can't even think of with what I should starts ;(
If by "love to" author meant they are "always sitting together" then nothing matters and $P(T) = 1$ and Alice has choice to sit next to rest 4 people: $P(U) = frac14$
Since they always sit together and Alice got its own wish to sit anywhere, no one is forcing her, they are independent events. This is the reasoning I could come up with.
probability combinatorics independence
PROBLEM: Alice, Bob, Catherine, Doug, and Edna are randomly assigned seats at a circular table in a perfectly circular room. Assume that rotations of the table do not matter, so there are exactly 24 possible outcomes in the sample space.
Bob and Catherine are married. Doug and Edna are married. When people are married they love to sit beside each other.
Let T denote the event that Bob and Catherine are sitting next to each other. Let U be the event that Alice and Bob are sitting next to each other. Are events T and U independent? Why? Justify your answer.
My QUESTIONS:
1. Problem statement says couples love to sit beside each other. Why did author include this statement? Does he mean by "love to sit beside each other" that "they are always sitting beside each other" or he is just trying to confuse you ?
2. How to start solving the problem. I mean I can't even think of with what I should starts ;(
If by "love to" author meant they are "always sitting together" then nothing matters and $P(T) = 1$ and Alice has choice to sit next to rest 4 people: $P(U) = frac14$
Since they always sit together and Alice got its own wish to sit anywhere, no one is forcing her, they are independent events. This is the reasoning I could come up with.
probability combinatorics independence
probability combinatorics independence
edited Nov 27 at 7:16
asked Nov 27 at 7:08
Arnuld
11411
11411
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$1)$ The author means nothing relevant when he says that. It's just an an inane piece of information meant to provide some idea of a context for the actual problem statement. It has nothing to do with solving the problem, i.e. even if the author had not put this line, the solution to the problem would not have changed one iota.
$2)$ I am going to give a mathematical proof here. There might be a logical way to do this too. To find whether the events are independent or not, we are going to use the fact that if two events are independent, then
$$P(Acap B) = P(A)P(B)$$
Now to calculate $P(T)$ and $P(U)$.
Starting with $T$, we see that Bob and Catherine are sitting together. So we combine them in one unit and calculate number of ways of seating them around the table (BC),E,D,A (Here letters represent the initials of the names of people). Since there are 4 entities, there are $3!$ ways to do it. Also, we can shift Bob and Catherine around (as in (BC) and (CB)) in two ways giving us
$$|T| = 3!cdot2!$$
$$P(T) = frac{3!cdot2!}{4!}=frac12$$
Applying a similar logic for $U$, we see that Bob and Alice are sitting together. So we combine them in one unit and calculate number of ways of seating them around the table (BA),E,D,C (Here letters represent the initials of the names of people). Since there are 4 entities, there are $3!$ ways to do it. Also, we can shift Bob and Alice around (as in (BA) and (AB)) in two ways giving us
$$|U| = 3!cdot2!$$
$$P(U) = frac{3!cdot2!}{4!}=frac12$$
Now we calculate $P(Tcap U)$. For this we put $T$ and $U$ together, i.e. both Alice and Catherine are sitting together with Bob. So we combine the three of them in one unit and try to seat 3 entities around a table (CBA),D,E. This can be done in $2!$ ways. Also Catherine and Alice can switch places inside the entity giving us a multiplicative factor of $2$. Now the total number of ways is
$$|Tcap U| = 2!cdot 2!$$
$$P(Tcap U) = frac{2!cdot 2!}{4!} = frac16$$
We can see that $P(Tcap U) ne P(T)P(U)$, meaning they are not independent.
I am attaching a few links regarding independent events in probability and circular permutations for your understanding
https://brilliant.org/wiki/probability-independent-events/
https://www.toppr.com/guides/business-mathematics-and-statistics/permutations-and-combinations/permutations-and-circular-permutation/
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%2f3015443%2fseating-arrangement-and-independent-events%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
$1)$ The author means nothing relevant when he says that. It's just an an inane piece of information meant to provide some idea of a context for the actual problem statement. It has nothing to do with solving the problem, i.e. even if the author had not put this line, the solution to the problem would not have changed one iota.
$2)$ I am going to give a mathematical proof here. There might be a logical way to do this too. To find whether the events are independent or not, we are going to use the fact that if two events are independent, then
$$P(Acap B) = P(A)P(B)$$
Now to calculate $P(T)$ and $P(U)$.
Starting with $T$, we see that Bob and Catherine are sitting together. So we combine them in one unit and calculate number of ways of seating them around the table (BC),E,D,A (Here letters represent the initials of the names of people). Since there are 4 entities, there are $3!$ ways to do it. Also, we can shift Bob and Catherine around (as in (BC) and (CB)) in two ways giving us
$$|T| = 3!cdot2!$$
$$P(T) = frac{3!cdot2!}{4!}=frac12$$
Applying a similar logic for $U$, we see that Bob and Alice are sitting together. So we combine them in one unit and calculate number of ways of seating them around the table (BA),E,D,C (Here letters represent the initials of the names of people). Since there are 4 entities, there are $3!$ ways to do it. Also, we can shift Bob and Alice around (as in (BA) and (AB)) in two ways giving us
$$|U| = 3!cdot2!$$
$$P(U) = frac{3!cdot2!}{4!}=frac12$$
Now we calculate $P(Tcap U)$. For this we put $T$ and $U$ together, i.e. both Alice and Catherine are sitting together with Bob. So we combine the three of them in one unit and try to seat 3 entities around a table (CBA),D,E. This can be done in $2!$ ways. Also Catherine and Alice can switch places inside the entity giving us a multiplicative factor of $2$. Now the total number of ways is
$$|Tcap U| = 2!cdot 2!$$
$$P(Tcap U) = frac{2!cdot 2!}{4!} = frac16$$
We can see that $P(Tcap U) ne P(T)P(U)$, meaning they are not independent.
I am attaching a few links regarding independent events in probability and circular permutations for your understanding
https://brilliant.org/wiki/probability-independent-events/
https://www.toppr.com/guides/business-mathematics-and-statistics/permutations-and-combinations/permutations-and-circular-permutation/
add a comment |
$1)$ The author means nothing relevant when he says that. It's just an an inane piece of information meant to provide some idea of a context for the actual problem statement. It has nothing to do with solving the problem, i.e. even if the author had not put this line, the solution to the problem would not have changed one iota.
$2)$ I am going to give a mathematical proof here. There might be a logical way to do this too. To find whether the events are independent or not, we are going to use the fact that if two events are independent, then
$$P(Acap B) = P(A)P(B)$$
Now to calculate $P(T)$ and $P(U)$.
Starting with $T$, we see that Bob and Catherine are sitting together. So we combine them in one unit and calculate number of ways of seating them around the table (BC),E,D,A (Here letters represent the initials of the names of people). Since there are 4 entities, there are $3!$ ways to do it. Also, we can shift Bob and Catherine around (as in (BC) and (CB)) in two ways giving us
$$|T| = 3!cdot2!$$
$$P(T) = frac{3!cdot2!}{4!}=frac12$$
Applying a similar logic for $U$, we see that Bob and Alice are sitting together. So we combine them in one unit and calculate number of ways of seating them around the table (BA),E,D,C (Here letters represent the initials of the names of people). Since there are 4 entities, there are $3!$ ways to do it. Also, we can shift Bob and Alice around (as in (BA) and (AB)) in two ways giving us
$$|U| = 3!cdot2!$$
$$P(U) = frac{3!cdot2!}{4!}=frac12$$
Now we calculate $P(Tcap U)$. For this we put $T$ and $U$ together, i.e. both Alice and Catherine are sitting together with Bob. So we combine the three of them in one unit and try to seat 3 entities around a table (CBA),D,E. This can be done in $2!$ ways. Also Catherine and Alice can switch places inside the entity giving us a multiplicative factor of $2$. Now the total number of ways is
$$|Tcap U| = 2!cdot 2!$$
$$P(Tcap U) = frac{2!cdot 2!}{4!} = frac16$$
We can see that $P(Tcap U) ne P(T)P(U)$, meaning they are not independent.
I am attaching a few links regarding independent events in probability and circular permutations for your understanding
https://brilliant.org/wiki/probability-independent-events/
https://www.toppr.com/guides/business-mathematics-and-statistics/permutations-and-combinations/permutations-and-circular-permutation/
add a comment |
$1)$ The author means nothing relevant when he says that. It's just an an inane piece of information meant to provide some idea of a context for the actual problem statement. It has nothing to do with solving the problem, i.e. even if the author had not put this line, the solution to the problem would not have changed one iota.
$2)$ I am going to give a mathematical proof here. There might be a logical way to do this too. To find whether the events are independent or not, we are going to use the fact that if two events are independent, then
$$P(Acap B) = P(A)P(B)$$
Now to calculate $P(T)$ and $P(U)$.
Starting with $T$, we see that Bob and Catherine are sitting together. So we combine them in one unit and calculate number of ways of seating them around the table (BC),E,D,A (Here letters represent the initials of the names of people). Since there are 4 entities, there are $3!$ ways to do it. Also, we can shift Bob and Catherine around (as in (BC) and (CB)) in two ways giving us
$$|T| = 3!cdot2!$$
$$P(T) = frac{3!cdot2!}{4!}=frac12$$
Applying a similar logic for $U$, we see that Bob and Alice are sitting together. So we combine them in one unit and calculate number of ways of seating them around the table (BA),E,D,C (Here letters represent the initials of the names of people). Since there are 4 entities, there are $3!$ ways to do it. Also, we can shift Bob and Alice around (as in (BA) and (AB)) in two ways giving us
$$|U| = 3!cdot2!$$
$$P(U) = frac{3!cdot2!}{4!}=frac12$$
Now we calculate $P(Tcap U)$. For this we put $T$ and $U$ together, i.e. both Alice and Catherine are sitting together with Bob. So we combine the three of them in one unit and try to seat 3 entities around a table (CBA),D,E. This can be done in $2!$ ways. Also Catherine and Alice can switch places inside the entity giving us a multiplicative factor of $2$. Now the total number of ways is
$$|Tcap U| = 2!cdot 2!$$
$$P(Tcap U) = frac{2!cdot 2!}{4!} = frac16$$
We can see that $P(Tcap U) ne P(T)P(U)$, meaning they are not independent.
I am attaching a few links regarding independent events in probability and circular permutations for your understanding
https://brilliant.org/wiki/probability-independent-events/
https://www.toppr.com/guides/business-mathematics-and-statistics/permutations-and-combinations/permutations-and-circular-permutation/
$1)$ The author means nothing relevant when he says that. It's just an an inane piece of information meant to provide some idea of a context for the actual problem statement. It has nothing to do with solving the problem, i.e. even if the author had not put this line, the solution to the problem would not have changed one iota.
$2)$ I am going to give a mathematical proof here. There might be a logical way to do this too. To find whether the events are independent or not, we are going to use the fact that if two events are independent, then
$$P(Acap B) = P(A)P(B)$$
Now to calculate $P(T)$ and $P(U)$.
Starting with $T$, we see that Bob and Catherine are sitting together. So we combine them in one unit and calculate number of ways of seating them around the table (BC),E,D,A (Here letters represent the initials of the names of people). Since there are 4 entities, there are $3!$ ways to do it. Also, we can shift Bob and Catherine around (as in (BC) and (CB)) in two ways giving us
$$|T| = 3!cdot2!$$
$$P(T) = frac{3!cdot2!}{4!}=frac12$$
Applying a similar logic for $U$, we see that Bob and Alice are sitting together. So we combine them in one unit and calculate number of ways of seating them around the table (BA),E,D,C (Here letters represent the initials of the names of people). Since there are 4 entities, there are $3!$ ways to do it. Also, we can shift Bob and Alice around (as in (BA) and (AB)) in two ways giving us
$$|U| = 3!cdot2!$$
$$P(U) = frac{3!cdot2!}{4!}=frac12$$
Now we calculate $P(Tcap U)$. For this we put $T$ and $U$ together, i.e. both Alice and Catherine are sitting together with Bob. So we combine the three of them in one unit and try to seat 3 entities around a table (CBA),D,E. This can be done in $2!$ ways. Also Catherine and Alice can switch places inside the entity giving us a multiplicative factor of $2$. Now the total number of ways is
$$|Tcap U| = 2!cdot 2!$$
$$P(Tcap U) = frac{2!cdot 2!}{4!} = frac16$$
We can see that $P(Tcap U) ne P(T)P(U)$, meaning they are not independent.
I am attaching a few links regarding independent events in probability and circular permutations for your understanding
https://brilliant.org/wiki/probability-independent-events/
https://www.toppr.com/guides/business-mathematics-and-statistics/permutations-and-combinations/permutations-and-circular-permutation/
answered Nov 27 at 8:11
Sauhard Sharma
63213
63213
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3015443%2fseating-arrangement-and-independent-events%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