Question

Find the greatest number which will divide 330 404 and 477 leaving remainders 6 8 and 9 respectively.Plz full method​

Answer 1

Step-by-step explanation:

330 - 6 = 354

404 - 8 = 396

477 - 9 = 468

Hence, 354, 396, and 468 are the numbers exactly divisible by the required greatest number

Hence, the required greatest number = H.C.F of 354, 396, 468

Using Euclid division algorithm

First we divide 354 by 396 at last the quotient will be 6

and, then we divide 6 ( i.e. the quotient)by 468 then again the quotient will be 6

therefore, H.C.F = 6 = the required greatest number