Question

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

Answer 1

Answer:

51

Step-by-step explanation:

Simply we have to find the hcf of two numbers which are 3 less than the given numbers .

870-3=867

258-3=255

by Euclid division algorithm we have to divide these two numbers till the remainder is 0.

1.a=bq+r

a is the larger number while b is its vice versa.

a=867

b=255

we have to divide b with a till the remainder is 0.

255|867|3

-766

-------

102|255|2

-204

--------

51|102|2

-102

-----

0

----

so when the remainder is zero.Then the last divisor is the hcf.

so 51 is the largest number which divides 870 and 258 leaving 3 in each case.

Hope you got your answer

If then mark as brainliest