Question

Find the largest number which divides 615 and 963 leaving remainder 6 in each case.

Answer 1

The required number when the divides 615 and 963

Leaves remainder 616 is means 615 – 6 = 609 and 963 – 957 are completely divisible by the number

∴ The required number = HCF of 609 and 957

By applying Euclid’s division lemma

957 = 609 × 1 + 348

609 = 348 × 1 + 261

348 = 261 × 1 + 87

261 = 87 × 370

HCF = 87

Hence the required number is ‘87’.