Ask your own question, for FREE!
Mathematics 26 Online
OpenStudy (anonymous):

A fair coin is tossed twice, the sample space is {HH, HT, TH, TT}, how can we calculate the number of combinations by using the formula n!/(n-k)!k! ??????

OpenStudy (experimentx):

number of combination of ???

OpenStudy (anonymous):

how to calculate the number of combinations of head & tail

OpenStudy (experimentx):

like??

OpenStudy (anonymous):

@experimentX acc' I am trying to know that how exactly we use this formula in such problem

OpenStudy (experimentx):

to determine the sample space??

OpenStudy (anonymous):

yes but not by using

OpenStudy (anonymous):

the power set

OpenStudy (anonymous):

at http://www-math.mit.edu/phase2/UJM/vol1/RMONTE-F.PDF the binomial coefficient starts after sample space but I don't understand it's relation with the given sample space

OpenStudy (experimentx):

i guess \[ \sum_{i=0}^{n} \binom{n}{i}\]

OpenStudy (experimentx):

\( \large \binom{n}{i}\) gives the number of particular combination. like {HT}, {TH} they both are combination of H and T

OpenStudy (anonymous):

@experimentX can you please tell me that what does it mean by Note that n and x must have the same parity because n-x = 2l.

OpenStudy (anonymous):

it's in the link that I mentioned above

OpenStudy (experimentx):

i mean in which page in which line??

OpenStudy (anonymous):

on the second page (marked as 111) the last paragraph, start with "Now, there are"

OpenStudy (anonymous):

what does mean by the parity? does it mean as the equality in amount if yes then 2l = 0

OpenStudy (anonymous):

also what does mean by the x = n mod 2 in the first formula of 3rd page it comes after the paragraph that I mentioned above

OpenStudy (experimentx):

looks like i have to look from the beginning ... it will take a bit more time!!

OpenStudy (anonymous):

OK, it will be really great if you help me in understanding this concept

OpenStudy (experimentx):

it would be great if i understand if i understand these concepts myself

OpenStudy (experimentx):

I don't know that parity means ... the second formula relates let 'q' be probability of left and 'p' be of right to arrive at a point, you take l left steps and r right steps, C(n,l) is the no of ways you can choose ,,, left and right steps out of total .. so \( C(n,l) p^rq^l; \) gives you the probability to arrive at a particular step

OpenStudy (experimentx):

if you take one step, you will never arrive at the place point ... similar if you take two step ... you will never be at the adjacent place x = n mod 2 is the condition for that probability, check out that table!!

OpenStudy (anonymous):

thanks

OpenStudy (anonymous):

@ 4. Taking a Step Further (3rd page) it says first return, what does it mean?

OpenStudy (experimentx):

Looks like this got something to do with Catalan numbers ... i have known them but i am encountering catalan numbers for the first time

OpenStudy (experimentx):

that means ... the drunk returns to the first step at 2n the step

OpenStudy (experimentx):

gotta sleep .... interesting concept though!!

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!