Question

Define Euclids Division Algorithms :–

(x-x) name ki problem ayegi

genius tak jane mai 2 din lagenge

nd name change hone mai 2 din 4 huh...​

Answer 1

Answer:

a 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.

I HOPE IT'S HELPFUL TO YOU

Step-by-step explanation:

kese

Answer 2

Step-by-step explanation:

a 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.