Question

find the largest number which divide 615 and 963 leaving a remainder 6 in each case

Answer 1

Answer:

Dude I can surely answer it but I want you to try it right now.

Step-by-step explanation:

Read Carefully

If you have to get remainder as 6 then You must add it to both the divisors

i.e 615+6 = 621

963+6 =969

Now find their HCF and that will satisfy your question with and appropriate answer

Either use normal short method or go for long division.

Thank You☺️

Answer 2

$\huge\fbox \red{Solution:}$

Firstly, the required numbers which on dividing doesn’t leave any remainder are to be found.

This is done by subtracting 6 from both the given numbers.

So, the numbers are 615 – 6 = 609 and 963 – 6 = 957.

Now, if the HCF of 609 and 957 is found, that will be the required number.

By applying Euclid’s division lemma

957 = 609 x 1+ 348

609 = 348 x 1 + 261

348 = 261 x 1 + 87

261 = 87 x 3 + 0.

⇒ H.C.F. = 87.

$\fbox \blue{Therefore, the required number is 87}$