You visited us 3 times! Enjoying our articles? Unlock Full Access!

Permutation

The number of...

Question

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

5!

No worries! We‘ve got your back. Try BYJU‘S free classes today!

2 (5!)

No worries! We‘ve got your back. Try BYJU‘S free classes today!

10!

No worries! We‘ve got your back. Try BYJU‘S free classes today!

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

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

Open in App

Solution

The correct option is C $\frac{1}{2} (10!)$
Total number of ways to arrange $A_{1}, A_{2} . . A_{10} = 10!$
In $\frac{10!}{2}$ combinations $A_{1}$ will be above $A_{2}$ and in the other half $A_{2}$ will be above $A_{1}$ .

Ans : $\frac{10!}{2}$

Suggest Corrections

Similar questions

10

A_{1}, A_{2}, . . . . ., A_{10}

A_{1}

A_{2}

10

A_{1}, A_{2}, . . . ., A_{10}

A_{1}

A_{2}

A_{1}, A_{2}, . . . ., A_{10}

A_{1}

A_{2}

10

A_{1}, A_{2}, A_{3}, \dots, A_{10}

A_{1}

A_{2},

A_{1}, A_{2}, . . ., A_{10}

(i)

A_{1}

A_{2}

(i i)

A_{1}

A_{2}

Join BYJU'S Learning Program