Question

What is Euclid's Devisions Algorithm ?
.
.
.
.
Aur kaisa ja rha hai din sabka ?​

Answer 1

Answer:

Euclid's division algorithm is a way to find the HCF of two numbers by using Euclid's division lemma. It states that if there are any two integers a and b, there exists q and r such that it satisfies the given condition a = bq + r where 0 ≤ r < b.

Answer 2

Answer:

Euclid's division algorithm is used to find the Highest Common Factor (HCF) of two numbers where we apply the statement of Euclid's division lemma.

Step-by-step explanation:

please do this answer in brainly list