The set S: {1, 2, 3, …, 12} is to be partitioned into three sets A, B, C of equal size. Thus, A ∪ B ∪ C = S, A ∩ B = B ∩ C = A ∩ C = φ. The number of ways to partition S is-
12!/3!(4!)3
12!/3!(3!)4
12!/(4!)3
12!/(4!)3
How many ways are there to arrange the letters in the word GARDEN with the vowels in alphabetical order?
120
480
360
360
The number of ways of distributing 8 identical balls in 3 distinct boxes so that none of the boxes is empty is
5
38
38
The greatest integer which divides (p + 1) (p + 2) (p + 3) .... (p + q) for all p E N and fixed q N is
p!
q!
p
q
The number of ways in which the letters of the word ARRANGE can be permuted such that the R's occur together, is
If A = and , then
A = B
C.
We have,
A = 5n - 4n - 1 = (1 + 4)n - 4n - 1
Therefore, A contains some multiples of 16.
Clearly, B contains all multiples of 16 including 0.