If p(x) and g(x) are two polynomials such that degree of p(x) ≥ degree of g(x) and g(x) ≠ 0, then we can find polynomials q(x) and r(x) such that:p(x) = g(x)q(x) + r(x),where r(x) = 0 or degree of r(x) < degree of g(x). Here we say that p(x) divided by g(x), gives q(x) as quotient and r(x) as remainder. *
This is known as division lemma.
This is given by Euclid.
Both of above statements are true.
None of these.
Answers
Answered by
0
Answer:
option a
Step-by-step explanation:
this is known as division lemma.
Euclid's division lemma based on integers
Similar questions