How to find hcf of a number with euclid division algorithm?
Answers
Answered by
0
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
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
ankit7958:
hello
hii
hlo
which class
tenth
who r u
Ankit
okh
plzz mark as brainlist
hii
Answered by
0
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
Similar questions