If there are m steps up and n steps down

the chance of reaching top before reaching bottom is n/(m+n).

所有跟帖： 

• Cool, then we are done! -Commentate- ♂ (0 bytes) () 07/17/2009 postreply 11:24:38

• What about the chance of staying on the ladder? -dayuwang- ♂ (0 bytes) () 07/17/2009 postreply 12:29:09

• 0... if one keeps walking. -屋漏痕- ♂ (0 bytes) () 07/17/2009 postreply 12:50:45

• 回複：What about the chance of staying on the ladder? -crazy_math- ♂ (133 bytes) () 08/07/2009 postreply 02:22:02