Probability Question Help- Statistics, Distribution, Geometric Distribution and Normalization.

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
0
down vote

favorite












I am having trouble with a probability question regarding to G-distribution.



Background: Let's assume I have a disc that has two sides, one is black and one is white. Note: the disc has biased probability: the probability to get black is $p$ and the probability to get white is $1-p$. when u toss the disc time after time, the number of tosses ($Z$) until u get black at the first time distribute geometrically to: $Z$~$G(p)$ .
Note: formula for G-distribution: $P(Z=k)=p(1-p)^k-1$.



Questions:
1.let's toss the disc time after time until we get two black color in a row (for the first time).
1.a Find the probability function of the random variable: $T =$number of tosses until getting 2 black colors in a row for the first time. Make sure there normalization properties exists.



this is what i have achieved so far:
i know that i have to shoe that the sum of the probabilities of the experiment should equals to $1$.



$P(T=k)=((k-1)*(1-p)^k-2*p)*p$
the arguments in the brackets demonstrating one success of getting black color in $k-1$ tries.
the otter $p$ present success in the $k$-ith. time.
let's show normalization:
$fracp^2(1-p)^2sum_k=1^infty(k-1)(1-p)^k-2$
we know that $frac11-xsum_n=0^inftyx^n=> frac ddx=frac1(1-x)^2=sum_n=1^inftyn*x^n-1$



we multiply both sides with $x^2$ and then we will get :$frac (1-p)^2(1-(1-p)^2fracp^2(1-p)^2=1$. this is my answer but my professor told me its wrong and i don't understand why. if anyone can please help me understand what's wrong or give me a hint or a solution to this problem will be grateful.







share|cite|improve this question






















  • You have computed the probabilities for a different random variable, $T’$, which is the number of tosses it takes to get two black colors (not necessarily in a row).
    – Mike Earnest
    Aug 15 at 12:26










  • I just edited my post. if u can please help.
    – Tomer Levy
    Aug 15 at 13:23










  • Your expression for $P(T=k)$ is incorrect. $(k-1)(1-p)^k-1p^2$ is the probability that the first $k$ flips will contain exactly two blacks, with the second occurring at flip $k$. What you instead want to calculate is the probability that the first $k$ flips contain any number of black flips, as long as the only place where two consecutive black flips occur is in the last two flips. This is harder to write down a formula for.
    – Mike Earnest
    Aug 15 at 13:28










  • Am I understanding the problem correctly? In the below sequence of flips, is $T=10$? $$ W,B,W,W,B,W,B,W,B,B $$
    – Mike Earnest
    Aug 15 at 14:09














up vote
0
down vote

favorite












I am having trouble with a probability question regarding to G-distribution.



Background: Let's assume I have a disc that has two sides, one is black and one is white. Note: the disc has biased probability: the probability to get black is $p$ and the probability to get white is $1-p$. when u toss the disc time after time, the number of tosses ($Z$) until u get black at the first time distribute geometrically to: $Z$~$G(p)$ .
Note: formula for G-distribution: $P(Z=k)=p(1-p)^k-1$.



Questions:
1.let's toss the disc time after time until we get two black color in a row (for the first time).
1.a Find the probability function of the random variable: $T =$number of tosses until getting 2 black colors in a row for the first time. Make sure there normalization properties exists.



this is what i have achieved so far:
i know that i have to shoe that the sum of the probabilities of the experiment should equals to $1$.



$P(T=k)=((k-1)*(1-p)^k-2*p)*p$
the arguments in the brackets demonstrating one success of getting black color in $k-1$ tries.
the otter $p$ present success in the $k$-ith. time.
let's show normalization:
$fracp^2(1-p)^2sum_k=1^infty(k-1)(1-p)^k-2$
we know that $frac11-xsum_n=0^inftyx^n=> frac ddx=frac1(1-x)^2=sum_n=1^inftyn*x^n-1$



we multiply both sides with $x^2$ and then we will get :$frac (1-p)^2(1-(1-p)^2fracp^2(1-p)^2=1$. this is my answer but my professor told me its wrong and i don't understand why. if anyone can please help me understand what's wrong or give me a hint or a solution to this problem will be grateful.







share|cite|improve this question






















  • You have computed the probabilities for a different random variable, $T’$, which is the number of tosses it takes to get two black colors (not necessarily in a row).
    – Mike Earnest
    Aug 15 at 12:26










  • I just edited my post. if u can please help.
    – Tomer Levy
    Aug 15 at 13:23










  • Your expression for $P(T=k)$ is incorrect. $(k-1)(1-p)^k-1p^2$ is the probability that the first $k$ flips will contain exactly two blacks, with the second occurring at flip $k$. What you instead want to calculate is the probability that the first $k$ flips contain any number of black flips, as long as the only place where two consecutive black flips occur is in the last two flips. This is harder to write down a formula for.
    – Mike Earnest
    Aug 15 at 13:28










  • Am I understanding the problem correctly? In the below sequence of flips, is $T=10$? $$ W,B,W,W,B,W,B,W,B,B $$
    – Mike Earnest
    Aug 15 at 14:09












up vote
0
down vote

favorite









up vote
0
down vote

favorite











I am having trouble with a probability question regarding to G-distribution.



Background: Let's assume I have a disc that has two sides, one is black and one is white. Note: the disc has biased probability: the probability to get black is $p$ and the probability to get white is $1-p$. when u toss the disc time after time, the number of tosses ($Z$) until u get black at the first time distribute geometrically to: $Z$~$G(p)$ .
Note: formula for G-distribution: $P(Z=k)=p(1-p)^k-1$.



Questions:
1.let's toss the disc time after time until we get two black color in a row (for the first time).
1.a Find the probability function of the random variable: $T =$number of tosses until getting 2 black colors in a row for the first time. Make sure there normalization properties exists.



this is what i have achieved so far:
i know that i have to shoe that the sum of the probabilities of the experiment should equals to $1$.



$P(T=k)=((k-1)*(1-p)^k-2*p)*p$
the arguments in the brackets demonstrating one success of getting black color in $k-1$ tries.
the otter $p$ present success in the $k$-ith. time.
let's show normalization:
$fracp^2(1-p)^2sum_k=1^infty(k-1)(1-p)^k-2$
we know that $frac11-xsum_n=0^inftyx^n=> frac ddx=frac1(1-x)^2=sum_n=1^inftyn*x^n-1$



we multiply both sides with $x^2$ and then we will get :$frac (1-p)^2(1-(1-p)^2fracp^2(1-p)^2=1$. this is my answer but my professor told me its wrong and i don't understand why. if anyone can please help me understand what's wrong or give me a hint or a solution to this problem will be grateful.







share|cite|improve this question














I am having trouble with a probability question regarding to G-distribution.



Background: Let's assume I have a disc that has two sides, one is black and one is white. Note: the disc has biased probability: the probability to get black is $p$ and the probability to get white is $1-p$. when u toss the disc time after time, the number of tosses ($Z$) until u get black at the first time distribute geometrically to: $Z$~$G(p)$ .
Note: formula for G-distribution: $P(Z=k)=p(1-p)^k-1$.



Questions:
1.let's toss the disc time after time until we get two black color in a row (for the first time).
1.a Find the probability function of the random variable: $T =$number of tosses until getting 2 black colors in a row for the first time. Make sure there normalization properties exists.



this is what i have achieved so far:
i know that i have to shoe that the sum of the probabilities of the experiment should equals to $1$.



$P(T=k)=((k-1)*(1-p)^k-2*p)*p$
the arguments in the brackets demonstrating one success of getting black color in $k-1$ tries.
the otter $p$ present success in the $k$-ith. time.
let's show normalization:
$fracp^2(1-p)^2sum_k=1^infty(k-1)(1-p)^k-2$
we know that $frac11-xsum_n=0^inftyx^n=> frac ddx=frac1(1-x)^2=sum_n=1^inftyn*x^n-1$



we multiply both sides with $x^2$ and then we will get :$frac (1-p)^2(1-(1-p)^2fracp^2(1-p)^2=1$. this is my answer but my professor told me its wrong and i don't understand why. if anyone can please help me understand what's wrong or give me a hint or a solution to this problem will be grateful.









share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Aug 15 at 13:21

























asked Aug 15 at 12:09









Tomer Levy

356




356











  • You have computed the probabilities for a different random variable, $T’$, which is the number of tosses it takes to get two black colors (not necessarily in a row).
    – Mike Earnest
    Aug 15 at 12:26










  • I just edited my post. if u can please help.
    – Tomer Levy
    Aug 15 at 13:23










  • Your expression for $P(T=k)$ is incorrect. $(k-1)(1-p)^k-1p^2$ is the probability that the first $k$ flips will contain exactly two blacks, with the second occurring at flip $k$. What you instead want to calculate is the probability that the first $k$ flips contain any number of black flips, as long as the only place where two consecutive black flips occur is in the last two flips. This is harder to write down a formula for.
    – Mike Earnest
    Aug 15 at 13:28










  • Am I understanding the problem correctly? In the below sequence of flips, is $T=10$? $$ W,B,W,W,B,W,B,W,B,B $$
    – Mike Earnest
    Aug 15 at 14:09
















  • You have computed the probabilities for a different random variable, $T’$, which is the number of tosses it takes to get two black colors (not necessarily in a row).
    – Mike Earnest
    Aug 15 at 12:26










  • I just edited my post. if u can please help.
    – Tomer Levy
    Aug 15 at 13:23










  • Your expression for $P(T=k)$ is incorrect. $(k-1)(1-p)^k-1p^2$ is the probability that the first $k$ flips will contain exactly two blacks, with the second occurring at flip $k$. What you instead want to calculate is the probability that the first $k$ flips contain any number of black flips, as long as the only place where two consecutive black flips occur is in the last two flips. This is harder to write down a formula for.
    – Mike Earnest
    Aug 15 at 13:28










  • Am I understanding the problem correctly? In the below sequence of flips, is $T=10$? $$ W,B,W,W,B,W,B,W,B,B $$
    – Mike Earnest
    Aug 15 at 14:09















You have computed the probabilities for a different random variable, $T’$, which is the number of tosses it takes to get two black colors (not necessarily in a row).
– Mike Earnest
Aug 15 at 12:26




You have computed the probabilities for a different random variable, $T’$, which is the number of tosses it takes to get two black colors (not necessarily in a row).
– Mike Earnest
Aug 15 at 12:26












I just edited my post. if u can please help.
– Tomer Levy
Aug 15 at 13:23




I just edited my post. if u can please help.
– Tomer Levy
Aug 15 at 13:23












Your expression for $P(T=k)$ is incorrect. $(k-1)(1-p)^k-1p^2$ is the probability that the first $k$ flips will contain exactly two blacks, with the second occurring at flip $k$. What you instead want to calculate is the probability that the first $k$ flips contain any number of black flips, as long as the only place where two consecutive black flips occur is in the last two flips. This is harder to write down a formula for.
– Mike Earnest
Aug 15 at 13:28




Your expression for $P(T=k)$ is incorrect. $(k-1)(1-p)^k-1p^2$ is the probability that the first $k$ flips will contain exactly two blacks, with the second occurring at flip $k$. What you instead want to calculate is the probability that the first $k$ flips contain any number of black flips, as long as the only place where two consecutive black flips occur is in the last two flips. This is harder to write down a formula for.
– Mike Earnest
Aug 15 at 13:28












Am I understanding the problem correctly? In the below sequence of flips, is $T=10$? $$ W,B,W,W,B,W,B,W,B,B $$
– Mike Earnest
Aug 15 at 14:09




Am I understanding the problem correctly? In the below sequence of flips, is $T=10$? $$ W,B,W,W,B,W,B,W,B,B $$
– Mike Earnest
Aug 15 at 14:09










1 Answer
1






active

oldest

votes

















up vote
0
down vote













Let $a_k=P(T=k)$. You can show that
$$
a_k =(1-p)a_k-1+p(1-p)a_k-2,qquad k>2
$$
Why? There are two ways to have a sequence of $k>2$ coin flips whose first occurrence of $BB$ is at flips $k-1$ and $k$. Either you start with a white flip $W$, and then follow it up with a sequence which gets its first $BB$ at flips $k-2$ and $k-1$, or you start with $BW$ and get a sequence of $k-2$ flips ending in $BB$. You cannot start with $BB$, since that would imply $T=2$, and we are assuming $k>2$.



Combined with the base cases $a_1=0$, $a_2=p^2$, the above is a linear recurrence which can be solved using the methods in this article.






share|cite|improve this answer




















  • so i tried to solve this linear recurrence, but i am getting solutions with roots in the process to solve this recurrence ( i also tried to use a variable to avoid roots, but no luck) and other stuff that are very not easy to solve. i really don't think my professor aimed for this solution. maybe there is another way you have in mind?
    – Tomer Levy
    Aug 16 at 7:17










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',
convertImagesToLinks: true,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);








 

draft saved


draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2883523%2fprobability-question-help-statistics-distribution-geometric-distribution-and%23new-answer', 'question_page');

);

Post as a guest






























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
0
down vote













Let $a_k=P(T=k)$. You can show that
$$
a_k =(1-p)a_k-1+p(1-p)a_k-2,qquad k>2
$$
Why? There are two ways to have a sequence of $k>2$ coin flips whose first occurrence of $BB$ is at flips $k-1$ and $k$. Either you start with a white flip $W$, and then follow it up with a sequence which gets its first $BB$ at flips $k-2$ and $k-1$, or you start with $BW$ and get a sequence of $k-2$ flips ending in $BB$. You cannot start with $BB$, since that would imply $T=2$, and we are assuming $k>2$.



Combined with the base cases $a_1=0$, $a_2=p^2$, the above is a linear recurrence which can be solved using the methods in this article.






share|cite|improve this answer




















  • so i tried to solve this linear recurrence, but i am getting solutions with roots in the process to solve this recurrence ( i also tried to use a variable to avoid roots, but no luck) and other stuff that are very not easy to solve. i really don't think my professor aimed for this solution. maybe there is another way you have in mind?
    – Tomer Levy
    Aug 16 at 7:17














up vote
0
down vote













Let $a_k=P(T=k)$. You can show that
$$
a_k =(1-p)a_k-1+p(1-p)a_k-2,qquad k>2
$$
Why? There are two ways to have a sequence of $k>2$ coin flips whose first occurrence of $BB$ is at flips $k-1$ and $k$. Either you start with a white flip $W$, and then follow it up with a sequence which gets its first $BB$ at flips $k-2$ and $k-1$, or you start with $BW$ and get a sequence of $k-2$ flips ending in $BB$. You cannot start with $BB$, since that would imply $T=2$, and we are assuming $k>2$.



Combined with the base cases $a_1=0$, $a_2=p^2$, the above is a linear recurrence which can be solved using the methods in this article.






share|cite|improve this answer




















  • so i tried to solve this linear recurrence, but i am getting solutions with roots in the process to solve this recurrence ( i also tried to use a variable to avoid roots, but no luck) and other stuff that are very not easy to solve. i really don't think my professor aimed for this solution. maybe there is another way you have in mind?
    – Tomer Levy
    Aug 16 at 7:17












up vote
0
down vote










up vote
0
down vote









Let $a_k=P(T=k)$. You can show that
$$
a_k =(1-p)a_k-1+p(1-p)a_k-2,qquad k>2
$$
Why? There are two ways to have a sequence of $k>2$ coin flips whose first occurrence of $BB$ is at flips $k-1$ and $k$. Either you start with a white flip $W$, and then follow it up with a sequence which gets its first $BB$ at flips $k-2$ and $k-1$, or you start with $BW$ and get a sequence of $k-2$ flips ending in $BB$. You cannot start with $BB$, since that would imply $T=2$, and we are assuming $k>2$.



Combined with the base cases $a_1=0$, $a_2=p^2$, the above is a linear recurrence which can be solved using the methods in this article.






share|cite|improve this answer












Let $a_k=P(T=k)$. You can show that
$$
a_k =(1-p)a_k-1+p(1-p)a_k-2,qquad k>2
$$
Why? There are two ways to have a sequence of $k>2$ coin flips whose first occurrence of $BB$ is at flips $k-1$ and $k$. Either you start with a white flip $W$, and then follow it up with a sequence which gets its first $BB$ at flips $k-2$ and $k-1$, or you start with $BW$ and get a sequence of $k-2$ flips ending in $BB$. You cannot start with $BB$, since that would imply $T=2$, and we are assuming $k>2$.



Combined with the base cases $a_1=0$, $a_2=p^2$, the above is a linear recurrence which can be solved using the methods in this article.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Aug 15 at 18:04









Mike Earnest

16.3k11648




16.3k11648











  • so i tried to solve this linear recurrence, but i am getting solutions with roots in the process to solve this recurrence ( i also tried to use a variable to avoid roots, but no luck) and other stuff that are very not easy to solve. i really don't think my professor aimed for this solution. maybe there is another way you have in mind?
    – Tomer Levy
    Aug 16 at 7:17
















  • so i tried to solve this linear recurrence, but i am getting solutions with roots in the process to solve this recurrence ( i also tried to use a variable to avoid roots, but no luck) and other stuff that are very not easy to solve. i really don't think my professor aimed for this solution. maybe there is another way you have in mind?
    – Tomer Levy
    Aug 16 at 7:17















so i tried to solve this linear recurrence, but i am getting solutions with roots in the process to solve this recurrence ( i also tried to use a variable to avoid roots, but no luck) and other stuff that are very not easy to solve. i really don't think my professor aimed for this solution. maybe there is another way you have in mind?
– Tomer Levy
Aug 16 at 7:17




so i tried to solve this linear recurrence, but i am getting solutions with roots in the process to solve this recurrence ( i also tried to use a variable to avoid roots, but no luck) and other stuff that are very not easy to solve. i really don't think my professor aimed for this solution. maybe there is another way you have in mind?
– Tomer Levy
Aug 16 at 7:17












 

draft saved


draft discarded


























 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2883523%2fprobability-question-help-statistics-distribution-geometric-distribution-and%23new-answer', 'question_page');

);

Post as a guest













































































這個網誌中的熱門文章

How to combine Bézier curves to a surface?

Propositional logic and tautologies

Distribution of Stopped Wiener Process with Stochastic Volatility