Euclid's division algorithm method of 240&6555
Answers
Answered by
2
Answer:
the answer is 15
Step-by-step explanation:
Euclid division algorithm
a=bq+r, o < r < b,
a = divident, b = divisor, q = quotient and
r = remainder
6555=240[27]+75
240=75[3]+15
75=15[5]+0
Similar questions