- #36
KLscilevothma
- 322
- 0
Originally posted by Hurkyl
Eep, I don't know if I want to work on this one; I don't have any good ideas for the next question!
Do you mind if you answer oxy's question and I post the other question ?
Originally posted by Hurkyl
Eep, I don't know if I want to work on this one; I don't have any good ideas for the next question!
There is a finite state space and from any intermediate state, the endstate is reachable in n turns with some fixed nonzero probability for some values of n, so by the law of large numbers, the end state is reached with probability 1.
Now, an interesting question is what is the probability the player with x pennies beats the player with y pennies...
Originally posted by bogdan
For that triangle problem...KL_KAM...
I suppose that 2*AP=PB...
http://www.angelfire.com/pro/fbi/images/trio.bmp
Sorry for the delay...
Because the link above may not work...
Here is the solution:
Take on AC a segment CE=2*AC on the opposite side to A...then let F be the intersection between PE and BC...now S(ACFP)=S(PBE)...good enough ?
I have infact found a method for proving the probability question using matrices and vectors, no recursivity. So I will be able to prove whether your answer is correct or not .Originally posted by bogdan
Aaaa...and for that probability problem...the first on the 3rd page...with x and y pennies...
P(x)=x/(x+y)...P(x)->the probability that the player with x pennies wins...
P(y)=y/(x+y)...P(y)->...
Proof ? Somesort of recursivity...too long to be written here...
construct a line through p cutting triangle ABC into 2 parts with equal areas