Probability Question About Basketball Free Throws and Distributions
$begingroup$
I was trying to solve the following question from the Harvard Stat $110$ course, from the book Introduction to Probability by Blitzstein and Hwang, but could not wrap my head around it. Any and all help is appreciated, especially with part (b):
A certain basketball player practices shooting free throws over and over
again. The shots are independent, with probability p of success.
(a) In $n$ shots, what is the expected number of streaks of $7$ consecutive successful shots?
(Note that, for example, $9$ in a row counts as $3$ streaks.)
(b) Now suppose that the player keeps shooting until making $7$ shots in a row for the first time. Let $X$ be the number of shots taken. Show that $E(X) ≤ 7/p^7.$
Hint: Consider the first $7$ trials as a block, then the next $7$ as a block, etc.
probability probability-theory statistics probability-distributions
$endgroup$
add a comment |
$begingroup$
I was trying to solve the following question from the Harvard Stat $110$ course, from the book Introduction to Probability by Blitzstein and Hwang, but could not wrap my head around it. Any and all help is appreciated, especially with part (b):
A certain basketball player practices shooting free throws over and over
again. The shots are independent, with probability p of success.
(a) In $n$ shots, what is the expected number of streaks of $7$ consecutive successful shots?
(Note that, for example, $9$ in a row counts as $3$ streaks.)
(b) Now suppose that the player keeps shooting until making $7$ shots in a row for the first time. Let $X$ be the number of shots taken. Show that $E(X) ≤ 7/p^7.$
Hint: Consider the first $7$ trials as a block, then the next $7$ as a block, etc.
probability probability-theory statistics probability-distributions
$endgroup$
add a comment |
$begingroup$
I was trying to solve the following question from the Harvard Stat $110$ course, from the book Introduction to Probability by Blitzstein and Hwang, but could not wrap my head around it. Any and all help is appreciated, especially with part (b):
A certain basketball player practices shooting free throws over and over
again. The shots are independent, with probability p of success.
(a) In $n$ shots, what is the expected number of streaks of $7$ consecutive successful shots?
(Note that, for example, $9$ in a row counts as $3$ streaks.)
(b) Now suppose that the player keeps shooting until making $7$ shots in a row for the first time. Let $X$ be the number of shots taken. Show that $E(X) ≤ 7/p^7.$
Hint: Consider the first $7$ trials as a block, then the next $7$ as a block, etc.
probability probability-theory statistics probability-distributions
$endgroup$
I was trying to solve the following question from the Harvard Stat $110$ course, from the book Introduction to Probability by Blitzstein and Hwang, but could not wrap my head around it. Any and all help is appreciated, especially with part (b):
A certain basketball player practices shooting free throws over and over
again. The shots are independent, with probability p of success.
(a) In $n$ shots, what is the expected number of streaks of $7$ consecutive successful shots?
(Note that, for example, $9$ in a row counts as $3$ streaks.)
(b) Now suppose that the player keeps shooting until making $7$ shots in a row for the first time. Let $X$ be the number of shots taken. Show that $E(X) ≤ 7/p^7.$
Hint: Consider the first $7$ trials as a block, then the next $7$ as a block, etc.
probability probability-theory statistics probability-distributions
probability probability-theory statistics probability-distributions
edited Oct 4 '16 at 9:50
Jimmy R.
33.1k42257
33.1k42257
asked Oct 4 '16 at 5:44
mathstudentmathstudent
62
62
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
I'm not sure I understand your explanation on (a), but here's my take on (b):
Let $E(n)$ be the expected number of shots taken until $n$ shots are made in a row. We have the following recursive relationship:
$$E(n) = E(n-1) + p + (1-p)(1+E(n)).$$
Simplifying this, we get:
$$E(n) = frac{1}{p} + frac{E(n-1)}{p}$$
Knowing $E(0) = 0$, we can prove that $E(7) = frac{1}{p}+frac{1}{p^2}+frac{1}{p^3}+frac{1}{p^4}+frac{1}{p^5}+frac{1}{p^6}+frac{1}{p^7}leq frac{7}{p^7}.$
$endgroup$
add a comment |
$begingroup$
(b) has already been answered very well, so here is my take on (a):
Let us use linearity of expected value.
Let $I_n$ denote a random variable such that $I_n=1$ if and only if the $n$-th shot was the end of a streak ($I_n=0$ for $n<7$).
Then the requiered expected value $E(n)=sumlimits_{i=1}^n mathbb{E}[I_n]=sumlimits_{i=1}^n P[I_n=1]=sumlimits_{i=7}^n p^7=(n-6)p^7$
$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%2f1953068%2fprobability-question-about-basketball-free-throws-and-distributions%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$
I'm not sure I understand your explanation on (a), but here's my take on (b):
Let $E(n)$ be the expected number of shots taken until $n$ shots are made in a row. We have the following recursive relationship:
$$E(n) = E(n-1) + p + (1-p)(1+E(n)).$$
Simplifying this, we get:
$$E(n) = frac{1}{p} + frac{E(n-1)}{p}$$
Knowing $E(0) = 0$, we can prove that $E(7) = frac{1}{p}+frac{1}{p^2}+frac{1}{p^3}+frac{1}{p^4}+frac{1}{p^5}+frac{1}{p^6}+frac{1}{p^7}leq frac{7}{p^7}.$
$endgroup$
add a comment |
$begingroup$
I'm not sure I understand your explanation on (a), but here's my take on (b):
Let $E(n)$ be the expected number of shots taken until $n$ shots are made in a row. We have the following recursive relationship:
$$E(n) = E(n-1) + p + (1-p)(1+E(n)).$$
Simplifying this, we get:
$$E(n) = frac{1}{p} + frac{E(n-1)}{p}$$
Knowing $E(0) = 0$, we can prove that $E(7) = frac{1}{p}+frac{1}{p^2}+frac{1}{p^3}+frac{1}{p^4}+frac{1}{p^5}+frac{1}{p^6}+frac{1}{p^7}leq frac{7}{p^7}.$
$endgroup$
add a comment |
$begingroup$
I'm not sure I understand your explanation on (a), but here's my take on (b):
Let $E(n)$ be the expected number of shots taken until $n$ shots are made in a row. We have the following recursive relationship:
$$E(n) = E(n-1) + p + (1-p)(1+E(n)).$$
Simplifying this, we get:
$$E(n) = frac{1}{p} + frac{E(n-1)}{p}$$
Knowing $E(0) = 0$, we can prove that $E(7) = frac{1}{p}+frac{1}{p^2}+frac{1}{p^3}+frac{1}{p^4}+frac{1}{p^5}+frac{1}{p^6}+frac{1}{p^7}leq frac{7}{p^7}.$
$endgroup$
I'm not sure I understand your explanation on (a), but here's my take on (b):
Let $E(n)$ be the expected number of shots taken until $n$ shots are made in a row. We have the following recursive relationship:
$$E(n) = E(n-1) + p + (1-p)(1+E(n)).$$
Simplifying this, we get:
$$E(n) = frac{1}{p} + frac{E(n-1)}{p}$$
Knowing $E(0) = 0$, we can prove that $E(7) = frac{1}{p}+frac{1}{p^2}+frac{1}{p^3}+frac{1}{p^4}+frac{1}{p^5}+frac{1}{p^6}+frac{1}{p^7}leq frac{7}{p^7}.$
answered Oct 4 '16 at 22:00
trang1618trang1618
1,435214
1,435214
add a comment |
add a comment |
$begingroup$
(b) has already been answered very well, so here is my take on (a):
Let us use linearity of expected value.
Let $I_n$ denote a random variable such that $I_n=1$ if and only if the $n$-th shot was the end of a streak ($I_n=0$ for $n<7$).
Then the requiered expected value $E(n)=sumlimits_{i=1}^n mathbb{E}[I_n]=sumlimits_{i=1}^n P[I_n=1]=sumlimits_{i=7}^n p^7=(n-6)p^7$
$endgroup$
add a comment |
$begingroup$
(b) has already been answered very well, so here is my take on (a):
Let us use linearity of expected value.
Let $I_n$ denote a random variable such that $I_n=1$ if and only if the $n$-th shot was the end of a streak ($I_n=0$ for $n<7$).
Then the requiered expected value $E(n)=sumlimits_{i=1}^n mathbb{E}[I_n]=sumlimits_{i=1}^n P[I_n=1]=sumlimits_{i=7}^n p^7=(n-6)p^7$
$endgroup$
add a comment |
$begingroup$
(b) has already been answered very well, so here is my take on (a):
Let us use linearity of expected value.
Let $I_n$ denote a random variable such that $I_n=1$ if and only if the $n$-th shot was the end of a streak ($I_n=0$ for $n<7$).
Then the requiered expected value $E(n)=sumlimits_{i=1}^n mathbb{E}[I_n]=sumlimits_{i=1}^n P[I_n=1]=sumlimits_{i=7}^n p^7=(n-6)p^7$
$endgroup$
(b) has already been answered very well, so here is my take on (a):
Let us use linearity of expected value.
Let $I_n$ denote a random variable such that $I_n=1$ if and only if the $n$-th shot was the end of a streak ($I_n=0$ for $n<7$).
Then the requiered expected value $E(n)=sumlimits_{i=1}^n mathbb{E}[I_n]=sumlimits_{i=1}^n P[I_n=1]=sumlimits_{i=7}^n p^7=(n-6)p^7$
answered Sep 6 '17 at 18:21
SergSerg
574315
574315
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%2f1953068%2fprobability-question-about-basketball-free-throws-and-distributions%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