Number of Injury claims per month
$begingroup$
The number of injury claims per month is given by $N$ where
$\$
$
P(N=n) =dfrac{1}{(n+1)(n+2)}
$
where $0 leq n$
Determine the probability of at least one claim during a particular month given that there have been at most four claims during that month.
I have this so far: You have 5 conditions, the 1st is no claims in a month, the 2nd is the 1 claim and so on. I've deicded that the easiest way to do this is to use the compliement that is, $PR($No claim| at most 4 claims$)$
Condition 1: $PR;(No; claim; | ;No; claim)=dfrac{1}{4}$
Condition 2: $PR;(No ; claim; | ;1 ; claim)= dfrac{1}{12}$
Condition 3: $PR;(No ; claim ; | ; 2; claims)= dfrac{1}{24} $
Condition 4: $PR;(No ; claim ; | ; 3 ; claims)= dfrac{1}{40}$
Condition 5: $PR;(No ; claim ; | ; 4 ; claims) = dfrac{1}{60}$
The sum of the probabilities will be my demoniator. I dont think I am going about this the right way since the answer is now here near what I got.
probability combinatorics statistics
$endgroup$
add a comment |
$begingroup$
The number of injury claims per month is given by $N$ where
$\$
$
P(N=n) =dfrac{1}{(n+1)(n+2)}
$
where $0 leq n$
Determine the probability of at least one claim during a particular month given that there have been at most four claims during that month.
I have this so far: You have 5 conditions, the 1st is no claims in a month, the 2nd is the 1 claim and so on. I've deicded that the easiest way to do this is to use the compliement that is, $PR($No claim| at most 4 claims$)$
Condition 1: $PR;(No; claim; | ;No; claim)=dfrac{1}{4}$
Condition 2: $PR;(No ; claim; | ;1 ; claim)= dfrac{1}{12}$
Condition 3: $PR;(No ; claim ; | ; 2; claims)= dfrac{1}{24} $
Condition 4: $PR;(No ; claim ; | ; 3 ; claims)= dfrac{1}{40}$
Condition 5: $PR;(No ; claim ; | ; 4 ; claims) = dfrac{1}{60}$
The sum of the probabilities will be my demoniator. I dont think I am going about this the right way since the answer is now here near what I got.
probability combinatorics statistics
$endgroup$
$begingroup$
This is a SOA practice problem. :) I'd be happy to spoil it for you, but are you sure you can't figure it out from the solutions they provide?
$endgroup$
– nomen
Nov 30 '13 at 5:06
$begingroup$
Oh yes I found it, it was actually quite simple. I overlooked the definition of conditional probability.
$endgroup$
– adam
Nov 30 '13 at 5:08
add a comment |
$begingroup$
The number of injury claims per month is given by $N$ where
$\$
$
P(N=n) =dfrac{1}{(n+1)(n+2)}
$
where $0 leq n$
Determine the probability of at least one claim during a particular month given that there have been at most four claims during that month.
I have this so far: You have 5 conditions, the 1st is no claims in a month, the 2nd is the 1 claim and so on. I've deicded that the easiest way to do this is to use the compliement that is, $PR($No claim| at most 4 claims$)$
Condition 1: $PR;(No; claim; | ;No; claim)=dfrac{1}{4}$
Condition 2: $PR;(No ; claim; | ;1 ; claim)= dfrac{1}{12}$
Condition 3: $PR;(No ; claim ; | ; 2; claims)= dfrac{1}{24} $
Condition 4: $PR;(No ; claim ; | ; 3 ; claims)= dfrac{1}{40}$
Condition 5: $PR;(No ; claim ; | ; 4 ; claims) = dfrac{1}{60}$
The sum of the probabilities will be my demoniator. I dont think I am going about this the right way since the answer is now here near what I got.
probability combinatorics statistics
$endgroup$
The number of injury claims per month is given by $N$ where
$\$
$
P(N=n) =dfrac{1}{(n+1)(n+2)}
$
where $0 leq n$
Determine the probability of at least one claim during a particular month given that there have been at most four claims during that month.
I have this so far: You have 5 conditions, the 1st is no claims in a month, the 2nd is the 1 claim and so on. I've deicded that the easiest way to do this is to use the compliement that is, $PR($No claim| at most 4 claims$)$
Condition 1: $PR;(No; claim; | ;No; claim)=dfrac{1}{4}$
Condition 2: $PR;(No ; claim; | ;1 ; claim)= dfrac{1}{12}$
Condition 3: $PR;(No ; claim ; | ; 2; claims)= dfrac{1}{24} $
Condition 4: $PR;(No ; claim ; | ; 3 ; claims)= dfrac{1}{40}$
Condition 5: $PR;(No ; claim ; | ; 4 ; claims) = dfrac{1}{60}$
The sum of the probabilities will be my demoniator. I dont think I am going about this the right way since the answer is now here near what I got.
probability combinatorics statistics
probability combinatorics statistics
asked Nov 30 '13 at 3:52
adamadam
799722
799722
$begingroup$
This is a SOA practice problem. :) I'd be happy to spoil it for you, but are you sure you can't figure it out from the solutions they provide?
$endgroup$
– nomen
Nov 30 '13 at 5:06
$begingroup$
Oh yes I found it, it was actually quite simple. I overlooked the definition of conditional probability.
$endgroup$
– adam
Nov 30 '13 at 5:08
add a comment |
$begingroup$
This is a SOA practice problem. :) I'd be happy to spoil it for you, but are you sure you can't figure it out from the solutions they provide?
$endgroup$
– nomen
Nov 30 '13 at 5:06
$begingroup$
Oh yes I found it, it was actually quite simple. I overlooked the definition of conditional probability.
$endgroup$
– adam
Nov 30 '13 at 5:08
$begingroup$
This is a SOA practice problem. :) I'd be happy to spoil it for you, but are you sure you can't figure it out from the solutions they provide?
$endgroup$
– nomen
Nov 30 '13 at 5:06
$begingroup$
This is a SOA practice problem. :) I'd be happy to spoil it for you, but are you sure you can't figure it out from the solutions they provide?
$endgroup$
– nomen
Nov 30 '13 at 5:06
$begingroup$
Oh yes I found it, it was actually quite simple. I overlooked the definition of conditional probability.
$endgroup$
– adam
Nov 30 '13 at 5:08
$begingroup$
Oh yes I found it, it was actually quite simple. I overlooked the definition of conditional probability.
$endgroup$
– adam
Nov 30 '13 at 5:08
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
I'll enumerate the mass function:
$$P(n) =
begin{cases}
frac{1}{2} text{ if } n = 0\
frac{1}{6} text{ if } n = 1\
frac{1}{12}text{ if } n = 2\
frac{1}{20}text{ if } n = 3\
frac{1}{30}text{ if } n = 4\
end{cases}
$$
This is a sufficiently "deep" enough enumeration, since, recalling the definition of the conditional probability,
$$
P(Xgeq 1 | X leq 4) = frac{P(1 leq X leq 4)}{P(Xleq 4)}\
= frac{ frac{1}{6} + frac{1}{12} + frac{1}{20} + frac{1}{30} }{ frac{1}{2} + frac{1}{6} + frac{1}{12} + frac{1}{20} + frac{1}{30} }
$$
$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%2f586399%2fnumber-of-injury-claims-per-month%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'll enumerate the mass function:
$$P(n) =
begin{cases}
frac{1}{2} text{ if } n = 0\
frac{1}{6} text{ if } n = 1\
frac{1}{12}text{ if } n = 2\
frac{1}{20}text{ if } n = 3\
frac{1}{30}text{ if } n = 4\
end{cases}
$$
This is a sufficiently "deep" enough enumeration, since, recalling the definition of the conditional probability,
$$
P(Xgeq 1 | X leq 4) = frac{P(1 leq X leq 4)}{P(Xleq 4)}\
= frac{ frac{1}{6} + frac{1}{12} + frac{1}{20} + frac{1}{30} }{ frac{1}{2} + frac{1}{6} + frac{1}{12} + frac{1}{20} + frac{1}{30} }
$$
$endgroup$
add a comment |
$begingroup$
I'll enumerate the mass function:
$$P(n) =
begin{cases}
frac{1}{2} text{ if } n = 0\
frac{1}{6} text{ if } n = 1\
frac{1}{12}text{ if } n = 2\
frac{1}{20}text{ if } n = 3\
frac{1}{30}text{ if } n = 4\
end{cases}
$$
This is a sufficiently "deep" enough enumeration, since, recalling the definition of the conditional probability,
$$
P(Xgeq 1 | X leq 4) = frac{P(1 leq X leq 4)}{P(Xleq 4)}\
= frac{ frac{1}{6} + frac{1}{12} + frac{1}{20} + frac{1}{30} }{ frac{1}{2} + frac{1}{6} + frac{1}{12} + frac{1}{20} + frac{1}{30} }
$$
$endgroup$
add a comment |
$begingroup$
I'll enumerate the mass function:
$$P(n) =
begin{cases}
frac{1}{2} text{ if } n = 0\
frac{1}{6} text{ if } n = 1\
frac{1}{12}text{ if } n = 2\
frac{1}{20}text{ if } n = 3\
frac{1}{30}text{ if } n = 4\
end{cases}
$$
This is a sufficiently "deep" enough enumeration, since, recalling the definition of the conditional probability,
$$
P(Xgeq 1 | X leq 4) = frac{P(1 leq X leq 4)}{P(Xleq 4)}\
= frac{ frac{1}{6} + frac{1}{12} + frac{1}{20} + frac{1}{30} }{ frac{1}{2} + frac{1}{6} + frac{1}{12} + frac{1}{20} + frac{1}{30} }
$$
$endgroup$
I'll enumerate the mass function:
$$P(n) =
begin{cases}
frac{1}{2} text{ if } n = 0\
frac{1}{6} text{ if } n = 1\
frac{1}{12}text{ if } n = 2\
frac{1}{20}text{ if } n = 3\
frac{1}{30}text{ if } n = 4\
end{cases}
$$
This is a sufficiently "deep" enough enumeration, since, recalling the definition of the conditional probability,
$$
P(Xgeq 1 | X leq 4) = frac{P(1 leq X leq 4)}{P(Xleq 4)}\
= frac{ frac{1}{6} + frac{1}{12} + frac{1}{20} + frac{1}{30} }{ frac{1}{2} + frac{1}{6} + frac{1}{12} + frac{1}{20} + frac{1}{30} }
$$
answered Nov 30 '13 at 5:16
nomennomen
1,7431020
1,7431020
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%2f586399%2fnumber-of-injury-claims-per-month%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
$begingroup$
This is a SOA practice problem. :) I'd be happy to spoil it for you, but are you sure you can't figure it out from the solutions they provide?
$endgroup$
– nomen
Nov 30 '13 at 5:06
$begingroup$
Oh yes I found it, it was actually quite simple. I overlooked the definition of conditional probability.
$endgroup$
– adam
Nov 30 '13 at 5:08