Answer:
the answer is 176 hope this helps
Step-by-step explanation:
ANSWER
The greatest common divisor of 15,015 and 495 is 165.
<u>EXPLANATION</u>
We use the Euclidean Algorithm to compute the Greatest Common Divisor as follows;


The last remainder before zero is the greatest common divisor.
Therefore 
Answer:

Step-by-step explanation:

= 
-41c squared + 4c + 3
------------------------------
c
Answer:
the vertices of point R could be (-2,5) or (-2,9)
each point is 7 units away from Q since there are 7 units between P and Q
Step-by-step explanation: