**Problem:** \(x\) red balls, \(y\) black balls,\(z\) white balls are to be arranged in a row. Suppose that any two balls of the same color are indistinguishable. Given \(x+y+z=30\) prove that number of possible arrangements is maximum when \(x=y=z=10\).

**Solution:** Given a total of \(n\) objects out of which \(r\) are of the same type, total number of arrangements possible is given by \(\frac{n!}{r!}\). Therefore in this case the total number of arrangements is \(\frac{30!}{x!y!z!}\).

Now we have to maximise \(\frac{30!}{x!y!z!}\).

Thus we need to minimise \({x!y!z!}\). As the question claims that all have to be equal to \(10\), let us consider that they are not all equal to \(10\). So the cases that arise are:

**Case 1:** \(x>10\) , \(y=10\), \(z<10\)

OR

**Case 2: **\(x>10\), \(y>10\), \(z<10\)

OR

**Case 3:** \(x>10\), \(y<10\), \(z<10\)

These cases are considered without any loss of generality as any other possible case will just be another permutation of the given cases.

So as the question claims the ideal condition is \(x!y!z!=(10!)^3\).

Now considering Case 1, as \(x+y+z=30\), \(x!y!z!=(10+a)!(10)!(10-a)!\) = \((10!)^3\frac{(10+1)(10+2)\cdots(10+a)}{(10-1)(10-2)\cdots(10-a)}> (10!)^3\). So this is not a possible option as we have to minimise \(x!y!z!\).

Now taking Case 2, \(x!y!z!=(10+a)!(10+b)!(10-a-b)!\) = \((10!)^3\frac{[(10+1)(10+2)\cdots(10+a)][(10+1)(10+2)\cdots(10+b)]}{(10-1)(10-2)\cdots(10-a-b)}> (10!)^3\). So again not a possibility.

Similarly it can be shown for Case 3 also, thus proving that any other value of \(x,y\) and \(z\) does not minimise \(x!y!z!\).

Hence \(x=y=z=10\) is the solution that maximises the number of possible arrangements.

## No comments, be the first one to comment !