In a jar, there is a green, a blue, and a red marble. You draw (with replacement) a marble from the jar until you get the green marble. What is the probability that you draw exactly m times, where m is a positive integer?

The value is

Step-by-step explanation:

From question we are told that

   The number of types of marbles present jar is n  =  3

Generally the probability of drawing a green marble is  

Generally the probability of drawing a marble that is not green is  

From the question we are told that there will be continuous drawing of marbles from the jar (in such a way that after each marble is drawn it is being replaced) until a green marble drawn

  Let m be the number of times marbles has been drawn when a green marble was gotten

it then means that for m - 1 times the marbles where drawn a green marble was not obtain.

Generally the probability drawing m times is mathematically is mathematically represented as

=>  

maya’s expression will generate the wrong sum because she violated the commutative property.

step-by-step explanation:

(5x-1)^2= (5x)^2-2(5x)×1+(1)^2=25x^2-10x+1