See, please, the suggested explanation:
the equation is y= -|x+3|, where '-' means location of graph in the 3-d quarter, '+3' - the graph is moved to the left on 3 points.
Im sure others have questioned this so try doing that
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:
ITS C. (0, 3)
Step-by-step explanation:
I JUST ASKED THE TEACHER ;)
11.25. Because both segments are chords and the lines extending from the center are congruent, the chords are congruent. Also, that answer's the one that makes the most sense out of your options.
