Match the ordered pairs so that the relation defined by the set of ordered pairs does not represent a function. (2,3)
(-5,2)
(-5, 1) (6-5)
(6,5)
|(2, 2)
(0.3)
(-1,0)
(-1,6)
ILI

details

step-by-step explanation:

i think is g(1)=-1.

hope that i can

the answer is 1 becuz if it were 1.0 that would rip apart the entire so ya. : )

~potato.

copyright potato 2019.

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