Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on A shuffled deck of cards is unique in all human history. Parent comment
Mathematica overflowed when I tried to compute this by brute force. The next best thing I can think of is to use the exponential approximation
1 - x ≈ e^{-x},
\prod_{i = 1}^n (1 - (i - 1)/52!) ≈ \prod_{i = 1}^n e^{-(i - 1)/52!} = e^{-n(n - 1)/52!} ≈ 1 - n(n - 1)/52!.
\frac1 2\sum_{i = 1}^n [(i - 1)/52!]^2 ≈ n^3/(2(52!)^2),
There are no comments on this comment yet.
Mathematica overflowed when I tried to compute this by brute force. The next best thing I can think of is to use the exponential approximation
good for very small `x`, such as ours. Ignoring the cascading errors gives The error should be roughly of the size which is relatively small. (That's stronger, here, than just saying that it is small.) That is to say: I guess I agree with jgershen after all!