Probability of covering all vertices of a square
$begingroup$
Let A1 = (0,0), A2 = (1,0), A3 = (1,1) and A4 = (0,1) be the four vertices of a square. A particle starts from the point A1 at time 0 and moves either to A2 or to A4 withequalprobability. Similarly, in eachof the subsequent steps, it randomly chooses one of its adjacent vertices and moves there. Let T be the minimum number of steps required to cover all four vertices. The probability P(T = 4) is (A) 0 (B) 1/16 (C) 1/8 (D) 1/4.
I am getting it as 3/4 but answer is 1/8 please help!
probability
$endgroup$
add a comment |
$begingroup$
Let A1 = (0,0), A2 = (1,0), A3 = (1,1) and A4 = (0,1) be the four vertices of a square. A particle starts from the point A1 at time 0 and moves either to A2 or to A4 withequalprobability. Similarly, in eachof the subsequent steps, it randomly chooses one of its adjacent vertices and moves there. Let T be the minimum number of steps required to cover all four vertices. The probability P(T = 4) is (A) 0 (B) 1/16 (C) 1/8 (D) 1/4.
I am getting it as 3/4 but answer is 1/8 please help!
probability
$endgroup$
1
$begingroup$
Hint: What is the probability of the cycle $1234$?
$endgroup$
– Sean Roberson
Jan 1 at 6:30
1
$begingroup$
@SeanRoberson don't forget $1432$
$endgroup$
– Mohammad Zuhair Khan
Jan 1 at 6:37
$begingroup$
Could the particle go from (0,0) to (0,1) then go back to (0,0)? When at A3 could it go back to A1? A similar problem is here:nrich.maths.org/2370
$endgroup$
– NoChance
Jan 1 at 7:16
add a comment |
$begingroup$
Let A1 = (0,0), A2 = (1,0), A3 = (1,1) and A4 = (0,1) be the four vertices of a square. A particle starts from the point A1 at time 0 and moves either to A2 or to A4 withequalprobability. Similarly, in eachof the subsequent steps, it randomly chooses one of its adjacent vertices and moves there. Let T be the minimum number of steps required to cover all four vertices. The probability P(T = 4) is (A) 0 (B) 1/16 (C) 1/8 (D) 1/4.
I am getting it as 3/4 but answer is 1/8 please help!
probability
$endgroup$
Let A1 = (0,0), A2 = (1,0), A3 = (1,1) and A4 = (0,1) be the four vertices of a square. A particle starts from the point A1 at time 0 and moves either to A2 or to A4 withequalprobability. Similarly, in eachof the subsequent steps, it randomly chooses one of its adjacent vertices and moves there. Let T be the minimum number of steps required to cover all four vertices. The probability P(T = 4) is (A) 0 (B) 1/16 (C) 1/8 (D) 1/4.
I am getting it as 3/4 but answer is 1/8 please help!
probability
probability
asked Jan 1 at 6:27
debduttdebdutt
525
525
1
$begingroup$
Hint: What is the probability of the cycle $1234$?
$endgroup$
– Sean Roberson
Jan 1 at 6:30
1
$begingroup$
@SeanRoberson don't forget $1432$
$endgroup$
– Mohammad Zuhair Khan
Jan 1 at 6:37
$begingroup$
Could the particle go from (0,0) to (0,1) then go back to (0,0)? When at A3 could it go back to A1? A similar problem is here:nrich.maths.org/2370
$endgroup$
– NoChance
Jan 1 at 7:16
add a comment |
1
$begingroup$
Hint: What is the probability of the cycle $1234$?
$endgroup$
– Sean Roberson
Jan 1 at 6:30
1
$begingroup$
@SeanRoberson don't forget $1432$
$endgroup$
– Mohammad Zuhair Khan
Jan 1 at 6:37
$begingroup$
Could the particle go from (0,0) to (0,1) then go back to (0,0)? When at A3 could it go back to A1? A similar problem is here:nrich.maths.org/2370
$endgroup$
– NoChance
Jan 1 at 7:16
1
1
$begingroup$
Hint: What is the probability of the cycle $1234$?
$endgroup$
– Sean Roberson
Jan 1 at 6:30
$begingroup$
Hint: What is the probability of the cycle $1234$?
$endgroup$
– Sean Roberson
Jan 1 at 6:30
1
1
$begingroup$
@SeanRoberson don't forget $1432$
$endgroup$
– Mohammad Zuhair Khan
Jan 1 at 6:37
$begingroup$
@SeanRoberson don't forget $1432$
$endgroup$
– Mohammad Zuhair Khan
Jan 1 at 6:37
$begingroup$
Could the particle go from (0,0) to (0,1) then go back to (0,0)? When at A3 could it go back to A1? A similar problem is here:nrich.maths.org/2370
$endgroup$
– NoChance
Jan 1 at 7:16
$begingroup$
Could the particle go from (0,0) to (0,1) then go back to (0,0)? When at A3 could it go back to A1? A similar problem is here:nrich.maths.org/2370
$endgroup$
– NoChance
Jan 1 at 7:16
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
To have $4$ steps, it means it visited exactly one node twice and we can check that the repeated node must be $1$.
It could have been $12143$ or $14123$.
Hence $frac{2}{2^4}=frac18$
$endgroup$
$begingroup$
How are you labelling the nodes?
$endgroup$
– coffeemath
Jan 1 at 9:26
1
$begingroup$
oops, I see. i made a mistake. thanks.
$endgroup$
– Siong Thye Goh
Jan 1 at 9:30
add a comment |
$begingroup$
The only two favorable outcomes are: $12143$ and $14123$. Each has the probability of $1/16$, hence their sum is $1/8$.
$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%2f3058246%2fprobability-of-covering-all-vertices-of-a-square%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
To have $4$ steps, it means it visited exactly one node twice and we can check that the repeated node must be $1$.
It could have been $12143$ or $14123$.
Hence $frac{2}{2^4}=frac18$
$endgroup$
$begingroup$
How are you labelling the nodes?
$endgroup$
– coffeemath
Jan 1 at 9:26
1
$begingroup$
oops, I see. i made a mistake. thanks.
$endgroup$
– Siong Thye Goh
Jan 1 at 9:30
add a comment |
$begingroup$
To have $4$ steps, it means it visited exactly one node twice and we can check that the repeated node must be $1$.
It could have been $12143$ or $14123$.
Hence $frac{2}{2^4}=frac18$
$endgroup$
$begingroup$
How are you labelling the nodes?
$endgroup$
– coffeemath
Jan 1 at 9:26
1
$begingroup$
oops, I see. i made a mistake. thanks.
$endgroup$
– Siong Thye Goh
Jan 1 at 9:30
add a comment |
$begingroup$
To have $4$ steps, it means it visited exactly one node twice and we can check that the repeated node must be $1$.
It could have been $12143$ or $14123$.
Hence $frac{2}{2^4}=frac18$
$endgroup$
To have $4$ steps, it means it visited exactly one node twice and we can check that the repeated node must be $1$.
It could have been $12143$ or $14123$.
Hence $frac{2}{2^4}=frac18$
edited Jan 1 at 9:31
answered Jan 1 at 6:47
Siong Thye GohSiong Thye Goh
103k1468119
103k1468119
$begingroup$
How are you labelling the nodes?
$endgroup$
– coffeemath
Jan 1 at 9:26
1
$begingroup$
oops, I see. i made a mistake. thanks.
$endgroup$
– Siong Thye Goh
Jan 1 at 9:30
add a comment |
$begingroup$
How are you labelling the nodes?
$endgroup$
– coffeemath
Jan 1 at 9:26
1
$begingroup$
oops, I see. i made a mistake. thanks.
$endgroup$
– Siong Thye Goh
Jan 1 at 9:30
$begingroup$
How are you labelling the nodes?
$endgroup$
– coffeemath
Jan 1 at 9:26
$begingroup$
How are you labelling the nodes?
$endgroup$
– coffeemath
Jan 1 at 9:26
1
1
$begingroup$
oops, I see. i made a mistake. thanks.
$endgroup$
– Siong Thye Goh
Jan 1 at 9:30
$begingroup$
oops, I see. i made a mistake. thanks.
$endgroup$
– Siong Thye Goh
Jan 1 at 9:30
add a comment |
$begingroup$
The only two favorable outcomes are: $12143$ and $14123$. Each has the probability of $1/16$, hence their sum is $1/8$.
$endgroup$
add a comment |
$begingroup$
The only two favorable outcomes are: $12143$ and $14123$. Each has the probability of $1/16$, hence their sum is $1/8$.
$endgroup$
add a comment |
$begingroup$
The only two favorable outcomes are: $12143$ and $14123$. Each has the probability of $1/16$, hence their sum is $1/8$.
$endgroup$
The only two favorable outcomes are: $12143$ and $14123$. Each has the probability of $1/16$, hence their sum is $1/8$.
answered Jan 1 at 6:50
farruhotafarruhota
21.6k2842
21.6k2842
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%2f3058246%2fprobability-of-covering-all-vertices-of-a-square%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
1
$begingroup$
Hint: What is the probability of the cycle $1234$?
$endgroup$
– Sean Roberson
Jan 1 at 6:30
1
$begingroup$
@SeanRoberson don't forget $1432$
$endgroup$
– Mohammad Zuhair Khan
Jan 1 at 6:37
$begingroup$
Could the particle go from (0,0) to (0,1) then go back to (0,0)? When at A3 could it go back to A1? A similar problem is here:nrich.maths.org/2370
$endgroup$
– NoChance
Jan 1 at 7:16