Determine the Expected Value of Uniformly random elements of sets
$begingroup$
Answer is D
The way I attempted this was that for X = MAX(a,b), the random variable X is equivalent to the max value of a and b. So, from the 2 sets, the probability of getting k from set {1,2...100} is $frac{k}{100}$ and for the second set we have to select $frac{k-1}{100}$ so that it is less than the first one.
E(X) would then just be the summation of $x*$$frac{{k*}{(k-1)}}{100}$, which is option B.
Don't understand how its D? Any explanations?
probability discrete-mathematics random-variables expected-value
$endgroup$
add a comment |
$begingroup$
Answer is D
The way I attempted this was that for X = MAX(a,b), the random variable X is equivalent to the max value of a and b. So, from the 2 sets, the probability of getting k from set {1,2...100} is $frac{k}{100}$ and for the second set we have to select $frac{k-1}{100}$ so that it is less than the first one.
E(X) would then just be the summation of $x*$$frac{{k*}{(k-1)}}{100}$, which is option B.
Don't understand how its D? Any explanations?
probability discrete-mathematics random-variables expected-value
$endgroup$
add a comment |
$begingroup$
Answer is D
The way I attempted this was that for X = MAX(a,b), the random variable X is equivalent to the max value of a and b. So, from the 2 sets, the probability of getting k from set {1,2...100} is $frac{k}{100}$ and for the second set we have to select $frac{k-1}{100}$ so that it is less than the first one.
E(X) would then just be the summation of $x*$$frac{{k*}{(k-1)}}{100}$, which is option B.
Don't understand how its D? Any explanations?
probability discrete-mathematics random-variables expected-value
$endgroup$
Answer is D
The way I attempted this was that for X = MAX(a,b), the random variable X is equivalent to the max value of a and b. So, from the 2 sets, the probability of getting k from set {1,2...100} is $frac{k}{100}$ and for the second set we have to select $frac{k-1}{100}$ so that it is less than the first one.
E(X) would then just be the summation of $x*$$frac{{k*}{(k-1)}}{100}$, which is option B.
Don't understand how its D? Any explanations?
probability discrete-mathematics random-variables expected-value
probability discrete-mathematics random-variables expected-value
asked Dec 12 '18 at 18:34
TobyToby
1577
1577
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Your general logic is fine, although you calculate the probability incorrectly. Note that, if $max(a,b) = k$, then we have one of three cases:
$a = k$ and $b < k$.
$a < k$ and $b = k$.- $a = b = k$
It should be readily apparent that these cases are disjoint, so to find the probability $P(X = k)$, we can add the probabilities of these cases.
Since $a,b$ are uniform, it's really a matter of counting how many ways this can happen. There's one way for $a = k$ to happen and $k-1$ ways for $b < k$, so multiplying these gives $k-1$ ways; similarly, there's also $k-1$ ways to get $a < k$ and $b = k$. Finally, there's exactly one way to get $a = b = k$. Adding these gives you $1 + 2(k - 1)$; we divide by $100^2$ as the total number of outcomes for $a,b$. This give the probability $P(X = k) = frac{1 + 2(k-1)}{100^2}$, from which you can derive the expected value in the way you do above.
$endgroup$
$begingroup$
I'm not familiar with the disjoint terminology. I'm assuming that means there is nothing in common with those 3 cases? If so, doesn't case 1 and 2 have a=k and b=k common with case 3? Does that make it not disjoint and you can't add probabilities (assuming again you can add probabilities only for disjoint?)
$endgroup$
– Toby
Dec 12 '18 at 22:42
1
$begingroup$
By disjoint, I mean that the cases have no overlap -- no outcome can be in multiple cases at once. You're right in noting disjointness is required to add probabilities. But it's impossible for case $3$ to overlap with either of the other two, because if $a=k$ and $b=k$, then one of the conditions has to break (because case 1 requires $b < k$ and case 2 requires $a < k$).
$endgroup$
– platty
Dec 12 '18 at 22:43
$begingroup$
Oh, I understand what you mean now! Cheers
$endgroup$
– Toby
Dec 12 '18 at 22:45
add a comment |
$begingroup$
You can use the following:
$$E(X)=sum_{k=1}^{100} P(Xge k)$$
$$P(Xge k)=1-P(Xle k-1)$$
$$P(Xle k)=P(ale ktext{ and }ble k)$$
$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%2f3037061%2fdetermine-the-expected-value-of-uniformly-random-elements-of-sets%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$
Your general logic is fine, although you calculate the probability incorrectly. Note that, if $max(a,b) = k$, then we have one of three cases:
$a = k$ and $b < k$.
$a < k$ and $b = k$.- $a = b = k$
It should be readily apparent that these cases are disjoint, so to find the probability $P(X = k)$, we can add the probabilities of these cases.
Since $a,b$ are uniform, it's really a matter of counting how many ways this can happen. There's one way for $a = k$ to happen and $k-1$ ways for $b < k$, so multiplying these gives $k-1$ ways; similarly, there's also $k-1$ ways to get $a < k$ and $b = k$. Finally, there's exactly one way to get $a = b = k$. Adding these gives you $1 + 2(k - 1)$; we divide by $100^2$ as the total number of outcomes for $a,b$. This give the probability $P(X = k) = frac{1 + 2(k-1)}{100^2}$, from which you can derive the expected value in the way you do above.
$endgroup$
$begingroup$
I'm not familiar with the disjoint terminology. I'm assuming that means there is nothing in common with those 3 cases? If so, doesn't case 1 and 2 have a=k and b=k common with case 3? Does that make it not disjoint and you can't add probabilities (assuming again you can add probabilities only for disjoint?)
$endgroup$
– Toby
Dec 12 '18 at 22:42
1
$begingroup$
By disjoint, I mean that the cases have no overlap -- no outcome can be in multiple cases at once. You're right in noting disjointness is required to add probabilities. But it's impossible for case $3$ to overlap with either of the other two, because if $a=k$ and $b=k$, then one of the conditions has to break (because case 1 requires $b < k$ and case 2 requires $a < k$).
$endgroup$
– platty
Dec 12 '18 at 22:43
$begingroup$
Oh, I understand what you mean now! Cheers
$endgroup$
– Toby
Dec 12 '18 at 22:45
add a comment |
$begingroup$
Your general logic is fine, although you calculate the probability incorrectly. Note that, if $max(a,b) = k$, then we have one of three cases:
$a = k$ and $b < k$.
$a < k$ and $b = k$.- $a = b = k$
It should be readily apparent that these cases are disjoint, so to find the probability $P(X = k)$, we can add the probabilities of these cases.
Since $a,b$ are uniform, it's really a matter of counting how many ways this can happen. There's one way for $a = k$ to happen and $k-1$ ways for $b < k$, so multiplying these gives $k-1$ ways; similarly, there's also $k-1$ ways to get $a < k$ and $b = k$. Finally, there's exactly one way to get $a = b = k$. Adding these gives you $1 + 2(k - 1)$; we divide by $100^2$ as the total number of outcomes for $a,b$. This give the probability $P(X = k) = frac{1 + 2(k-1)}{100^2}$, from which you can derive the expected value in the way you do above.
$endgroup$
$begingroup$
I'm not familiar with the disjoint terminology. I'm assuming that means there is nothing in common with those 3 cases? If so, doesn't case 1 and 2 have a=k and b=k common with case 3? Does that make it not disjoint and you can't add probabilities (assuming again you can add probabilities only for disjoint?)
$endgroup$
– Toby
Dec 12 '18 at 22:42
1
$begingroup$
By disjoint, I mean that the cases have no overlap -- no outcome can be in multiple cases at once. You're right in noting disjointness is required to add probabilities. But it's impossible for case $3$ to overlap with either of the other two, because if $a=k$ and $b=k$, then one of the conditions has to break (because case 1 requires $b < k$ and case 2 requires $a < k$).
$endgroup$
– platty
Dec 12 '18 at 22:43
$begingroup$
Oh, I understand what you mean now! Cheers
$endgroup$
– Toby
Dec 12 '18 at 22:45
add a comment |
$begingroup$
Your general logic is fine, although you calculate the probability incorrectly. Note that, if $max(a,b) = k$, then we have one of three cases:
$a = k$ and $b < k$.
$a < k$ and $b = k$.- $a = b = k$
It should be readily apparent that these cases are disjoint, so to find the probability $P(X = k)$, we can add the probabilities of these cases.
Since $a,b$ are uniform, it's really a matter of counting how many ways this can happen. There's one way for $a = k$ to happen and $k-1$ ways for $b < k$, so multiplying these gives $k-1$ ways; similarly, there's also $k-1$ ways to get $a < k$ and $b = k$. Finally, there's exactly one way to get $a = b = k$. Adding these gives you $1 + 2(k - 1)$; we divide by $100^2$ as the total number of outcomes for $a,b$. This give the probability $P(X = k) = frac{1 + 2(k-1)}{100^2}$, from which you can derive the expected value in the way you do above.
$endgroup$
Your general logic is fine, although you calculate the probability incorrectly. Note that, if $max(a,b) = k$, then we have one of three cases:
$a = k$ and $b < k$.
$a < k$ and $b = k$.- $a = b = k$
It should be readily apparent that these cases are disjoint, so to find the probability $P(X = k)$, we can add the probabilities of these cases.
Since $a,b$ are uniform, it's really a matter of counting how many ways this can happen. There's one way for $a = k$ to happen and $k-1$ ways for $b < k$, so multiplying these gives $k-1$ ways; similarly, there's also $k-1$ ways to get $a < k$ and $b = k$. Finally, there's exactly one way to get $a = b = k$. Adding these gives you $1 + 2(k - 1)$; we divide by $100^2$ as the total number of outcomes for $a,b$. This give the probability $P(X = k) = frac{1 + 2(k-1)}{100^2}$, from which you can derive the expected value in the way you do above.
answered Dec 12 '18 at 22:03
plattyplatty
3,370320
3,370320
$begingroup$
I'm not familiar with the disjoint terminology. I'm assuming that means there is nothing in common with those 3 cases? If so, doesn't case 1 and 2 have a=k and b=k common with case 3? Does that make it not disjoint and you can't add probabilities (assuming again you can add probabilities only for disjoint?)
$endgroup$
– Toby
Dec 12 '18 at 22:42
1
$begingroup$
By disjoint, I mean that the cases have no overlap -- no outcome can be in multiple cases at once. You're right in noting disjointness is required to add probabilities. But it's impossible for case $3$ to overlap with either of the other two, because if $a=k$ and $b=k$, then one of the conditions has to break (because case 1 requires $b < k$ and case 2 requires $a < k$).
$endgroup$
– platty
Dec 12 '18 at 22:43
$begingroup$
Oh, I understand what you mean now! Cheers
$endgroup$
– Toby
Dec 12 '18 at 22:45
add a comment |
$begingroup$
I'm not familiar with the disjoint terminology. I'm assuming that means there is nothing in common with those 3 cases? If so, doesn't case 1 and 2 have a=k and b=k common with case 3? Does that make it not disjoint and you can't add probabilities (assuming again you can add probabilities only for disjoint?)
$endgroup$
– Toby
Dec 12 '18 at 22:42
1
$begingroup$
By disjoint, I mean that the cases have no overlap -- no outcome can be in multiple cases at once. You're right in noting disjointness is required to add probabilities. But it's impossible for case $3$ to overlap with either of the other two, because if $a=k$ and $b=k$, then one of the conditions has to break (because case 1 requires $b < k$ and case 2 requires $a < k$).
$endgroup$
– platty
Dec 12 '18 at 22:43
$begingroup$
Oh, I understand what you mean now! Cheers
$endgroup$
– Toby
Dec 12 '18 at 22:45
$begingroup$
I'm not familiar with the disjoint terminology. I'm assuming that means there is nothing in common with those 3 cases? If so, doesn't case 1 and 2 have a=k and b=k common with case 3? Does that make it not disjoint and you can't add probabilities (assuming again you can add probabilities only for disjoint?)
$endgroup$
– Toby
Dec 12 '18 at 22:42
$begingroup$
I'm not familiar with the disjoint terminology. I'm assuming that means there is nothing in common with those 3 cases? If so, doesn't case 1 and 2 have a=k and b=k common with case 3? Does that make it not disjoint and you can't add probabilities (assuming again you can add probabilities only for disjoint?)
$endgroup$
– Toby
Dec 12 '18 at 22:42
1
1
$begingroup$
By disjoint, I mean that the cases have no overlap -- no outcome can be in multiple cases at once. You're right in noting disjointness is required to add probabilities. But it's impossible for case $3$ to overlap with either of the other two, because if $a=k$ and $b=k$, then one of the conditions has to break (because case 1 requires $b < k$ and case 2 requires $a < k$).
$endgroup$
– platty
Dec 12 '18 at 22:43
$begingroup$
By disjoint, I mean that the cases have no overlap -- no outcome can be in multiple cases at once. You're right in noting disjointness is required to add probabilities. But it's impossible for case $3$ to overlap with either of the other two, because if $a=k$ and $b=k$, then one of the conditions has to break (because case 1 requires $b < k$ and case 2 requires $a < k$).
$endgroup$
– platty
Dec 12 '18 at 22:43
$begingroup$
Oh, I understand what you mean now! Cheers
$endgroup$
– Toby
Dec 12 '18 at 22:45
$begingroup$
Oh, I understand what you mean now! Cheers
$endgroup$
– Toby
Dec 12 '18 at 22:45
add a comment |
$begingroup$
You can use the following:
$$E(X)=sum_{k=1}^{100} P(Xge k)$$
$$P(Xge k)=1-P(Xle k-1)$$
$$P(Xle k)=P(ale ktext{ and }ble k)$$
$endgroup$
add a comment |
$begingroup$
You can use the following:
$$E(X)=sum_{k=1}^{100} P(Xge k)$$
$$P(Xge k)=1-P(Xle k-1)$$
$$P(Xle k)=P(ale ktext{ and }ble k)$$
$endgroup$
add a comment |
$begingroup$
You can use the following:
$$E(X)=sum_{k=1}^{100} P(Xge k)$$
$$P(Xge k)=1-P(Xle k-1)$$
$$P(Xle k)=P(ale ktext{ and }ble k)$$
$endgroup$
You can use the following:
$$E(X)=sum_{k=1}^{100} P(Xge k)$$
$$P(Xge k)=1-P(Xle k-1)$$
$$P(Xle k)=P(ale ktext{ and }ble k)$$
answered Dec 12 '18 at 18:40
Bjørn Kjos-HanssenBjørn Kjos-Hanssen
2,086918
2,086918
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%2f3037061%2fdetermine-the-expected-value-of-uniformly-random-elements-of-sets%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