Probability Of Machine Working
$begingroup$
A complex machine is able to work if at least 3 of it’s 5 components work. If each motor independently functions for a random amount of time with density given by $f(x) = frac{x}{e^x} , x>0$, compute the density function of the length of time that the machine functions.
My approach :
Let $p$ be the probability that component $i$ works for an amount of time $t$, I can find this by integrating the pdf over $0$ to $t$.
Now probability that $P(text{at least 3 work}) = 1-P(4)^c - P(5)^c$ this I can find by assuming the above as a binomial variable.
Will this be the pdf, which is to say, is the pdf equal to $P(text{at least 3 work})$?
probability probability-distributions random-variables binomial-distribution
$endgroup$
add a comment |
$begingroup$
A complex machine is able to work if at least 3 of it’s 5 components work. If each motor independently functions for a random amount of time with density given by $f(x) = frac{x}{e^x} , x>0$, compute the density function of the length of time that the machine functions.
My approach :
Let $p$ be the probability that component $i$ works for an amount of time $t$, I can find this by integrating the pdf over $0$ to $t$.
Now probability that $P(text{at least 3 work}) = 1-P(4)^c - P(5)^c$ this I can find by assuming the above as a binomial variable.
Will this be the pdf, which is to say, is the pdf equal to $P(text{at least 3 work})$?
probability probability-distributions random-variables binomial-distribution
$endgroup$
add a comment |
$begingroup$
A complex machine is able to work if at least 3 of it’s 5 components work. If each motor independently functions for a random amount of time with density given by $f(x) = frac{x}{e^x} , x>0$, compute the density function of the length of time that the machine functions.
My approach :
Let $p$ be the probability that component $i$ works for an amount of time $t$, I can find this by integrating the pdf over $0$ to $t$.
Now probability that $P(text{at least 3 work}) = 1-P(4)^c - P(5)^c$ this I can find by assuming the above as a binomial variable.
Will this be the pdf, which is to say, is the pdf equal to $P(text{at least 3 work})$?
probability probability-distributions random-variables binomial-distribution
$endgroup$
A complex machine is able to work if at least 3 of it’s 5 components work. If each motor independently functions for a random amount of time with density given by $f(x) = frac{x}{e^x} , x>0$, compute the density function of the length of time that the machine functions.
My approach :
Let $p$ be the probability that component $i$ works for an amount of time $t$, I can find this by integrating the pdf over $0$ to $t$.
Now probability that $P(text{at least 3 work}) = 1-P(4)^c - P(5)^c$ this I can find by assuming the above as a binomial variable.
Will this be the pdf, which is to say, is the pdf equal to $P(text{at least 3 work})$?
probability probability-distributions random-variables binomial-distribution
probability probability-distributions random-variables binomial-distribution
edited Dec 3 '18 at 14:25
Aaron Montgomery
4,732523
4,732523
asked Dec 3 '18 at 14:03
user601297user601297
39219
39219
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
I think you're close. At time $t$, the probability that a given component still works is $$p(t) = int_0^t tau e^{-tau}, dtau = left. -(tau+1) e^{-tau}right|_{tau=0}^{tau=t} = 1 - (t+1) e^{-t}.$$
The chance that exactly $n$ out of 5 components still work at time $t$ is thus $$binom{5}{n} p(t)^n (1-p(t))^{5-n}$$
and the chance that the machine works is just the sum of the above expression from $n = 3$ to $n = 5$, which is probably a bit messy but straightforward to compute.
$endgroup$
$begingroup$
Ok got it, thanks
$endgroup$
– user601297
Dec 3 '18 at 20:07
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%2f3024094%2fprobability-of-machine-working%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$
I think you're close. At time $t$, the probability that a given component still works is $$p(t) = int_0^t tau e^{-tau}, dtau = left. -(tau+1) e^{-tau}right|_{tau=0}^{tau=t} = 1 - (t+1) e^{-t}.$$
The chance that exactly $n$ out of 5 components still work at time $t$ is thus $$binom{5}{n} p(t)^n (1-p(t))^{5-n}$$
and the chance that the machine works is just the sum of the above expression from $n = 3$ to $n = 5$, which is probably a bit messy but straightforward to compute.
$endgroup$
$begingroup$
Ok got it, thanks
$endgroup$
– user601297
Dec 3 '18 at 20:07
add a comment |
$begingroup$
I think you're close. At time $t$, the probability that a given component still works is $$p(t) = int_0^t tau e^{-tau}, dtau = left. -(tau+1) e^{-tau}right|_{tau=0}^{tau=t} = 1 - (t+1) e^{-t}.$$
The chance that exactly $n$ out of 5 components still work at time $t$ is thus $$binom{5}{n} p(t)^n (1-p(t))^{5-n}$$
and the chance that the machine works is just the sum of the above expression from $n = 3$ to $n = 5$, which is probably a bit messy but straightforward to compute.
$endgroup$
$begingroup$
Ok got it, thanks
$endgroup$
– user601297
Dec 3 '18 at 20:07
add a comment |
$begingroup$
I think you're close. At time $t$, the probability that a given component still works is $$p(t) = int_0^t tau e^{-tau}, dtau = left. -(tau+1) e^{-tau}right|_{tau=0}^{tau=t} = 1 - (t+1) e^{-t}.$$
The chance that exactly $n$ out of 5 components still work at time $t$ is thus $$binom{5}{n} p(t)^n (1-p(t))^{5-n}$$
and the chance that the machine works is just the sum of the above expression from $n = 3$ to $n = 5$, which is probably a bit messy but straightforward to compute.
$endgroup$
I think you're close. At time $t$, the probability that a given component still works is $$p(t) = int_0^t tau e^{-tau}, dtau = left. -(tau+1) e^{-tau}right|_{tau=0}^{tau=t} = 1 - (t+1) e^{-t}.$$
The chance that exactly $n$ out of 5 components still work at time $t$ is thus $$binom{5}{n} p(t)^n (1-p(t))^{5-n}$$
and the chance that the machine works is just the sum of the above expression from $n = 3$ to $n = 5$, which is probably a bit messy but straightforward to compute.
edited Dec 3 '18 at 20:42
answered Dec 3 '18 at 15:23
Connor HarrisConnor Harris
4,355724
4,355724
$begingroup$
Ok got it, thanks
$endgroup$
– user601297
Dec 3 '18 at 20:07
add a comment |
$begingroup$
Ok got it, thanks
$endgroup$
– user601297
Dec 3 '18 at 20:07
$begingroup$
Ok got it, thanks
$endgroup$
– user601297
Dec 3 '18 at 20:07
$begingroup$
Ok got it, thanks
$endgroup$
– user601297
Dec 3 '18 at 20:07
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%2f3024094%2fprobability-of-machine-working%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