Question

Why euclid's division algorithm works to find the hcf of two numbers?

Answer 1

Answer:

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. c. ... Euclids Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers.

Answer 2

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. c. ... Euclids Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers.