Question

hello dudes , answer me the main condition which was said in euclid geometry . and thanks for making me brainliest​

Answer 1

Step-by-step explanation:

Euclids Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers. HCF of two positive integers a and b is the largest positive integer d that divides both a and b.

Theorem : If a and b are positive integers such that a = bq + r, then every common divisor of a and b is a common divisor of b and r, and vice-versa.