what is difference between a euclid division Lemma and euclid division algorithm.?
Answers
Answered by
3
Lemma is a proven statement used for proving another statement while algorithm is a series of well defined steps which gives a procedure for solving a type of a problem.
Euclid's division lemma: For given any positive integers a and b there exist unique integers q and r satisfying a = bq + r, 0 ≤ r < b.
Euclid's division algorithm is used for finding the Highest Common Factor of two numbers where in we apply the statement of Euclid's division lemma.
hope it helps u mate....
plz mark me brainliest
Euclid's division lemma: For given any positive integers a and b there exist unique integers q and r satisfying a = bq + r, 0 ≤ r < b.
Euclid's division algorithm is used for finding the Highest Common Factor of two numbers where in we apply the statement of Euclid's division lemma.
hope it helps u mate....
plz mark me brainliest
Answered by
1
According to Euclid's Division Lemma if we have two positive integers a and b, then there exist unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r ≤ b. ...
Euclids Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers. Recall that the HCF of two positive integers a and b is the largest positive integer d that divides both a and b.
Euclids Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers. Recall that the HCF of two positive integers a and b is the largest positive integer d that divides both a and b.
Similar questions
Social Sciences,
7 months ago
Biology,
7 months ago
Social Sciences,
7 months ago
English,
1 year ago