Respuesta :

ANSWER

The greatest common divisor of 15,015 and 495 is 165.


EXPLANATION

We use the Euclidean Algorithm to compute the Greatest Common Divisor as follows;

[tex]15015=30\times 495 +165[/tex]


[tex]495=3\times 165 +0[/tex]

The last remainder before zero is the greatest common divisor.


Therefore [tex]gcd(15015,495)=165[/tex]



Answer:

Step-by-step explanation:

165

ACCESS MORE