Consider a collection of envelopes consisting of 3 red envelopes, 3 blue envelopes, 3 green envelopes, and 3 yellow envelopes. if three envelopes are selected at random, without replacement, determine the probability that at least one envelope is a green envelope.

1. 22

2. 1

3. 7

4. 18

step-by-step explanation

e2020 got it right

(x3 + 6x2 + 2x - 6) • (x - 1)

step-by-step explanation:

polynomial long division :

3.2     polynomial long division

dividing :   x4+5x3-4x2-8x+6

                              ("dividend")

by         :     x-1     ("divisor")

dividend     x4   +   5x3   -   4x2   -   8x   +   6

- divisor   * x3     x4   -   x3            

remainder         6x3   -   4x2   -   8x   +   6

- divisor   * 6x2         6x3   -   6x2        

remainder             2x2   -   8x   +   6

- divisor   * 2x1             2x2   -   2x    

remainder               -   6x   +   6

- divisor   * -6x0               -   6x   +   6

remainder                     0

quotient :   x3+6x2+2x-6   remainder:   0

ca = ec

cpctc makes it so that corresponding parts of the triangle you proved to be equal are equal, the other options aren't part of the part of the triangles you proved to be equal.

< xcy ≅ < xby

step-by-step explanation:

in δcax and δbax,

so, δcax ≅ δbax (side-angle-side or sas)

since δcax ≅ δbax, we can conclude < acx ≅ < abx

in δacy and δaby,

so, δacy ≅ δaby (side-angle-side or sas)

since δacy ≅ δaby, we can conclude < acy ≅ < aby

now,

< acy ≅ < aby

=> < acx + < xcy ≅ < abx + < xby

=> < acx + < xcy ≅ < acx + < xby   (since < acx ≅ < abx already proved above)

subtracting < acx from both sides, we get

< acx + < xcy -< acx ≅ < acx + < xby -< acx

cancelling out < acx and -< acx from both sides, we get

< xcy ≅ < xby (proved)