Define Euclid's Division Algorithms.
.
.
.
Sorry :(
Mai sabse baat krta hu
Khadus nai hu...
_____________
Karthik bro_hnji bolo
Answers
Answered by
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.
Similar questions