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

There are $10$ distinct letters of the English alphabet. Words of $5$ letters are formed using these letters. How many such words can be formed if at least one letter is repeated?

If $n, r$ are two positive integers such that $1 \leq r < n$,then ${ }^{n} P_{r+1} + r^2 { }^{n-1} P_{r-1} + (r+1) { }^{n-1} P_{r} + r { }^{n-1} P_{r-1} =$

The number of $7$ digit numbers which can be formed using the digits $1, 2, 3, 2, 3, 3, 4$ is

How many $3$-digit even numbers can be formed from the digits $1, 2, 3, 4, 5, 6$ if the digits can be repeated?

How many words,with or without meaning,can be formed using all the letters of the word $EQUATION$,using each letter exactly once?

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