What is Euclid's division lemma?
Answers
Answered by
1
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.
The basis of 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. HCF is the largest number which exactly divides two or more positive integers. By exactly we mean that on dividing both the integers a and b the remainder is zero.
The basis of 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. HCF is the largest number which exactly divides two or more positive integers. By exactly we mean that on dividing both the integers a and b the remainder is zero.
Answered by
3
Heyaa folk,
Interesting Question Dear !
Here's your best answer =>>>
________________________________
☺
Friend !
♣ Dividend = Divisor × Quotient + Remainder.
♣ If s(x) and p (x) are two polynomials such that degree of s(x) is greater than or equal to the degree of p(x) and after dividing s(x) by p(x) the quotient is q(x) then,
s(x) = p(x) × q(x) + r(x), where r(x) = 0 or degree of r(x) < 0.
_________________________________
☺
▪ I'm ACE: no4.
▪ Brainly ranker.
☺
Hope it helps u :)
☺
MARK ME AS BRAINLIEST PLZ PLZ PLZ
Interesting Question Dear !
Here's your best answer =>>>
________________________________
☺
Friend !
♣ Dividend = Divisor × Quotient + Remainder.
♣ If s(x) and p (x) are two polynomials such that degree of s(x) is greater than or equal to the degree of p(x) and after dividing s(x) by p(x) the quotient is q(x) then,
s(x) = p(x) × q(x) + r(x), where r(x) = 0 or degree of r(x) < 0.
_________________________________
☺
▪ I'm ACE: no4.
▪ Brainly ranker.
☺
Hope it helps u :)
☺
MARK ME AS BRAINLIEST PLZ PLZ PLZ
Similar questions