Question

Using Euclid algorithm find the largest number which divides 870 and 258 leaving remainder 3 in each case

Answer 1

Step-by-step explanation:

a=bq+r

870-3=867

258-3=255

a=867,b=255

867=255*3+102

a=255,b=102

255=102*2+51

a=102,b=51

102=51*2+0

So

HCF=51

Largest number is 51 which divides 870 and 258 leaving remainder 3 in each case