show that the binary operation on A=R-(-1) defined as a*b=a+b for all a, b belong to A is commutative and associatiative on A. Also prove that every element of Ais invertible. Mention each and every formula minute details​

step-by-step explanation:

use context clues to figure out the meaning of the bolded word:  

the sage gardener knew when she had to water her plants.  

question 8 options:

mint plant

wise

happy

lazy

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

step-by-step explanation: hi!