Hindi, asked by Anonymous, 7 months ago

what is eulcid's division algorithm?? ​

Answers

Answered by BrainlyGem
3

Answer:

a = bq + r

It shows the relationship between quotient, divisor, remainder and dividend

Explanation:

Hope it helps you.

plz Mark it as brainliest.

Answered by kumarmukesh92653
0

Euclids Division Algorithm is a technique to compute the highest common factor (HCF) of two given postive intergers. The HCF of two postive intergers a and b is the postive interger d that divides both a and b

Similar questions