Use the Euclidean Algorithm to calculate ged( 26187, 1533)
Answers
Answered by
0
Step-by-step explanation:
hence , the greatest common divisor is 7
Attachments:
Similar questions