Question

Finding the HCF of two numbers practically on the basis of Euclid's Divison Lemma.​

Answer 1

Apply Euclid's division lemma to the given integers 'a' and 'b' to find two whole numbers 'q' and 'r' such that, a = b x q + r. 3. Check the value of 'r'. If r = 0 then 'b' is the HCF of the given numbers.

Answer 2

Answer:

Suppose if we have two numbers 135 and 188

Euclid's Division Lemma states that

a(dividend) = B(divisor) × q(quotient) +r (remainder)

So,let's see the example

135<188

So,divide 188 by 135

and write the dividend in form of the lemma

188= 135 × 1(quotient) + 53 (remainder)

Now , take the divisor of that step and divide it the remainder

Follow this step until remainder becomes 0

The divisor of last step i.e. the divisor of step when remainder becomes 0 is The

HCF of the given numbers

Hope it helps

please mark this answer as brainliest