| Popis: |
This paper is an exploration of the synthetic division in compact form. The main goal was to develop an alternative algorithm on division of polynomials whose dividend is P(x) = a1xn + a2xn−1 + a3xn−2 + ⋯ + anx + an+1 and the divisor is D(x) = b1xm + b2xm−1 + b3xm−2 … + bmx + bm+1 , where n > m, a1 ≠ 0, b1 ≠ 0, and ai′s and bi′s including an+1 and bm+1 are constant. The quotient is in the form Q(x) = q1xn−m + q2xn−m−1 + q3xn−m−2 + ⋯ + qn−mx + qn−m+1 while the remainder is R(x) = r1xm−1 + r2xm−2 + ⋯ + rm−1 + rm. Specifically, this aimed to develop an algorithm using synthetic division in compact arrangement when b1=1 and b1≠1, to provide additional conditions to the problems where the usual synthetic divisions are inappropriate, and to generalize the developed algorithm of dividing polynomials of higher degrees. Basic research was employed in this study. This resulted to the development of alternative algorithm initially for quadratic, cubic and quartic divisors. Also, the conditions on inappropriateness of the usual synthetic division were identified. To wit, (a) the divisor D(x) = b1xm + b2xm−1 + b3xm−2 + ⋯ + bmx + bm−1 is prime or irreducible; (b) in case D(x) is reducible, at least one of the factors of D(x) is irreducible non-linear polynomial; and (c) in case D(x) is reducible and its factors are all linear polynomial (either monic or non-monic), one of them is not a factor of P(x). As a generalized result, the quotient is formulated as Q(x) = q1xn−m + q2xn−m−1 + q3xn−m−2 + ⋯ + qn−mx + qn−m+1 where qn = an − b2qn−1 − ⋯ − bm+1qn−m if b1 = 1 or qn = an−b2qn−1−⋯−bm+1qn−m b1 if b1 ≠ 1 while the remainder is R(x) = r1xm−1 + ⋯ + rm−3x3 + rm−2x2 + rm−1x + rm where r1 = qn−m+2, r2 = qn−m+3, r3 = qn−m+4,…, rm. Hence, the results comprise algorithms, conditions and generalized formula that can be used as alternative method in dividing polynomials with non-linear polynomial divisors. |
