Welcome to Incels.is - Involuntary Celibate Forum

Welcome! This is a forum for involuntary celibates: people who lack a significant other. Are you lonely and wish you had someone in your life? You're not alone! Join our forum and talk to people just like you.

SuicideFuel Problem

trying to ascend

trying to ascend

Oldcel KHHV
★★★★★
Joined
Aug 30, 2020
Posts
15,961
[UWSL]A boy in the city of Good Jesus of Pirapora throws a coin. He will walk 1m east if the result is heads or 1m west if the result is tails. The probability that this boy is 5 m away from his starting position after 9 tosses of the coin is[/UWSL]

[UWSL][/UWSL]
 
what type of questions is this btw
 
28996 1
 
Well I could write a program that analyzes the distance for all possibilities and then have it divide the number of instances where the distance was 5 by the total number of 2^9. But that would be too much work. Let's then look at the problem more carefully. First notice that the order of the coins doesn’t matter, so the sequence HTTTTHHHT will yield the same results as the sequence HHHHTTTTT.

Let’s then calculate the chances that he is 5 meters to the west after 9 tosses. This means that his sequence will require 7 Ts and 2 Hs, any sequence like this would do, so how many are there? This is a typical combinatorics problems so we know the answer is 9!/(7!2!) = 9*4. Multiply that by 2 and then divide by the total number of possibilities = (9*8)/(2^9) = 9/(2^6) = 9/64.​
 

Similar threads

TuxedoMask
Replies
3
Views
216
Ixio
Ixio
cinderogre
Replies
14
Views
945
cinderogre
cinderogre
NorthernWind
Replies
1
Views
127
latinocelhispanicel
latinocelhispanicel
OfficERcel
Replies
23
Views
589
NeverGetUp36
NeverGetUp36

Users who are viewing this thread

shape1
shape2
shape3
shape4
shape5
shape6
Back
Top