Amoving company had one seven of a ton of a weight to move across town. if they wanted to split it equally amongst 8 trip, how much weight they have on each trip?

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

if your equation is in the form ax2 + bx + c, you can find the maximum by using the equation:

max = c - (b2 / 4a).

the first step is to determine whether your equation gives a maximum or minimum.

-x2 + 4x - 2.     thats an example hope it