Ask Questions, Get Answers

Want to ask us a question? Click here
Browse Questions
0 votes

The no. of ways in which 10 students $A_1,A_2,.....A_{10}$ can be ranked so that $A_1$ is above $A_2$ is ?

$\begin{array}{1 1} (10)! \\ \frac{10 !}{2} \\ 9! \\ \frac{9!}{2} \end{array}$

Can you answer this question?

1 Answer

0 votes
The no of ways in which 10 students are ranked = $10!\: ways$
Out of these in half of the ways $A_1$ is above $A_2$ and
in remaining half $A_2$ is above $A_1$.
$\therefore $ The required no. of ways $= \large\frac{10!}{2}$
answered Sep 3, 2013 by rvidyagovindarajan_1

Related questions

Ask Question
student study plans
JEE MAIN, CBSE, NEET Mobile and Tablet App
The ultimate mobile app to help you crack your examinations
Get the Android App