Maybe somebody who knows more math than I do (like you, probably!) can come up with something more clever.
I can certainly suggest other formula, but that does not mean beautiful code, thus would probably be rejected. I'll see.
An alternative to this whole process may be to hash/modulo a non uniform random value.
id = 1 + hash(some-random()) % n
But the hashing changes the distribution as it adds collisions, so I have to think about how to be able to control the distribution in that case, and what hash function to use.
I think that we have to consider and select reproducible method, because benchmark is always needed robust and reproducible result. And if we realize this idea, we might need more accurate random generator that is like Mersenne twister algorithm. erand48 algorithm is slow and not accurate very much.
By the way, I don't know relativeness of this topic and command line option... Well whatever...
