Agame uses two spinners. Each spinner is divided into equal sections as shown. Spinner #1
Spinner #2
2
Move
Forward
Move
Backward
3
4
Lose Turn
Darrel spins each spinner one time. What is the probability that Spinner #1 lands in the section labeled Lose Turn and
Spinner #2 lands in a section labeled 1, 2, or 3?

1.0

step-by-step explanation:

< 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)

this would be 35. 35 + 5 = 40. you take the known constant and subtract by the answer of the equation and you get y.