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:

Let the digits $a, b, c$ be in $A.P.$ Nine-digit numbers are to be formed using each of these three digits thrice such that three consecutive digits are in $A.P.$ at least once. How many such numbers can be formed?

If $a + b + c = 50$ and $a, b, c$ are non-negative even integers,then the greatest value of $ab^2c$ is:

In an admission test,there are $15$ multiple-choice questions. Each question has $4$ alternatives. For each question,one or more than one answer can be correct. If a student attempts all $15$ questions and marks the answers randomly,in how many different ways can the student answer the question paper?

In a club election,the number of contestants is one more than the maximum number of candidates for which a voter can vote. If the total number of ways in which a voter can vote is $62$,then the number of candidates is:

Numbers are to be formed between $1000$ and $3000$,which are divisible by $4$,using the digits $1, 2, 3, 4, 5$ and $6$ without repetition of digits. Then the total number of such numbers is.