Answer:
6930
Explanation:
If a 11 digit number contains exactly five 1's and exactly two 2's (and the remaining only 3's),
We can choose the positions of the 1's in
ways.
We can select the positions of the two 2's from the 6 remaining positions in
ways.
That leaves 11-(5+2) = 4 spots for the remaining numbers which must be all 3's. This can be done in
ways
So total number of ways this can be done is
![{11 \choose 5} {6 \choose 2}{4 \choose 4}](https://img.qammunity.org/2023/formulas/mathematics/college/gevbg4ym2k06y36zf97p7uzw26mavd6c39.png)
Noting that
![{n \choose k} = (n!)/(k!(n-k)!)](https://img.qammunity.org/2023/formulas/mathematics/college/f5pw1nuzbgoaxv1yh1e0iudcas6mbjjkfx.png)
![{11 \choose 5} = (11!)/(5!(11-5)!) = (11!)/(5!6!) \\{6 \choose 2} = (6!)/(2!(6-2)!) = (6!)/(2!4!) \\{4\choose 4} = (4!)/(4!(4-4)!) = (4!)/(4!0!)](https://img.qammunity.org/2023/formulas/mathematics/college/rwzgo2emdlg1ls8xstoy5gdzxuj4zxdvxt.png)
So answer =
=
since 0! = 1
This evaluates to 6930