Math, asked by Shubham0507, 10 months ago

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

Answers

Answered by alsohabagban020
7

Answer:

a = bq + r

a=870; b=258

870=258×3+96

258=96×2+66

96=66×1+30

66=30×2+6

30=6×5+0

HCF IS 6.

Answered by Anonymous
2

Step by step explanation

Attachments:
Similar questions