Back to PERMUTATIONS

JEE MATHEMATICS MCQ: PERMUTATIONS

1 Medium

1 of 1

Application +4 | -1

n

different toys have to be distributed among

n

children. Total number of ways in which these toys can be distributed, so that exactly one child gets no toy, is equal to

View answer and explanation

Correct option: B

n ! \cdot{ }^{n} C_2

Option B (

n! \cdot{ }^{n} C_2

) is correct because it represents the ways to choose two children, give one an extra toy, and then distribute the toys.

More Questions from PERMUTATIONS

Practice All Chapter MCQs →

How many different nine digit numbers can be formed from the number 223355888 by rearranging its digits so that the odd digits occupy even positions? The number of ways in which

r

letters can be posted in

n

letterboxes in a town is The number of four-digit numbers that can be made with the digits

1,2,3,4

and 5 in which atleast two digits are identical, is The number of ways in which a pack of 52 cards can be divided equally into four groups, is Five digited numbers with distinct digits are formed by using the digits, 5, 4, 3, 2, 1, 0. The number of those numbers which are multiples of 3, is A man invites a party to

\left( {m + n} \right)

friends to dinner and places m at one round table and

n

at another. The number of ways of arranging the guests is