Is it possible this was meant to be 15^n (because a rhombic dodecahedron has 14 faces)?

]]>1. divide their sum of squares S by a random uniform(0,1);

2. subtract S; result is T;

3. generate a random unit-length 2-vector then rescale to length sqrt(T).

This is a way to generate two new i.i.d. gaussian randoms from two old ones, plus two uniform

randoms. The algorithm (1+2+3) clearly is more efficient than Box-Muller in the sense no logs are needed. Only divisions and square roots are needed. ]]>