The Gateway to Computer Science Excellence
+2 votes
84 views
In how many different ways can a set A of 3n elements be partitioned into 3 subsets of equal number of elements?

My approach :

The number of permutations of n  objects with n1 identical objects of type 1,  n2 identical objects of type 2, , and n3 identical objects of type  is  n!/n1!n2!n3!

Here ans could be (3n)!/(n!)^3

but given is  3n)!/6* (n!)^3

How did again 6 come in denominator , why is he arranging again in 6 i..e., 3! ways ??
in Mathematical Logic by Active (1.3k points) | 84 views

1 Answer

+1 vote
Best answer

total elements in group  = 3n  , it has to be partitioned / divided  into 3 equal subsets /group
let eeach of three group contains n elements  all of equal sizes
so according to division formula  it will be   $\frac{(3n!)}{(n!)^3 (3!)}$

6 = 3!  came due to power of   n! which is 3

by Boss (10.5k points)
selected by
0
n!/n1!n2!n3! why no 3! ??

n1n2n3 can be arrranged in 3! ways ryt ??
+1

If question would   have been :  how many different ways can a set A of 3n elements be partitioned into 3 subsets of unequal number of elements  

then it will be $\frac{(3n!)}{(n!)^{3}}$

since groups  are not of same size 

your doubt :  n!/n1!n2!n3! why no 3! ??

n1n2n3 can be arrranged in 3! ways ryt ??

no need of doing it in question he is not  asking for permutations , only this is we have  3 equal groups  and we have to divide it  

Thank you !!

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,644 questions
56,503 answers
195,553 comments
101,036 users