Hi,

Im trying to do a bit of theory using a 1 dimensional random walk. Im trying to count the number of paths on Pascals triangle to a node, if I eliminate some of the paths (stop loss). I know without restrictions its n!/(n-r)!r! but I cant workout the formula with resrictions on the number of paths. Im basically trying to work out the probability of getting to a node...

any ideas appreciated

thanks

Im trying to do a bit of theory using a 1 dimensional random walk. Im trying to count the number of paths on Pascals triangle to a node, if I eliminate some of the paths (stop loss). I know without restrictions its n!/(n-r)!r! but I cant workout the formula with resrictions on the number of paths. Im basically trying to work out the probability of getting to a node...

any ideas appreciated

thanks