53 views
In how many different ways can a set of 3n elements be partitioned into 3 subsets of equal number of elements?

Isn't this case of distributing distinguishable objects and distinguishable boxes, so the answer should be $(3n)! / ((n!)^3 )$.

But answer given is $(3n)! / (6*(n!)^3)$

Can anybody explain? Or post a link where to study all concepts of permutation and combination and counting
+1

We also divide with the   ( no of repetition)!

n! Repeats 3 times here
0
I cant understand, can you please elaborate?
+1

@bts1jimin

Suppose we 3 element in identical boxes, so that each box contain 1 element. How many ways we can do it? Only 1 way

right?

Similar this question too

0
Okk..so the boxes are indistinguishable, that is why we are dividing with 6?
+1
yes

1
2