Question

what is euclid's division algorithm

Answer 1

Given two positive integers a and b there exists unique integers q and r such that a=bq+r where 0 less than or equal to r < b . See ncert textbook pg no.3 theorem 1.1 I would prefer u to memorize it if would be faster to write so understand and memorize

Answer 2

Euclid division lemma is the long division method to find the hcf of difficult numbers...Theorem : If a and b are positive integers such that a = bq + r, then every common divisor of a and b is a common divisor of b and r, and vice-versa.