Question

Use Euclids division algorithm to find HCF of 56 and 814

Answer 1

here is your answer....
in the form of
a=bq+r
814=56*14+30
56=30*1+26
30=26*1+4
26=4*6+2
4=2*2+0


so the HcF of 56 and 814 is =2
that's all......

Answer 2

Answer:

The HCF of 56 and 814 is 2.

Step-by-step explanation:

Euclid's division algorithm

A technique of estimating the greatest common divisor of two numbers by dividing the bigger by the smaller, the lower by the remainder, the first remainder by the second remainder, and so on until actual division exists acquired thus the greatest common divisor exists the exact divisor.

Step 1

Given:

56 and 814

To find:

the HCF of 56 and 814 by using Euclid's division algorithm

Let a = 814 and b = 56

So, $\quad a=b q+r, \quad 0 \leqslant r < b$

814 = 56 $\times$ 14+80

56 = 30$\times$ 1+26

Step 2

Simplifying the above equation, we get

30 = 26 $\times$1+4

26 = 4 $\times$ 6+2

4 = 2 $\times$ 2+0

HCF = 2

The HCF of 56 and 814 is 2.

Therefore, the correct answer is 2.

#SPJ2