A box contains two white, three black, and four red balls. In how many ways can three balls be drawn from the box if at least one black ball is to be included in the draw.
The answer given is $64$. I attempted the problem with two different approaches.
My two different attempts:
Attempt #1
Number of ways in which any $3$ balls can be drawn out of $9$ balls
$$\binom{9}{3}=84$$
Number of ways in which no black balls are drawn out of $9$ balls (choosing $3$ balls from the remaining $6$ balls)
$$\binom{6}{3}=20$$
Thus, the number of ways of choosing at least $1$ black ball is
$$84-20=64$$
Attempt #2
Number of ways of drawing $1$ black ball out of $3$ black balls
$$\binom{3}{1}=3$$
Now, we have to draw two more balls, we can choose those balls from the $8$ remaining balls
$$\binom{8}{2}=28$$
Since both the above events are associated with each other, by fundamental principle of counting, the number of ways of drawing at least one black ball out of the $9$ balls is
$$3\times28=84$$
I think my second attempt should also be right. Please explain what I'm doing wrong with my second attempt.
The second attempt counts the combination $\{B_1,B_2,B_3\}$ three times as $(B_1, \{B_2, B_3\})$, $(B_2, \{B_3, B_1\})$ and $(B_3, \{B_1, B_2\})$.
N.B: $(B_i, \{B_j, B_k\})$ means pick $B_i$ first, followed by the combination $\{B_j, B_k\}$.
We have the basic product rule
$$|A\times B| = \#\{(a,b) \mid A \times B\} = |A| \times |B|$$
for cardinals which holds for any sets $A$ and $B$.
By writing $3 \times 28$, you are actually counting $\{B_1, B_2, B_3\} \times \{B_2,B_3, \dots\}$, which doesn't answer the problem.
In elementary-set-theory, $(a,b)$ is defined as $\{a,\{a,b\}\}$, so order matters.