The number of ways in which ten candidates $A_1, A_2, \dots, A_{10}$ can be ranked such that $A_1$ is always above $A_{10}$ is:

  • A
    $5!$
  • B
    $2(5!)$
  • C
    $10!$
  • D
    $\frac{1}{2}(10!)$

Explore More

Similar Questions

If all the letters of the word $CRICKET$ are permuted in all possible ways and the words (with or without meaning) thus formed are arranged in the dictionary order,then the rank of the word $CRICKET$ is

How many numbers between $5000$ and $10,000$ can be formed using the digits $1, 2, 3, 4, 5, 6, 7, 8, 9$ if each digit appears not more than once in each number?

In how many ways can one send $6$ new-year greeting cards to $4$ people?

The number of words formed from the letters of the word $RAJASTHAN$ by taking all the letters at a time in which vowels are alternate is:

If ${}^n P_r = {}^{(n-1)} P_r + x \cdot {}^{(n-1)} P_{(r-1)}$,$\forall n, r \in N$ and $r \leq n$,then $x =$

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