The set $S = \left\{ {1,2,3, \ldots ,12} \right\}$ is to be partitioned into three sets $A,\,B,\, C$ of equal size . Thus $A \cup B \cup C = S$ અને $A \cap B = B \cap C = C \cap A = \emptyset $ . The number of ways to partition $S$ is

  • [AIEEE 2007]
  • A

    $\frac{{12!}}{{{{\left( {4!} \right)}^3}}}$

  • B

    $\;\frac{{12!}}{{{{\left( {4!} \right)}^4}}}$

  • C

    $\;\frac{{12!}}{{3!{{\left( {4!} \right)}^3}}}$

  • D

    $\;\frac{{12!}}{{3!{{\left( {4!} \right)}^4}}}$

Similar Questions

The number of ways in which $21$ identical apples can be distributed among three children such that each child gets at least $2$ apples, is

  • [JEE MAIN 2024]

In an election there are $8$ candidates, out of which $5$ are to be choosen. If a voter may vote for any number of candidates but not greater than the number to be choosen, then in how many ways can a voter vote

Find the number of ways of selecting $9$ balls from $6$ red balls, $5$ white balls and $5$ blue balls if each selection consists of $3$ balls of each colour.

The number of words (with or without meaning) that can be formed from all the letters of the word $"LETTER"$ in which vowels never come together is

  • [JEE MAIN 2020]

An urn contains $5$ red marbles, $4$ black marbles and $3$ white marbles. Then the number of ways in which $4$ marbles can be drawn so that at the most three of them are red is

  • [JEE MAIN 2020]