Hi im Aleida and go to calculatorsoup on Safari or google and put gcf calculatorsoup hope this helps
The number -33 divisors are:
D(-33) = {-33, -11, -3, -1, 1, 3, 11, 33}
a × b = -33
<u>1) -33 × 1 = -33 ⇒ Sum is: -33 + 1 = -32</u>
2) -11 × 3 = -33 ⇒ Sum is: -11 + 3 = -8
3) -3 × 11 = -33 ⇒ Sum is: -3 + 11 = 8
4) -1 × 33 = -33 ⇒ Sum is: -1 + 33 = 32
<u>5) 1 × (-33) = -33 ⇒ Sum is: 1 + (-33) = 1 - 33 = -32</u>
6) 3 × (-11) = -33 ⇒ Sum is: 3 + (-11) = 3 - 11 = -8
7) 11 × (-3) = -33 ⇒ Sum is: 11 + (-3) = 11 - 3 = 8
8) 33 × (-1) = -33 ⇒ Sum is: 33 + (-1) = 33 - 1 = 32
<h2>The least possible sum of a and b is -32</h2>
to 1) and to 5)
Answer:
So if we are solving for x and y. First we need to subtract both equations. We take each equation and put in parenthesis and subtract.
y-y = (3x+7)-(-2x-3) =
0 = 3x+7+2x+3
0 = 5x+10
-10 = 5x
-2 = x.
Now we need to solve for y.
Plug it in for the first equation. -2*3+7 = -6+7 = 1
Test if we are correct and try in the second equation.
-2*-2-3 = 4-3 = 1
<u>x = -2</u>
<u>y = 1</u>
