How do you solve this??
2 answers:
You might be interested in
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