On Sun, May 30, 2021, 5:37 PM Karl <[1]gmkarl@gmail.com> wrote: Okay. Permutations with replacement are indeed just n^r which I have in my mind already a little bit. So if we have a popbinheight bin we were only picking from, in a set of ordered decisions, what are we doing? In the first decision, we can pick from popbinheight options. Same in the rest. The total number of outcomes is then each subset of outcomes, for each excluded one. That's popbinheight^sampbinheight, permutations with replacement, I think. (popcount - popbinheight) ^ (sampcount - sampbinheight) So, we might have a big exponent, times combinations, times a small exponent. The needed scale factors appear to all be present, which is heartening. Is the combinations still looking ok, now that the system is describsd differently? What is the whole expression? Remember to simulate to find more mistakes. References 1. mailto:gmkarl@gmail.com