Question

How does Euclid’s division lemma and

Euclid’s division algorithm connected ,

Explain with example .​

Answer 1

Answer:

According to 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. ... To calculate the Highest Common Factor (HCF) of two positive integers a and b we use Euclid's division algorithm.

Step-by-step explanation:

hope helps you...

please follow me...

please mark as brainlist