Get Answers to all your Questions

header-bg qa

Find the number of ways to distribute 5 distinct ornaments to 3 brides so that no bride should remain empty?

Option: 1

180


Option: 2

150


Option: 3

720


Option: 4

250


Answers (1)

best_answer

Empty box is not allowed

So, number of ways of distributing \mathrm{'n'}distinct things in \mathrm{'r'}identical places can be computed by the formula, 

\mathrm{r^{n}-r c_{1}(r-1)^{n}+r c_{2}(r-2)^{n}----+(-1)^{r-1} r c_{r-1}(1)^{n}}

Here, number of ornaments \mathrm{n=5}
number of brides \mathrm{r=3}

Using the equation, we obtain:

\mathrm{3^{5}-3 c_{1}(3-1) 5+3 c_{2}(3-2) 5=243-3(25)+3(1)=150}

Total number of ways: 150

Posted by

Devendra Khairwa

View full answer

JEE Main high-scoring chapters and topics

Study 40% syllabus and score up to 100% marks in JEE