contestada

1. Assume there are 5 red balls, 6 blue balls, and 4 green balls. If the balls are removed from the box one at a time, in how many different orders can the balls be removed assuming two balls of the same type are indistinguishable.
2. Give a recursive definition of the set of all even positive integers not divisible by 3.
Please write clearly so I can study from it! Try not to skip steps as much as you can.
Thank you!

Respuesta :

Tutorconsortium423

There are 1307674368000 possible methods to remove each ball from the box one at a time.

what is probability?

How likely something is to occur is known as its probability. We can discuss the probabilities of various outcomes—how likely they are—when we aren't sure how a particular event will turn out.  examination of events subject to probability.

given,

the quantity of balls inside a box ,

four red balls

6 balls in blue

four green balls

The variety of ways the balls can be taken out of the box one at a time must be determined.

Here,

Combination is possible because order is imperceptible;

mixture formula; nCr is equal to n!/r1(n-r)!

Here, There are 15 balls in the box overall (5 + 4 + 6 balls).

Then.

¹⁵C₁₅ = 15! / 15! (15 - 15)! = 15! = 1307674368000

that is

There are 1307674368000 ways in which we can take the balls out of the box one at a time.

To know more about probability visit:-

https://brainly.com/question/11234923

#SPJ4

Otras preguntas