go Using Euclid’s algorithm, find the H.CF of:
1152 11664
1) 1152, 1664
HCF (1152 , 1664) = 128
– 1192
9

By Rose

go Using Euclid’s algorithm, find the H.CF of:
1152 11664
1) 1152, 1664
HCF (1152 , 1664) = 128
– 1192
9 12 15 272
1664 = 1152 XL+ 512
-1024
1152, 512 X 2 + 128
128 5)
24
512= 128 X 3.to
-912
HCF = 128
O
i 504, 1188​

About the author
Rose

1 thought on “go Using Euclid’s algorithm, find the H.CF of:<br />1152 11664<br />1) 1152, 1664<br />HCF (1152 , 1664) = 128<br />– 1192<br />9”

Leave a Comment