The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
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
asked in Mathematical Logic by (245 points) | 53 views
+1
Yeah answer given is right

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

Please log in or register to answer this question.

Related questions

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
48,720 questions
52,807 answers
183,452 comments
68,471 users