How can I prove that $\binom{3n}{n,n,n}$ divided by $6$ with no remainder for all $n>0$? How can I prove that  $\binom{3n}{n,n,n}$ divided by $6$ with no remainder for all $n>0$?


If you have $3$ numbered buckets, and $3n$ items, then there are $\binom{3n}{n,n,n}$ ways to put $n$ in each bucket.The buckets are identical apart from the fact that we've numbered them. If someone had secretly switched their labels around, there would still be $\binom{3n}{n,n,n}$ ways to have $n$ in each.If we remove the labels from the buckets however, we now consider any permutation of the buckets to be identical. Each of those 3! permutations has the same number of arrangements for the balls, and we know the total number of those arrangements is $\binom{3n}{n,n,n}$.Therefore, the number of ways to arrange $3n$ balls in $3$ identical buckets with $n$ balls each is $\binom{3n}{n,n,n}/3!$, and this must obviously therefore be an integer.

