Question

Find the HCF by Euclid's Lemma: -
a) 323,133​

Answer 1

Answer:

hsissdjhsujshsh of the year

Answer 2

Answer:

Euclid's division algorithm to find HCF of 2 numbers:

i.e., express n = qd + r, where 'q' is a positive integer and 0 ≤ r < d. If r ≠ 0, repeat step 1 with 'd' of step 1 as n and 'r' of step 1 as d till we get r = 0. The divisor of the step in which r = 0 is the HCF of the given numbers.