There are $m$ men and $n$ monkeys $(n > m)$ .If a man have any number of monkeys .In how many ways may every monkey have a master?

Open in App

Solution

The first monkey can select his master by $m$ ways and after that, the second monkey can select his master again by $m$ ways, so can the third and so on.

All monkeys can select master $= m \times m \times m . . . .$ up to $n$ factors.
$= m^{n}$ ways.

Suggest Corrections

Similar questions

Q. There are

m

men and

n

monkeys

(n > m)

. If a man can have any number of monkeys, in how many ways may every monkey have a master?

Q. If there are 60 bananas and two monkeys, how many will each monkey get? _________ bananas.
What if there are 600 bananas and two monkeys?

Q. There are 12 monkeys in 4 carriages. If there are 4 more carriages attached with 3 monkeys in each carriage. How many monkeys are there in all?

A monkey jumps 5m every second on 60m vertical pole and falls down 2m over the next second . How many seconds will the monkey will take to climb on the pole

Q. The zookeeper wants to give equal bananas to each monkey. There are 67 monkeys and 768 bananas. How many bananas are leftover?

Join BYJU'S Learning Program

There are m men and n monkeys(n>m).If a man have any number of monkeys .In how many ways may every monkey have a master?

The first monkey can select his master by m ways and after that, the second monkey can select his master again by m ways, so can the third and so on.All monkeys can select master=m×m×m....up to n factors.=mn ways.

There are $m$ men and $n$ monkeys $(n > m)$ .If a man have any number of monkeys .In how many ways may every monkey have a master?

The first monkey can select his master by $m$ ways and after that, the second monkey can select his master again by $m$ ways, so can the third and so on.

All monkeys can select master $= m \times m \times m . . . .$ up to $n$ factors.
$= m^{n}$ ways.