Choosing n numbers with fixed sum

by

You are looking to partition the distance from 0 to 1.

Choose n – 1 numbers from 0 to 1, sort them and determine the distances between each of them.

This will partition the space 0 to 1, which should yield the occasional large result which you aren’t getting.

Even so, for large values of n, you can generally expect your max value to decrease as well, just not as quickly as your method.

More Related Contents:

  1. Select k random elements from a list whose elements have weights
  2. Unique (non-repeating) random numbers in O(1)?
  3. What distribution do you get from this broken random shuffle?
  4. Data structures for loaded dice?
  5. Fastest primality test
  6. Unbiased random number generator using a biased one
  7. How to determine if a point is in a 2D triangle? [closed]
  8. Generate a random point within a circle (uniformly)
  9. Algorithm to find Largest prime factor of a number
  10. How to make rounded percentages add up to 100%
  11. Writing your own square root function
  12. Finding out nth fibonacci number for very large ‘n’
  13. Shuffle list, ensuring that no item remains in same position
  14. Why does this simple shuffle algorithm produce biased results?
  15. Floating Point Divider Hardware Implementation Details
  16. Probability of collision when using a 32 bit hash
  17. Unsupervised clustering with unknown number of clusters
  18. Circle-circle intersection points
  19. How to incrementally sample without replacement?
  20. How do I find a factorial? [closed]
  21. Creating a random number generator from a coin toss
  22. Given a number, produce another random number that is the same every time and distinct from all other results
  23. Calculating the position of points in a circle
  24. Strategies for simplifying math expressions
  25. How to express tetration function, for complex numbers
  26. How to check if an integer is a power of 3?
  27. Reservoir sampling
  28. A Good and SIMPLE Measure of Randomness
  29. Optimized low-accuracy approximation to `rootn(x, n)`
  30. What are probabilistic data structures?

Leave a Comment