In how many ways can $7$ distinct biscuits be distributed among $4$ (distinguishable) children such that one child receives $1$ biscuit and the other children receive precisely $2$ biscuits each.
My approach is:
For the child that has $1$ biscuit, there are $4$ choices of choosing the child and $7$ choices of choosing the biscuit.
For the second child that has $2$ biscuits, there are $3$ choices of choosing the child and $C(6,2)$ choices for biscuits.
For the third child that has $2$ biscuits, there are $2$ choices of choosing the child and $C(4,2)$ choices for biscuits.
For the final child that has $2$ biscuits, there are $1$ choices of choosing the child and $C(2,2)$ choices for biscuits.
So, my answer is $4 \cdot 7 \cdot 3 \cdot C(6,2) \cdot 2 \cdot C(4,2) \cdot 1 \cdot 1 = 15120$.
However, the answer is $2520$. Have no idea how to get the correct answer.
Let the children be $A, B, C, D$. There are four cases. Either $A$ is the child who receives one biscuit, $B$ is said child and so on. In each case the child who receives one biscuit has $7$ choices and then we distribute the remaining $6$ biscuits among the remaining $3$ children with each receiving $2$ biscuits, which can be done in $\dfrac{6!}{2!2!2!}$ ways. Putting the pieces altogether, there are $$ 4\times 7\times\frac{6!}{2!2!2!}=2520 $$ ways.