Class-10 Ch-1 | Real Numbers: Euclid’s Division Lemma
Euclid’s Division Lemma: If we have two positive integers a and b, then there exist unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r < b. Euclidean division algorithm (is a basis of Euclid’s division lemma). To calculate the Highest Common Factor (HCF) of two positive integers…