The set \(S = \{1, 2, 3, \ldots, 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 = \varnothing\). The number of ways to partition \(S\) is
Let $A=\{1,2,3,\ldots,10\}$, $B=\{4,8,12,16,20\}$ and $C=\{D:D\subseteq A,\,D\cap B\neq\emptyset\}$. The number of elements in $C$ which have at least 3 but at most 6 cardinal number is
How many six-digit odd numbers, greater than 6,00,000, can be formed from the digits 5, 6, 7, 8, 9, and 0 if(b) repetition of digits is not allowed?