document.write( "Question 1143348: How many ways are there to put 6 balls in 3 boxes if the balls are not distinguishable but the boxes are? \n" ); document.write( "

Algebra.Com's Answer #764156 by math_helper(2461) $\"\"$ $\"About$

You can put this solution on YOUR website!
For b indistinguishable balls into k distinct boxes, with no other restrictions (such as one or more balls per box) is:
\r
\n" ); document.write( "\n" ); document.write( "C(k+b-1, b)
\n" ); document.write( "

\n" ); document.write( "where C(n,r) = n!/((n-r)!r!)
\n" ); document.write( " \n" ); document.write( "

\n" );