Question

what do you mean by euclid's division algoritthm

Answer 1

heya your answer ☺

a method of finding the
greatest common

divisor of two numbers

by dividing the larger by the smaller,

the smaller by the remainder

called  Euclid's algorithm.

Answer 2

method of finding the greatest common divisor of two numbers by dividing the larger by the smaller, the smaller by the remainder, the first remainder by the second remainder, and so on until exact division is obtained whence the greatest common divisor is the exact divisor — called also Euclid's algorithm.
Hope it help u