Question

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

Answer 1

since 225>135,we apply the division lemma to 225 and 135 to obtain

225=135×1+90

135=90×1+45

90=2×45+0

since the remainder is zero,the process stops

it is in the form of a=bq+r

so,therefore remainder is o,and devisor is 45

therefore,the HCF of 135 and 225 =45

2. 196 and 38220

38220 is greaterthan 196

38220=196×195+0

HCF is 196

Answer 2

Answer:

It is the correct answer.

Step-by-step explanation:

Hope this attachment helps you.