Question

Define Euclid's Division Algorithms

Kaise kahun ishq mai tere hu kitna betaab mai

ankho se ankhe milake churalu tere khwab mai...

xD koi on h ?​

Answer 1

Answer:

khoon pilo hadiyan khalo

Step-by-step explanation:

jehar pilo hehehe Ma on hu

Answer 2

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.

If you find this helpful,

1)drop some thanks.

2) Fol. low me .

3) Mark me as the brainliest

answer

Answered by

@gouthamgamerz1.