Question

Find the largest number which divides 615 and 963 leaving remainder 6 in each case.
a) 87
b) 97
c) 107​

Answer 1

Answer:

the answer of this question is

a) 87

Answer 2

Answer:

Option (A): 87

Step-by-step explanation:

6 is the remainder in each case. Right!

We will subtract 6 from both the given numbers separately so that both the numbers will be divisible by the required number.

Now, the largest / greatest number dividing 609 (= 615 - 9) and 957 (= 963 - 6) will be the GCF / HCF of 609 and 957.

Apply Euclid's division algorithm to find the GCF (957, 609).

You will get GCF (957, 609) = 87.

Thus, 87 is the greatest / largest number which divides 615 and 963 leaving remainder 6 in each case.