Question

$\huge\color{cyan}\boxed{\colorbox{black}{Question ❤}}$

What do u mean by Euclid's divisions algorithms ?

plz give me thanks in my Maths answers...​

Answer 1

EUCLID'S DIVISIONS ALGORITHMS :-

It 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. Let's learn more about it in this lesson.

_________________________

What is Euclid's Division Lemma ?

___________________________________

Euclid’s Division Lemma (lemma is like a theorem) says that given two positive integers a and b, there exist unique integers q and r such that 

a = bq + r, 0≤ r <b. 

The integer q is the quotient and the integer r is the remainder. The quotient and the remainder are unique.

In simple words, Euclid's Division Lemma is what you were using to check the accuracy of division in lower classes, which is

Dividend = Divisor × Quotient + Remainder. 

When we divide a = 39 by b=5, we get the quotient as q = 7 and the remainder as r = 4. 

Here is an example:- it is in the attachment...

Hope it helps...

have a wonderful journey ahead

___________________

Answer 2

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 ...

hope this answer will help you ...