Explain Euclid’s Division Algorithm.
‘a = bq + r, where 0 ≤ r < b’
Here, a = 7344 and b = 1260.
So, 7344 = 1260q + r
7344 = 1260 × 5 + 1044
1260 = 1044 × 1 + 216
1044 = 216 × 4 + 180
216 = 180 × 1 + 36
180 = 36 × 5 + 0
And we got the remainder as 0.
Therefore, 36 is the HCF of 7344 and 1260.