If all the letters of the word $ACADEMICIAN$ are permuted in all possible ways,then the number of permutations in which no two $A$'s are together and all the consonants are together is:

The number of different words that can be formed from the letters of the word "$INTERMEDIATE$" such that two vowels never come together,is

The number of ways to distribute $30$ identical candies among four children $C_{1}, C_{2}, C_{3}$ and $C_{4}$ such that $C_{2}$ receives at least $4$ and at most $7$ candies,and $C_{3}$ receives at least $2$ and at most $6$ candies,is equal to

$A$ certain question paper contains three parts $A, B, C$ with four questions in part $A$,five questions in part $B$,and six questions in part $C$. $A$ student is required to answer seven questions,choosing at least two questions from each part. The total number of different ways a student can choose his seven questions for answering is:

$A$ linguistic club consists of $6$ girls and $4$ boys. $A$ team of $4$ members is to be selected from this group including the selection of a leader (from among these $4$ members) for the team. If the team has to include at most one boy,the number of ways of selecting the team is

Let $P_m$ stand for $^nP_m$. Then the expression $1 \cdot P_1 + 2 \cdot P_2 + 3 \cdot P_3 + \dots + n \cdot P_n =$