IIT JEE , AIEEE Forum - Mathematics , Algebra

prateek2292

by the way viv, u can't proceed in such a way.
each master can choose his monkey in n ways.
first can choose in n ways.
second can also choose in n ways because he also have n monkeys to choose from.That will satisfy the cond.
AND SO ON.....
therefore,
n*n*n*n*n.................m times=n^m

prateek2292

though a monkey can't choose his master.
look for the choices each master would have to choose his monkey and also to satisfy the cond.

abhijeet_0201

no i dont agree yaar
ur quote
"it is necessary that each monkey should have atleast one master."

how can a monkey have more than 1 master??????
the masters wont SHARE a monkey!!!!!

and plz exp y the second master will have n monkeys to choose frm (instead of n-1) when the first master has chosen a monkey!!!!!!

prateek2292

i am sorry.
there is a cond. that one monkey can be shared by more than one master

Ask & Discuss Questions with Community & Experts