after toying with this for a while I think i've got it.

the probability it takes [tex]n[/tex] uniform[0,1] addends to sum to greater than 1 is given by

[tex]\Large \displaystyle \int_0^1 \int_0^{1-x_1}\int_0^{1-x_1-x_2} \dots \int_0^{1-\sum \limits_{k=1}^{n-2}x_k}\int_{1-\sum \limits_{k=1}^{n-1}~x_k}^1~1~dx_n~dx_{n-1}~\dots dx_2~dx_1[/tex]

This generates numbers in agreement with what I saw in the sim.

This is the integral over the probability mass where the first (n-1) variables sum to less than one but the sum over all n sums to greater than 1.

[tex]p[2]=\dfrac 1 2\\p[3]=\dfrac 1 3\\p[4] = \dfrac 1 8\\p[5]=\dfrac{1}{144} \\ p[k] = \dfrac{1}{k!+(k-1)!}[/tex]

[tex]E[k]=e[/tex]

## Bookmarks