in a class there is only 1 round table.there are total $m$ students.among them $n$ are copy cats(tuklifyer).the teacher wants to arrange them in such a way so that none of the bad ones(not even 2) sit beside each other.in how many ways can the teacher arrange them?
@moon bhai,this is a problem made by me,u can ask zzzz,we have discussed about it.
Dont copy in exams
- Tahmid Hasan
- Posts:665
- Joined:Thu Dec 09, 2010 5:34 pm
- Location:Khulna,Bangladesh.
বড় ভালবাসি তোমায়,মা
- Tahmid Hasan
- Posts:665
- Joined:Thu Dec 09, 2010 5:34 pm
- Location:Khulna,Bangladesh.
Re: Dont copy in exams
consider both two scenarios.(if u undrstand this that means u have cruxed it )
বড় ভালবাসি তোমায়,মা
Re: Dont copy in exams
feeling so sick after viewing the last part of the post- "moon vai...."
A man is not finished when he's defeated, he's finished when he quits.
Re: Dont copy in exams
Changed the topic name. You must write english in olympiad level forum.
Every logical solution to a problem has its own beauty.
(Important: Please make sure that you have read about the Rules, Posting Permissions and Forum Language)
(Important: Please make sure that you have read about the Rules, Posting Permissions and Forum Language)
-
- Posts:135
- Joined:Thu Dec 09, 2010 12:10 pm
Re: Dont copy in exams
if $\left(m-n\right)\ge n$ then $(m-n-1)! \cdot ^{m-n}P_n$
else $(n-1)! \cdot ^nP_{m-n}$
else $(n-1)! \cdot ^nP_{m-n}$