Use Euclid’s Division Algorithm to Find the HCF of 2048 and 960

Video Explanation

Watch the video below to understand the complete solution using Euclid’s division algorithm:

Solution

Question: Use Euclid’s division algorithm to find the HCF of 2048 and 960.

Step 1: Apply Euclid’s Division Algorithm

2048 = 960 × 2 + 128

Since the remainder is not zero, apply the algorithm again.

960 = 128 × 7 + 64

Again, the remainder is not zero.

128 = 64 × 2 + 0

Here, the remainder is zero.

∴ HCF (2048, 960) = 64

Final Answer

∴ The HCF of 2048 and 960 is 64.

Conclusion

Thus, using Euclid’s division algorithm step by step, we find that the HCF of 2048 and 960 is 64. This method is simple and very useful for examination purposes.