Question

Tsing Euclid's Algorithm, find the largest number which divides 870 and
258 leaving remainder 3 in each case.

Answer 1

Answer:

870-3=867

258-3=255

870=255×3+102

255=102×2+51

102=51×2+0

HCF=51

you can verify it by dividing 51 by 258 and 870

Answer 2

The largest number which divides 870 and  258 leaving remainder 3 in each case

Step-by-step explanation:

To find the largest number which divides 870 and  258 leaving remainder 3 in each case, we need to first substract 3 from the numbers.

Thus we get,

870-3=867

258-3=255

Now use Euclid's Algorithm to find the HCF:

STEP 1:    870=255×3+102

 STEP 2:    255=102×2+51

STEP 3: 102=51×2+0

now we get the reminder as 0

Thus,

HCF=51

Therefore,  the largest number which divides 870 and  258 leaving remainder 3 in each case is 51