Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
65 views
in Mathematics by (69.0k points)
closed by
The set `S""=""{1,""2,""3,"" ,""12)` is to be partitioned into three sets A, B, C of equal size. Thus, `AuuBuuC""=""S ,""AnnB""=""BnnC""=""AnnC""=varphi` . The number of ways to partition S is (1) `(12 !)/(3!(4!)^3)` (2) `(12 !)/(3!(3!)^4)` (3) `(12 !)/((4!)^3)` (4) `(12 !)/((4!)^4)`
A. `(12!)/((4!)^(3))`
B. `(12!)/((3!)^(4))`
C. `(12!)/(3!(4!)^(3))`
D. `(12!)/(3!(3!)^(4))`

1 Answer

0 votes
by (67.8k points)
selected by
 
Best answer
The number of ways of partitioning S into three disjoint sets is same as the number of ways of distributing 12 distinct items to three persons each getting same number of items.
`:.` Required number of ways `=""^(12)C_(4)xx""^(8)C_(4)xx""^(4)C_(4)=(12!)/((4!)^(3))`

Related questions

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...