The number of ways in which ten candidates A_ | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(D) The total number of ways to rank $10$ candidates without any restrictions is $10!$.In any ranking,there are only two possibilities for the relativ

Vedclass · Accepted Answer

$\frac{1}{2}(10!)$

Vedclass · Answer

(D) The total number of ways to rank $10$ candidates without any restrictions is $10!$.In any ranking,there are only two possibilities for the relative positions of $A_1$ and $A_{10}$: either $A_1$ is ranked above $A_{10}$,or $A_{10}$ is ranked above $A_1$.Due to symmetry,the number of ways in which $A_1$ is above $A_{10}$ is equal to the number of ways in which $A_{10}$ is above $A_1$.Let $N$ be the number of ways where $A_1$ is above $A_{10}$. Then,the total number of ways is $N + N = 2N = 10!$.Therefore,$N = \frac{1}{2}(10!)$.

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

Similar Questions

If $n$ is even and the value of $^nC_r$ is maximum,then $r = $

If $^{n + 1}{C_3} = 2{\,^n}{C_2},$ then $n =$

The number of numbers that can be formed with the help of the digits $1, 2, 3, 4, 3, 2, 1$ so that odd digits always occupy odd places,is

How many words can be made from the letters of the word $DELHI$,if $L$ comes in the middle in every word?

If $n$ and $r$ are two positive integers such that $n \ge r,$ then $^nC_{r-1} + ^nC_r = $

Vedclass Test Series

Exam Paper Generator

Online Exam Module