Question

what is Euclid's division lemma.?​

Answer 1

Answer:

In arithmetic, Euclidean division – or division with remainder – is the process of dividing one integer by another, in a way that produces a quotient and a remainder smaller than the divisor. A fundamental property is that the quotient and the remainder exist and are unique, under some conditions.

Answer 2

Answer:

HCF using Euclid's Divison - example

HCF using Euclid's Divison - example 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. Example: Find HCF of 420 and 130.