I am trying to solve the following problem:

Suppose that you are given $M$ indistinct bins and $L$ indistinct balls where $L \geq M(M-1)/2$. In how many ways can we distribute the balls into the bins with the following constraints:

  1. The capacity of each bin is maximum $K$, where $K \geq M$.
  2. Number of balls in each bin is unique, i.e. no two bins have the same number of balls in them. We cannot even have two bins with $0$ balls in them.

We can assume that $L \leq M(2K-M+1)/2$ ($K$ balls in bin $1$, $K-1$ balls in bin $2$, $...$ , $K-M+1$ ball in bin $M$). This condition makes sure that there are enough bins to fit all the balls in.

  • $\begingroup$ Are the bins indistinct? $\endgroup$ – Jaroslaw Matlak Jul 10 '17 at 8:36
  • 1
    $\begingroup$ hi froggy and welcome. it seems you already know mathjax typesetting which is good. please also show any own attempts you have had at the problems. $\endgroup$ – mathreadler Jul 10 '17 at 8:36
  • $\begingroup$ @JaroslawMatlak, yes they are indistinct. I just edited the post. $\endgroup$ – user2262793 Jul 10 '17 at 8:51

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.