Some time ago, thread 12870817 (speaking of the
dead...) had an interesting combinatorics problem
that was being solved. Nothing came of it after
one attempted, but wrong, formula. This was
the problem rewritten in a general format:
>In a mixed pile of C different types there are N_i distinct elements for each type with i=1,...C. If these elements are distributed among k containers on the condition: 1) each container has at least one element of each type and 2) each container has the same amount of elements, how many ways at once can the elements be distributed over k containers?
I managed to solve it for the 1 type, k container
case which will follow from here. Generalizing
up to C types appears to involve partitioning
in the containers of each type represented
which I'm still figuring out by brute force.
At least, that's how I found the 1 type,
k container case.
What do you think?
dead...) had an interesting combinatorics problem
that was being solved. Nothing came of it after
one attempted, but wrong, formula. This was
the problem rewritten in a general format:
>In a mixed pile of C different types there are N_i distinct elements for each type with i=1,...C. If these elements are distributed among k containers on the condition: 1) each container has at least one element of each type and 2) each container has the same amount of elements, how many ways at once can the elements be distributed over k containers?
I managed to solve it for the 1 type, k container
case which will follow from here. Generalizing
up to C types appears to involve partitioning
in the containers of each type represented
which I'm still figuring out by brute force.
At least, that's how I found the 1 type,
k container case.
What do you think?
