Define Euclid's Division Algorithms
@Dixer_
kuch ni bro @Shivamdhasmana and baki sari bhi deletion pe dal dunga...
Goodbye nd enjoy pts
Answers
Answered by
0
Answer:
Euclid's Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers. HCF of two positive integers a and b is the largest positive integer d that divides both a and b
Step-by-step explanation:
mark as brainlist
Answered by
3
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.
Bhaiya brainliest malk kaldo ...
Appki behen hu ...following dekh Kai pata laga saktai ho ..konchi
Similar questions