1
Question
___ is used to find the HCF of given set of two polynomials.
Open in App
Solution
The correct option is A Division algorithm
Using a division algorithm one can find the HCF of two polynomials. It states that,
f(x) = g(x) * q(x) + r(x)
where, f(x) = dividend (polynomial of greater degree), g(x) = divisor polynomial, q(x) = quotient polynomial and r(x) = remainder polynomial
According to the concept, if r(x) = 0, then the divisor polynomial acts as a HCF of the two polynomials.
Division algorithm
Using a division algorithm one can find the HCF of two polynomials. It states that,
f(x) = g(x) * q(x) + r(x)
where, f(x) = dividend (polynomial of greater degree), g(x) = divisor polynomial, q(x) = quotient polynomial and r(x) = remainder polynomial
According to the concept, if r(x) = 0, then the divisor polynomial acts as a HCF of the two polynomials.
Suggest Corrections
0
Similar questions
