[PATCH 3 of 3] test-pathencode: randomize length of each path component

Giovanni Gherdovich g.gherdovich at gmail.com
Thu Jun 20 20:02:56 CDT 2013

2013/6/20 Siddharth Agarwal <sid0 at fb.com>
> the likelihood that one sees a number k
> (1 <= k <= n) is 1/n * (\sum_{k=i}^n 1/i).

shouldn't this be "1/n * (\sum_{i=k}^n 1/i)" ?

I switched k and i inside the { }

I didn't check the math, just basing on what makes sense in plain english
(the sum must be a function of k) and i must be a "free variable".

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://selenic.com/pipermail/mercurial-devel/attachments/20130621/ed30f4cd/attachment.html>

More information about the Mercurial-devel mailing list