AIEEE 2007 | Permutations and Combinations Question 166 | Mathematics

The set S = {1, 2, 3, ........., 12} 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 = A \cap C = \phi $$. The number of ways to partition S is

$${{12!} \over {{{(4!)}^3}}}\,\,$$

$${{12!} \over {{{(4!)}^4}}}\,\,$$

$${{12!} \over {3!\,\,{{(4!)}^3}}}$$

$${{12!} \over {3!\,\,{{(4!)}^4}}}$$

AIEEE 2006

MCQ (Single Correct Answer)

-1

At an election, a voter may vote for any number of candidates, not greater than the number to be elected. There are 10 candidates and 4 are of be selected, if a voter votes for at least one candidate, then the number of ways in which he can vote is

5040

6210

385

1110

AIEEE 2005

MCQ (Single Correct Answer)

-1

If the letter of the word SACHIN are arranged in all possible ways and these words are written out as in dictionary, then the word SACHIN appears at serial number

601

600

603

602

AIEEE 2004

MCQ (Single Correct Answer)

-1

How many ways are there to arrange the letters in the word GARDEN with vowels in alphabetical order

480

240

360

120