Question

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

​

Answer 1

Step-by-step explanation:

Using Euclid division algorithm find the largest number which divides 870 and 258 leaving remainder 3 in each case. So H.C.F of 867 and 255 is 51: 51 will be the largest number which divides 870 and 258 leaving remainder 3 in each case.