Answer 1

The given number are 1260 and 7344.
Now 7344 > 1260. So, on applying Euclid's algorithm we get
7344 = 1260 x 5 + 1044

Now the remainder is not 0 so, we repeat the process again on 1260 and 1044
1260 = 1044 x 1 + 216

The algorithm is applied again but this time on the numbers 1044 and 216
1044 = 216 x 4 + 180

Now, the algorithm is applied again until the remainder is 0.
216 = 180 x 1 + 36
180 = 36 x 5 + 0
Thus, the HCF obtained is 36.