Question

Prove euclid's division lemma step by step process

Answer 1

Step-by-step explanation:

Euclids Division Algorithm

Theorem : If a and b are positive integers such that a = bq + r, then every common divisor of a and b is a common divisor of b and r, and vice-versa.

Proof : Let c be a common divisor of a and b. ...

Step 1 : Apply Euclid's division lemma, to c and d. ...

Step 2 : If r = 0, d is the HCF of c and d.

Answer 2

Answer:

attachment

Step-by-step explanation:

hope it will help you

mark me as brainliest