Use Euclid’s Division Algorithm to Find the HCF of 1260 and 7344

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 1260 and 7344.

Step 1: Apply Euclid’s Division Algorithm

7344 = 1260 × 5 + 1044

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

1260 = 1044 × 1 + 216

Again, the remainder is not zero.

1044 = 216 × 4 + 180

216 = 180 × 1 + 36

180 = 36 × 5 + 0

Here, the remainder is zero.

∴ HCF (1260, 7344) = 36

Final Answer

∴ The HCF of 1260 and 7344 is 36.

Conclusion

Thus, by using Euclid’s division algorithm step by step, we find that the HCF of 1260 and 7344 is 36. This method is very useful for solving HCF problems in exams.