Class 10 NCERT

Example 1 : Use Euclid’s algorithm to find the HCF of 4052 and 12576. Example 2: Show that every positive even integer is of the form 2q, and that every positive odd integer is of the form 2q + 1,…

Theorem 1.1 (Euclid’s Division Lemma) : Given positive integers a and b, there exist unique integers q and r satisfying a = bq + r, 0 ≤ r < b. Euclid’s Division Algorithm : This algorithm is used to find…