1. n different toys are to be distributed among n children. find the number of ways in which these toys can be distributed so that exacly one child gets no toy.
soln. no. of ways of forming group of toys of quantity 1 and 2: n!/[(1!)^(n-2)]*(2!)*(n-2)!
sir now my doubt is in how many ways we can arrange
these grps, so as to get the complete soln.
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
You have rated this answer /10
Browse free questions and answers by Chapters
- 1 Sequences and Series
- 2 Mathematical Reasoning
- 3 Differential Equations
- 4 Three Dimensional Geometry
- 5 Complex Numbers and Quadratic Equations
- 6 Permutations and Combinations
- 7 Matrices and Determinants
- 8 Vector Algebra
- 9 Trigonometry
- 10 Integral Calculus
- 11 Sets, Relations and Functions
- 12 Limit, Continuity and Differentiability
- 13 Statistics and Probability
- 14 Co-ordinate Geometry
- 15 Mathematical Induction
- 16 Binomial Theorem and its Simple Applications