The number of permutations of the letters $a_1, a_2, a_3, a_4, a_5$ in which the first letter $a_1$ does not occupy the first position and the second letter $a_2$ does not occupy the second position is:

  • A
    $96$
  • B
    $78$
  • C
    $60$
  • D
    $42$

Explore More

Similar Questions

The number of seven-digit integers,with the sum of the digits equal to $10$ and formed by using the digits $1, 2,$ and $3$ only,is

Let $S = \{1, 2, 3, 4, 5, 6, 7, 8, 9\}$. Let $x$ be the number of $9$-digit numbers formed using the digits of the set $S$ such that only one digit is repeated and it is repeated exactly twice. Let $y$ be the number of $9$-digit numbers formed using the digits of the set $S$ such that only two digits are repeated and each of these is repeated exactly twice. Then,

The number of integers lying between $1000$ and $10000$ such that every number contains the digits $3$ and $7$ exactly once without repetition is:

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 signals which can be given from $7$ different coloured sheets,taking one or more at a time is

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo