Question

what is Euclid division algorithm

Answer 1

Euclids Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers. Recall that the HCF of two positive integers a and b is the largest positive integer d that divides both a and b.
---------------------------------------------------------------------------
Let us state Euclid’s division algorithm clearly.
To obtain the HCF of two positive integers, say c and d, with c > d, follow the steps below:

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.
Step 3 : Continue the process till the remainder is zero. The divisor at this stage will be the required HCF.

This algorithm works because HCF (c, d) = HCF (d, r) where the symbol HCF (c, d) denotes the HCF of c and d, etc.

Answer 2

Hey Genius !!
Here is your answer


~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Euclid Division Algorithm state that for any positive integers a and b there exists unique integers q and r such that a = bq + r, where 0 ≤ r < b
_______________________________

May this helps you
Cheers !! ☺☺☺