Abinary string containing m 0âs and n 1âs (in arbitrary order, where all orderings are equally likely) is sent over a network. what is the probability that the first r bits of the received message contain exactly k 1âs?

amount of oatypop that contains the prize = 40%

amount   of oatypop which doesn't contain the prize = (100-40)=60%

probability that hannah will win a prize

    = s +f s +f f s+ff   f s+ff f f s+ infinity.where f= failure,s= success

=   or 60%

probability that hannah only has to buy 3 or less boxes before getting a prize= (s) and ( f s) and (ff s) and (f f f s)

        = = 87.04 %  

step-by-step explanation:

simplifying

5(x + -6) = 2(x + 3)

reorder the terms:

5(-6 + x) = 2(x + 3)

(-6 * 5 + x * 5) = 2(x + 3)

(-30 + 5x) = 2(x + 3)

reorder the terms:

-30 + 5x = 2(3 + x)

-30 + 5x = (3 * 2 + x * 2)

-30 + 5x = (6 + 2x)

solving

-30 + 5x = 6 + 2x

solving for variable 'x'.

move all terms containing x to the left, all other terms to the right.

add '-2x' to each side of the equation.

-30 + 5x + -2x = 6 + 2x + -2x

combine like terms: 5x + -2x = 3x

-30 + 3x = 6 + 2x + -2x

combine like terms: 2x + -2x = 0

-30 + 3x = 6 + 0

-30 + 3x = 6

add '30' to each side of the equation.

-30 + 30 + 3x = 6 + 30

combine like terms: -30 + 30 = 0

0 + 3x = 6 + 30

3x = 6 + 30

combine like terms: 6 + 30 = 36

3x = 36

divide each side by '3'.

x = 12

simplifying

x = 12

this should .