I am in need of a more generalized solution to this problem.
I have a random number generator that generates numbers from 0 to 1. Using this, I want to find $r$ numbers that add to $n$. How do I do this efficiently, and such that the numbers are uniformly distributed?
For my specific case, I need to be able to generate $6$ numbers that add up to $2\pi$.
Edit: I have thought of possibly using the same method in the other question, but multiplying the final set of numbers by $2\pi$. Would this be uniformly distributed? And if so, how can that be proved (That's just for curiosity's sake though)?