Question

find hcf by Euclid division algorithm
ans . fast
its urgent​

Answer 1

hope this answer helps.......

Answer 2

Answer:

Step-by-step explanation:

If two numbers are given

56. And. 814

Now by long division method

divide 814 by 56

814 is the dividend

56 is the divisor

814/56 then remainder will be 30 now take thirty as divisor and 56 as the dividend the eq. will be 56/30 now remainder will be 26 so take it as adivisor and 30 will be our dividend the remainder will be 4 so 4 is the remainder and 26 will be dividend remainder will be 2dividing 4/2 we get 0.

Dividend=divisor*quotient+remainder

814 =56*14+30

56=30*1+26

30=26*1+4

26=4*6+2

4=2*2+0

HCF will be 2 because it is the last divisor of our solution