akukei said:
So as a general rule, when you divide a polynomial P(x) by a non-factor polynomial g(x) of degree n, the degree of R(x) is always n-1? If that makes sense...
No. It is at MOST degree (n - 1)
NB: Here r is used instead to distinguish from the n degree polynomial P(x).
P(x) = A(x)Q(x) + R(x)
When you divide a polynomial P(x) of degree n with a polynomial A(x) of degree r. Assuming that A(x) is not a factor of P(x), then the remainder term R(x) will have degree of AT MOST (r - 1). In other words R(x) can have degree (r - 1) or less.
So for example, if you divide a polynomial of degree 5 with a polynomial of degree 3, your remainder R(x) is either a polynomial of degree 2, 1 or a constant.
The reason for this because the remainder R(x) is irreducible if it has a lower degree than A(x). So for example, with the polynomial P(x) of degree 5, when you divide by A(x) which is of degree 3, gives some random polynomials and some random remainder R(x). If R(x) is of degree 3 or higher, then you can divide R(x) further with A(x) (i.e. R(x) is still divisible by A(x)). As soon R(x), goes below degree 3 to say a quadratic or linear polynomial, you can no longer divide it by A(x).
However, in terms of the question you write the (r - 1) degree polynomial for R(x), because you can't be sure which degree it is (the leading co-efficient may be zero) so you write the (r - 1) degree polynomial without loss of generality.
So if you divide by a quadratic, the remainder has a maximum degree of a linear form ax + b, but there stands the possibility that a = 0 (the remainder is constant) and you can only find it out using the given conditions of the question.
Similarly if divide by a cubic, the remainder has a maximum degree of the form ax
2 + bx + c, but there stands the possibility that a = 0 (i.e. remainder takes linear form), or both a = b = 0 (i.e. remainder is constant).