Email
Chat with tutor
logo

Ask Questions, Get Answers

X
 
Answer
Comment
Share
Q)

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}$

1 Answer

Comment
A)
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}$
Help Clay6 to be free
Clay6 needs your help to survive. We have roughly 7 lakh students visiting us monthly. We want to keep our services free and improve with prompt help and advanced solutions by adding more teachers and infrastructure.

A small donation from you will help us reach that goal faster. Talk to your parents, teachers and school and spread the word about clay6. You can pay online or send a cheque.

Thanks for your support.
Continue
Please choose your payment mode to continue
Home Ask Homework Questions
Your payment for is successful.
Continue
Clay6 tutors use Telegram* chat app to help students with their questions and doubts.
Do you have the Telegram chat app installed?
Already installed Install now
*Telegram is a chat app like WhatsApp / Facebook Messenger / Skype.
...