Respuesta :

AL2006

You started out as if it was going to be a probability problem, but it turned out to be a simple binary counting problem.

It really doesn't matter how many of each color are in the bag, or how many  marbles there are in the bag all together.  I think you're just asking how many ways there are to pull out two white ones and two black ones.  That's exactly the same question as "How many 4-bit binary numbers can be written with two 1's and two 0's ?"

It's easy to draw up that list.  You start out like this:

0011,  0101,  1001,  0110,  1010,  1100 .

Gosh.  I just wanted to start out doing the list, but I think that's all of them.

There are six (6) ways.

WWBB,  WBWB,  BWWB,  WBBW,  BWBW, and  BBWW .

Using the combination formula, it is found that there are 420 ways to draw the marbles.

-----------------

  • The order in which the marbles are chosen is not important, which means that the combination formula is used to solve this question.

Combination formula:

[tex]C_{n,x}[/tex] is the number of different combinations of x objects from a set of n elements, given by:

[tex]C_{n,x} = \frac{n!}{x!(n-x)!}[/tex]

-----------------

We want:

  • 2 white, from a set of 8.
  • 2 black, from a set of 6.

Thus:

[tex]C_{8,2} \times C_{6,2} = \frac{8!}{2!6!} \times \frac{6!}{2!4!} = 420[/tex]

There are 420 ways to draw the marbles.

A similar problem is given at https://brainly.com/question/16638977

RELAXING NOICE
Relax