30+ Euclid Division Lemma Definition Pictures. Euclid's division lemma states that, if two positive integers a and b, then there exists unique integers q and r such that which satisfies the condition a = bq + r where 0 ≤ r ≤ b. What we call euclid's division lemma is a precise statement of how division works with positive integers.

EUCLID'S DIVISION LEMMA
EUCLID'S DIVISION LEMMA from image.slidesharecdn.com
The main principle is that the gcd does not change if the smaller number. The idea is simple, since p is prime, it cannot be factorized. 0 ≤ r < d, and we want to show that in fact r = 0.

However, we shall not discuss this aspect here.

Division algorithm is a method to compute the greatest common divisor of two numbers which is based on repeated application of euclid's divsion lemma until the remainder. Hcf of two positive integers. A = bq + r, where 0 ≤ r < b. On divisions of figures, which survives only partially in arabic translation, concerns the division of geometrical figures into two or more equal parts or into parts in given ratios.