Question

Find HCF by using euclid's division algorithm of 17 and 42

Answer 1

Answer:

42=17*2+6

17=8*2+1

8=1*8

HCF=1

Answer 2

Answer:

Since, 42>17, using euclid's lemma to 42 and 17, we get- 42=17x2+8

since, the remainder is 8 not equal to 0, using euclids lemma to 17 and 8, we get- 17=8x2+1

Since the remainder is 1 not equal to 0, using euclids lemma to 8 and 1, we get- 8=1x8+0

Since the remainder is 0 our procedure stops

Since the divisor is 1 at this stage, therefore HCF of 17 and 42 is 1