Question

short trick to prove Euclid division lemma​

Answer 1

Answer:

$\huge\underline\mathrm\blue{Answer❀✿ฺ᭄}$

Step 1 : Apply Euclid's division lemma, to c and d. So, we find whole numbers, q and r such that c = dq + r, 0 ≤ r < d.

Step 2 : If r = 0, d is the HCF of c and d. If r ≠ 0, apply the division lemma to d and r.

Answer 2

$\huge\bf\fbox\orange{Answer:-}$

Step 1 : Apply Euclid's division lemma, to c and d. So, we find whole numbers, q and r such that c = dq + r, 0 ≤ r < d.

Step 2 : If r = 0, d is the HCF of c and d. If r ≠ 0, apply the division lemma to d and r.