Question

Use
Euclid's
division algonithm to find HCF

155 and 1385
​

Answer 1

Step-by-step explanation:

Expert Answer:

By applying Euclid's Division Algorithm, we get.

1385 = 155 × 8 + 145.

Here the remainder (145) ≠ 0.

155 = 145 × 1 + 10.

Here the remainder (10) ≠ 0.

145 = 10 × 14 + 5.

Here the remainder (5) ≠ 0.

10 = 5 × 2 + 0.

Answer 2

$\huge{ \underline{ \bold{ᴀɴsᴡᴇʀ....{ \heartsuit}}}}$

By applying Euclid's Division Algorithm, we get.

1385 = 155 × 8 + 145.

Here the remainder (145) ≠ 0.

155 = 145 × 1 + 10.

Here the remainder (10) ≠ 0.

145 = 10 × 14 + 5.

Here the remainder (5) ≠ 0.

10 = 5 × 2 + 0.