Question

Define Euclid's Division Algorithms :–

Le sanju pts lele...​

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.

Itne pts meko roj log in krne se milte h -,-*

mein oph ja rhi

aake old account se le lungy xD

Answer 2

Answer:

I don't know this ans I need point that's why