UEuclid's vision algorithm to find the HCF of
) 195 and 36220 m) 1651 and 2002
Answers
Answered by
1
Answer:
195 and 36220
Euclid's devision algorithm = a=bq+r
36220=195q+r
36220=195(175)+2095
195=175(1)+20
175=20(8)+15
20=8(2)+4
8=4(2)+0
H.C.F=4
2)1651 and 2002
2002=1651(1)+351
1651=351(4)+247
351=247(1)+104
247=104(2)+39
104=39(2)+26
39=26(1)+13
26=13(2)+0
H.C.F =13
- mark as brailiest
Similar questions