Question

1. Use Euclid's division algorithm to find the HCF of:
(i) 135 and 225
(ii) 196 and 38220
(iii) 867 and 255
​

Answer 1

Answer:

(i) 135 and 225  = 45

(ii) 196 and 38220  = 196

(iii) 867 and 255  = 51

​

Step-by-step explanation:

Euclid's division Algorithm is c=dq+r where d is the HCF,  

(i)225 = 1 × 135 + 90

135 = 1 × 90 + 45

90 = 2 × 45 + 0

When remainder R = 0, the HCF is the divisor(d), in the last equation. HCF = 45 .

(ii)38220 = 195 × 196 + 0

When remainder R = 0, the HCF is the divisor(d), in the last equation. HCF = 196

(iii)867 = 3 × 255 + 102

255 = 2 × 102 + 51

102 = 2 × 51 + 0

When remainder R = 0, the HCF is the divisor(d), in the last equation. HCF = 51

Answer 2

Answer:

It is the correct answer.

Step-by-step explanation:

Hope this attachment helps you.