what is euclid's division algorithm?
Answers
Answered by
3
Euclid's or Euclidean Division Algorithm is one of the important concepts in arithmetic used to calculate the Highest Common factor (HCF) of two positive integers. HCF is the largest number which exactly divides two or more positive integers till the reminder is zero.
Answered by
4
it's all about a=bq+r where a is dividend b is divisor q is quotient and r is remainder
ishitapathuri:
if it helped u then plsss do mark this as brainlist answer...
plsss do dude! if it really helps u
Similar questions