Division algorithm of Polynomials

if p(x) , g(x) are two polynomial such that g(x) $\ne$   0  and degree of p(x) is more than or equal to the degree g(x) 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) is less than the degree of g(x). 
This result is known as

• remainder theorem

• Fundamental theorem of Algebra.

• Division algorithm of Polynomials

• Euclid's Division algorithm

p(x) be a polynomial such that

p(x) = g(x). q(x) +r(x) .Degree of p(x) =

• Degree of g(x).degree of q(x)

• Degree of r(x) +degree of g(x)

• Degree of q(x) + degree of r(x)

• Degree of g(x) + degree of q(x)

Tags

CCSS.HSA.APR.D.6

let p(x) = g(x)q(x) +r(x). If degree of p(x) is 6 and degree of g(x) is 2 then degree of q(x) is

• 2

• 3

• 4

• 5

let p(x) = g(x)q(x) +r(x). If degree of p(x) is 6 and degree of g(x) is 3 then degree of r(x) cannot be

• 0

• 1

• 2

• 3

let p(x) = g(x)q(x) +r(x). If degree of q(x) is 6 and degree of g(x) is 2 then degree of p(x) is

• 6

• 8

• 10

• 12

let p(x) = g(x)q(x) +r(x). If degree of p(x) is 6 and degree of g(x) is 3 degree of r(x) is 1then degree of q(x) is

• 1

• 2

• 3

• 4

let p(x) = g(x)q(x) +r(x). If g(x) is factor of p(x) then degree of r(x) is

• 2

• 1

• 0

• r(x) is a zero polynomial

let p(x) = g(x)q(x) +r(x). If degree of p(x) is 7 and degree of degree of r(x) is 2 then degree of g(x) cannot be

• 5

• 4

• 3

• 2

let p(x) = g(x)q(x) +r(x). If degree of p(x) is 6 g(x) =x-3 then the degree of q(x) is

• 2

• 3

• 4

• 5

let p(x) = g(x)q(x) +r(x). If degree of p(x) is 6, g(x) =4x-3 then the degree of r(x) is

• less than 4

• less than 3

• less than 2

• less than 1