Question

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

Answer 1

Answer:

Step-by-step explanation:

Largest number that divides 870 & 258 leaving a remainder of 3 :

HCF of (870-3) & (258-3) = HCF (867,255)

867 = 255 × 3 + 102

255 = 102 × 2 + 51

102 = 51 × 2 + 0

Hence, 51 is the required number !