Consider dividing integer weights by their GCD

[peteroupc]

While writing a code generator based on the Fast Loaded Dice Roller, I've noticed that two equivalent sets of integer weights (where one is an integer multiple of the other) can have a different table size. For example:

• One weight set, 1, 9, 6, turns into a 4x5 table by the Fast Loaded Dice Roller.
• However, an equivalent weight set, 1000, 9000, 6000, turns into a 14x5 table this way.

This shows that it might be helpful in some cases to divide the weights by their greatest common divisor (ignoring zero weights) to achieve an equivalent weight set that minimizes table sizes.

[fsaad]

Great point: we can also save entropy, since the FLDR "entropy gap" generally gets worse with increasing sum of integers m.