Question

find HCF of the following Euclid algorithm irrelivent answers are reported​

Answer 1

Answer:

Euclid algorithm a=bq+r

a>B and 0⩽r<b

50 and 70

The positive integers are 50 and 70

70>50

Apply Euclid algorithm to 70 and 50

∴70=(50∗1)+20

The remainder is 20

Apply Euclid algorithm to 50 and 20

∴50=(20∗2)+10

The remainder is 10.

Apply Euclid algorithm to 20 and 10

∴20=(10∗2)+0

The remainder is zero.

∴ HCF of 70 and 50 is 10.

Answer 2

Answer:

Your answers are 20, 24 and 50 respectively

Step-by-step explanation:

(1)

Let assume that,

a = bq + r

It's like, Dividend = Divisor × Quotient + Remainder

Now,

1) 50, 70

50= 2×5×5

70= 2×5×7

A = BQ + R

70 = 50×1 + 20. R not equal to 0

50= 20×2 + 10

20= 10 × 2 + 0

Hence,

HCF = 20

2)

96= 72×1 + 24

72= 24 × 3 + 0

Hence,

HCF = 24

3)

550= 300 × 1 + 250

300 = 250 ×1 + 50

250= 50× 5 + 0

HENCE,

HCF = 50