using euclid algorithm find the HCF of 1152,1664
Answers
Answered by
2
Answer:
HCF(1152,1664) = 128
Step-by-step explanation:
1664 = 1152 × 1 + 512
1152 = 512 × 2 + 128
512 = 128 × 3 + 0
Similar questions