Question

How to find hcf of a number with euclid division algorithm?

Answer 1

we can find hcf using Euclid division algorithm in following ways-
first follow the rule that is a= bq+ r
put the values and divide until u get zero and the last divisor would be ur hcf

Answer 2

Answer:

follow the rule

a=bq+r

Step-by-step explanation:

put the highest value in the place of a and lowest in the place of b until you get 0 in the place of reminder