Question

Find the greatest number which divides 1277 and 1368 leaving a reminder of 3 in each case.

Answer 1

1277-3=1274, 1368-3=1365
Hence, HCF(1274,1365) will give us the required number.
By applying Euclid's Division Algorithm,
HCF(1274,1365): 1365=(1274 x 1) + 91
                                1274=(91 x 14) + 0
So, HCF(1274,1365) = 91
Therefore, the greatest number that divides 1277 and 1368 leaving remainder 3 in each case is 91.

Answer 2

hcf of (1277-3) & (1368-3)

so it will be=(13★7)=91...