Maths problem..?
Ifp(x) and g(x) are any two polynomials with 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)
This result is known as
1) Euclidean algorithm for division
2)division algorithm for polynomials
3)multiplication algorithm for polynomials
4)none of these
Comments
g(x) = 0 makes no sense in context of p(x) = g(x) q(x) + r(x)
Besides, g(x) = 0 contradicts the statement that "f(x) and g(x) are ANY two polynomials"
——————————————————————————————
I think the statement should be:
If p(x) and g(x) are any two polynomials with g(x) ≠ 0, then we can find (unique) 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)
[In fact, it's enough to say degree of r(x) < degree of g(x)]
This is known as:
2) Division algorithm for polynomials
2)division algorithm for polynomials
your " statement " is impossible to occur...if g(x) = 0 then p(x) = r(x) whose degree > degree of g(x) { which is 0 }