Question

hcf of ABC and ac using euclids lemma​

Answer 1

Answer:

simple words, Euclid's Division Lemma is what you were using to check the accuracy of division in lower classes, which is Dividend = Divisor × Quotient + Remainder. When we divide a=39 by b=5, we get the quotient as q=7 and the remainder as r=4. Here is an example

Step-by-step explanation:

Euclid's division algorithm is a way to find the HCF of two numbers by using Euclid's division lemma. It states that if there are any two integers a and b, there exists q and r such that it satisfies the given condition a = bq + r where 0 ≤ r < b.