explain Euclid s division lemma
Answers
Answered by
4
Heyaa..
Gd mrng
Here's your answer ---->
The basis of the Euclidean division algorithm is Euclid's division lemma. To calculate the Highest Common Factor (HCF) of two positive integers a and b we use Euclid's division algorithm. ... By exactly we mean that on dividing both the integers a and b the remainder is zero.
Hope it helps..
Ples mark brainliest ☺
thank you
thnx
Answered by
2
According to Euclid division lemma
A= BQ+R
where A is dividend
B is divisor
Q is quotient
R is remainder
hope it helps ✌️✌️✌️
hey
Hello
hello to all buddies
hii
Similar questions
According to Euclid’s Division Lemma if we have two positive integers a and b, then there exists unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r ≤ b.