Curious habit, will I be late for work in n-days ? [Probability]
$begingroup$
Here is an interesting problem of probability :
Everyday, I can either go to work with a car or with the sub. If I
take the car, I will be late half of the time, whereas with the metro,
only a fourth (1/4 of the time). If today I'm late, tomorrow, I'll
change my way of commuting. So if one day I'm late using the car, the
next day I'll use the subway.
I start this habit tomorrow, and tomorrow I'll have a chance $p$ to
use the car.
1. What is the probability that I'm using the car the n-th day ?
2. What is the probability that I'm late on the n-th day ?
Here comes my answer. Can you please tell me if there are any mistakes ?
I ve set the event $C_n$ as taking the car on n-th day, $S_n$ for the sub.
$R$ is the event "being late".
The event $R^c$ is the contrary, beeing on time.
$$ P(C_n) = P( S_{n-1} cap R ) + P( C_{n-1} cap R^c )$$ by hypothesis.
$$ begin{split}
P(C_n) = & P( S_{n-1} ) P ( R vert S_{n-1} ) + P( C_{n-1} ) P ( R^c vert C_{n-1} ) \
=& frac 1 4 ( 1 - P( C_{n-1} ) ) + frac 1 2 P( C_{n-1} ) \
=& frac 1 4 ( P( C_{n-1} ) + 1 )
end{split} $$
that because I can either take the car of the subway, so the two event $S_n, C_n$ are creating a partition for each day
(Can you maybe clarify this statement ? I don't know how to precisely justify this point ; This is for this equality : $1 - P( C_{n-1} ) = P( S_{n-1} ) $).
Getting to this point, we recognise an arithmetico / geometrico sequence.
I think that we get this general expression :
$$ P(C_n) = (frac 1 4)^n ( p- frac 1 3 ) + frac 1 3 $$
So this would be the answer to the first point, and for the second point, we simply have to use the formula of total probability :
$$ P( R) = P( S_{n} ) frac 1 4 + P( C_{n} ) frac 1 2 = frac 1 4 ( 1 + P( C_n ))$$
probability puzzle conditional-probability
$endgroup$
add a comment |
$begingroup$
Here is an interesting problem of probability :
Everyday, I can either go to work with a car or with the sub. If I
take the car, I will be late half of the time, whereas with the metro,
only a fourth (1/4 of the time). If today I'm late, tomorrow, I'll
change my way of commuting. So if one day I'm late using the car, the
next day I'll use the subway.
I start this habit tomorrow, and tomorrow I'll have a chance $p$ to
use the car.
1. What is the probability that I'm using the car the n-th day ?
2. What is the probability that I'm late on the n-th day ?
Here comes my answer. Can you please tell me if there are any mistakes ?
I ve set the event $C_n$ as taking the car on n-th day, $S_n$ for the sub.
$R$ is the event "being late".
The event $R^c$ is the contrary, beeing on time.
$$ P(C_n) = P( S_{n-1} cap R ) + P( C_{n-1} cap R^c )$$ by hypothesis.
$$ begin{split}
P(C_n) = & P( S_{n-1} ) P ( R vert S_{n-1} ) + P( C_{n-1} ) P ( R^c vert C_{n-1} ) \
=& frac 1 4 ( 1 - P( C_{n-1} ) ) + frac 1 2 P( C_{n-1} ) \
=& frac 1 4 ( P( C_{n-1} ) + 1 )
end{split} $$
that because I can either take the car of the subway, so the two event $S_n, C_n$ are creating a partition for each day
(Can you maybe clarify this statement ? I don't know how to precisely justify this point ; This is for this equality : $1 - P( C_{n-1} ) = P( S_{n-1} ) $).
Getting to this point, we recognise an arithmetico / geometrico sequence.
I think that we get this general expression :
$$ P(C_n) = (frac 1 4)^n ( p- frac 1 3 ) + frac 1 3 $$
So this would be the answer to the first point, and for the second point, we simply have to use the formula of total probability :
$$ P( R) = P( S_{n} ) frac 1 4 + P( C_{n} ) frac 1 2 = frac 1 4 ( 1 + P( C_n ))$$
probability puzzle conditional-probability
$endgroup$
add a comment |
$begingroup$
Here is an interesting problem of probability :
Everyday, I can either go to work with a car or with the sub. If I
take the car, I will be late half of the time, whereas with the metro,
only a fourth (1/4 of the time). If today I'm late, tomorrow, I'll
change my way of commuting. So if one day I'm late using the car, the
next day I'll use the subway.
I start this habit tomorrow, and tomorrow I'll have a chance $p$ to
use the car.
1. What is the probability that I'm using the car the n-th day ?
2. What is the probability that I'm late on the n-th day ?
Here comes my answer. Can you please tell me if there are any mistakes ?
I ve set the event $C_n$ as taking the car on n-th day, $S_n$ for the sub.
$R$ is the event "being late".
The event $R^c$ is the contrary, beeing on time.
$$ P(C_n) = P( S_{n-1} cap R ) + P( C_{n-1} cap R^c )$$ by hypothesis.
$$ begin{split}
P(C_n) = & P( S_{n-1} ) P ( R vert S_{n-1} ) + P( C_{n-1} ) P ( R^c vert C_{n-1} ) \
=& frac 1 4 ( 1 - P( C_{n-1} ) ) + frac 1 2 P( C_{n-1} ) \
=& frac 1 4 ( P( C_{n-1} ) + 1 )
end{split} $$
that because I can either take the car of the subway, so the two event $S_n, C_n$ are creating a partition for each day
(Can you maybe clarify this statement ? I don't know how to precisely justify this point ; This is for this equality : $1 - P( C_{n-1} ) = P( S_{n-1} ) $).
Getting to this point, we recognise an arithmetico / geometrico sequence.
I think that we get this general expression :
$$ P(C_n) = (frac 1 4)^n ( p- frac 1 3 ) + frac 1 3 $$
So this would be the answer to the first point, and for the second point, we simply have to use the formula of total probability :
$$ P( R) = P( S_{n} ) frac 1 4 + P( C_{n} ) frac 1 2 = frac 1 4 ( 1 + P( C_n ))$$
probability puzzle conditional-probability
$endgroup$
Here is an interesting problem of probability :
Everyday, I can either go to work with a car or with the sub. If I
take the car, I will be late half of the time, whereas with the metro,
only a fourth (1/4 of the time). If today I'm late, tomorrow, I'll
change my way of commuting. So if one day I'm late using the car, the
next day I'll use the subway.
I start this habit tomorrow, and tomorrow I'll have a chance $p$ to
use the car.
1. What is the probability that I'm using the car the n-th day ?
2. What is the probability that I'm late on the n-th day ?
Here comes my answer. Can you please tell me if there are any mistakes ?
I ve set the event $C_n$ as taking the car on n-th day, $S_n$ for the sub.
$R$ is the event "being late".
The event $R^c$ is the contrary, beeing on time.
$$ P(C_n) = P( S_{n-1} cap R ) + P( C_{n-1} cap R^c )$$ by hypothesis.
$$ begin{split}
P(C_n) = & P( S_{n-1} ) P ( R vert S_{n-1} ) + P( C_{n-1} ) P ( R^c vert C_{n-1} ) \
=& frac 1 4 ( 1 - P( C_{n-1} ) ) + frac 1 2 P( C_{n-1} ) \
=& frac 1 4 ( P( C_{n-1} ) + 1 )
end{split} $$
that because I can either take the car of the subway, so the two event $S_n, C_n$ are creating a partition for each day
(Can you maybe clarify this statement ? I don't know how to precisely justify this point ; This is for this equality : $1 - P( C_{n-1} ) = P( S_{n-1} ) $).
Getting to this point, we recognise an arithmetico / geometrico sequence.
I think that we get this general expression :
$$ P(C_n) = (frac 1 4)^n ( p- frac 1 3 ) + frac 1 3 $$
So this would be the answer to the first point, and for the second point, we simply have to use the formula of total probability :
$$ P( R) = P( S_{n} ) frac 1 4 + P( C_{n} ) frac 1 2 = frac 1 4 ( 1 + P( C_n ))$$
probability puzzle conditional-probability
probability puzzle conditional-probability
edited Jan 28 at 0:42
Marine Galantin
asked Jan 27 at 19:08
Marine GalantinMarine Galantin
940419
940419
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Your argument is sound. The equality you are worried about is find because you have to take either the car or the subway, so both sides are the probability you take the car. I didn't check your solution to the recurrence, but it looks good. It should converge to $frac 13$ and it does.
$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%2f3089988%2fcurious-habit-will-i-be-late-for-work-in-n-days-probability%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$
Your argument is sound. The equality you are worried about is find because you have to take either the car or the subway, so both sides are the probability you take the car. I didn't check your solution to the recurrence, but it looks good. It should converge to $frac 13$ and it does.
$endgroup$
add a comment |
$begingroup$
Your argument is sound. The equality you are worried about is find because you have to take either the car or the subway, so both sides are the probability you take the car. I didn't check your solution to the recurrence, but it looks good. It should converge to $frac 13$ and it does.
$endgroup$
add a comment |
$begingroup$
Your argument is sound. The equality you are worried about is find because you have to take either the car or the subway, so both sides are the probability you take the car. I didn't check your solution to the recurrence, but it looks good. It should converge to $frac 13$ and it does.
$endgroup$
Your argument is sound. The equality you are worried about is find because you have to take either the car or the subway, so both sides are the probability you take the car. I didn't check your solution to the recurrence, but it looks good. It should converge to $frac 13$ and it does.
answered Jan 30 at 18:33


Ross MillikanRoss Millikan
300k24200375
300k24200375
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%2f3089988%2fcurious-habit-will-i-be-late-for-work-in-n-days-probability%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