Question

Use Euclid's division algorithm to find the HCF of
(i) 900 and 270 (ii) 196 and 38220 (iii) 1651 and 2032​

Answer 1

Step-by-step explanation: ( i )900= 270 X 3+90. ⟹270= 90 X 3+0.

So , 90 is HCF of 900 & 270.

( ii ) 38220= 196 X 195+0.

So , 196 is HCF of 38220 & 196.

( iii )2032= 1651 X 1+381. ⟹1651=381 X 4+127. ⟹381= 127 X 3+0.

So 127 is HCF of 2032 & 1651.

hope it helps

tq.../

Answer 2

Answer:

Step-by-step explanation:

Euclid's division lemma :

Let a and b be any two positive

integers .Then there exists two  unique whole numbers q and r  , such that  

a = bq + r ,  

0 ≤ r < b

__________________________-

now start with the larger number first:

i)(900,270):

900 = 270 x 3 + 90

  270 = 90 x 3 + 0

now since the remainder is 0 and the divisor at this stage is 90, hcf (900,270) = 90

____________________________________-

ii) (38220,196):

38220 = 196 x 195 + 0

now since the remainder is 0 and the divisor at this stage is 196, hcf (38220 , 196) = 196.

____________________________________-

iii) (2032,1651):

2032 = 1651 x 1 + 381

    1651 = 381 x 4 + 127

     381 = 127 x 3 + 0

now since the remainder is 0 and the divisor at this stage is 127,

hcf ( 2032,1651) = 127

_______________________-

pls mark as brainliest