Question

Use Euclid's division algorithm to find the HCF of 11 and 9

Answer 1

Answer:

HCF of 11 and 9

Step-by-step explanation:

since 11 > 9 , we apply the lemma to 11 and 9 , to get

11 = 9×1+2

since the remainder 2 is not equal to zero , we apply the division lemma to 9 and 2 , to get

9 = 2×4+1

we consider the new divisior 2 and the new remainder 1 , and apply the division lemma to get,

2 = 1×1 +1

again we apply division lemma

1 = 1×1+0

the remainder has now become zero , so our procedure stops . since the division at this stage is 1 , the HCF of 11 and 9 is 1.

Answer 2

----------------------------------------------------------

Answer ---- Refer to attached part

-------------------------------------------------------------

Hope it helps you

-------------------------------------------------------------