Find probability of event “during the tossing of a symmetrical coin a series of three tails didn't...
up vote
0
down vote
favorite
Let $a_n$ be probability of event "during n tossings of a symmetrical coin a series of three tails didn't appear". Find $a_n$ for n=1,...,12.$$$$
I know, here I need to apply recursive equations. But I don't understand how.
probability
asked Nov 14 at 15:12
Emerald
254
add a comment |
up vote
0
down vote
favorite
Let $a_n$ be probability of event "during n tossings of a symmetrical coin a series of three tails didn't appear". Find $a_n$ for n=1,...,12.$$$$
I know, here I need to apply recursive equations. But I don't understand how.
probability
asked Nov 14 at 15:12
Emerald
254
to count the binary strings of length $n$ without a $TTT$ note that, for $n>2$, such a string must end in one of $H, HT,HTT$.
– lulu
Nov 14 at 15:14
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Let $a_n$ be probability of event "during n tossings of a symmetrical coin a series of three tails didn't appear". Find $a_n$ for n=1,...,12.$$$$
I know, here I need to apply recursive equations. But I don't understand how.
probability
asked Nov 14 at 15:12
Emerald
254
Let $a_n$ be probability of event "during n tossings of a symmetrical coin a series of three tails didn't appear". Find $a_n$ for n=1,...,12.$$$$
I know, here I need to apply recursive equations. But I don't understand how.
probability
probability
asked Nov 14 at 15:12
Emerald
254
asked Nov 14 at 15:12
Emerald
254
edited Nov 14 at 15:15
asked Nov 14 at 15:12
Emerald
254
asked Nov 14 at 15:12
Emerald
254
asked Nov 14 at 15:12
Emerald
254
254
to count the binary strings of length $n$ without a $TTT$ note that, for $n>2$, such a string must end in one of $H, HT,HTT$.
– lulu
Nov 14 at 15:14
add a comment |
to count the binary strings of length $n$ without a $TTT$ note that, for $n>2$, such a string must end in one of $H, HT,HTT$.
– lulu
Nov 14 at 15:14
to count the binary strings of length $n$ without a $TTT$ note that, for $n>2$, such a string must end in one of $H, HT,HTT$.
– lulu
Nov 14 at 15:14
to count the binary strings of length $n$ without a $TTT$ note that, for $n>2$, such a string must end in one of $H, HT,HTT$.
– lulu
Nov 14 at 15:14
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f2998375%2ffind-probability-of-event-during-the-tossing-of-a-symmetrical-coin-a-series-of%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
to count the binary strings of length $n$ without a $TTT$ note that, for $n>2$, such a string must end in one of $H, HT,HTT$.
– lulu
Nov 14 at 15:14