Using Euclid's algorithm. Find the HCF of 1152 and 1664
Answers
Answered by
20
Answer:
HCF(1152,1664) = 128
Step-by-step explanation:
1664 = 1152 × 1 + 512
1152 = 512 × 2 + 128
512 = 128 × 3 + 0
Answered by
2
Answer:
hope it is helpful to u
thanks
Attachments:
![](https://hi-static.z-dn.net/files/d99/8b993ec8400c39a1068b2145f95bc592.jpg)
Similar questions