Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
combinatorics
15 views
Skip to first unread message
Norman B. Grover
Jul 24, 2012, 4:24:00 AM7/24/12
to
I posted the following in 'alt.sci.math.probability' but got no replies,
so I decided to try here. My apologies for multiposting.
How many ways can b indistinguishable balls be placed in a rectangular
array of r (r>b>2c) rows and c columns such that no row is completely full?
If that cannot be solved in general, what about the special case where c=
3?
Any help, hint, reference (solution?) would be greatly appreciated.
--
Norman B. Grover
Jerusalem, Israel
so I decided to try here. My apologies for multiposting.
How many ways can b indistinguishable balls be placed in a rectangular
array of r (r>b>2c) rows and c columns such that no row is completely full?
If that cannot be solved in general, what about the special case where c=
3?
Any help, hint, reference (solution?) would be greatly appreciated.
--
Norman B. Grover
Jerusalem, Israel
0 new messages