Question

What is Euclids division leema?

Answer 1

Hey Mates,

Here is your answer....

__________________________________________

★ Euclid Division Lemma:

→ It is used to calculate the Highest Common Factor (HCF) of two positive integers a and b we use Euclid's division algorithm.

→ HCF is the largest number which exactly divides two or more positive integers.

→ It should be formula:

a = bq +r

__________________________________________

♦ hope its help you.

♦ so please keep asking your problems in brainly..

$<marquee>plz, select brainlist if you want..$

Answer 2

hlo mate here is ur ans. ...........

Euclids division lemma is the process of division of 2 integers which produces the quotient and a remainder smaller than divisor... . .

Euclids division lemma :-a=bq+r

where b=given no

q=quotient

r=remainder

hope this helps u. .........

pls mark it as brainliest. .......