Abstract

ABSTRACT We propose some generalizations of the classical Division Algorithm for polynomials over coefficient rings (possibly non-commutative). These results provide a generalization of the Remainder Theorem that allows calculating the remainder without using the long division method, even if the divisor has degree greater than one. As a consequence we obtain an extension of the classical Factor Theorem that provides a general divisibility criterion for polynomials. Finally, we will refer to some applications of these results for evaluating and dividing on skew polynomial rings. The arguments can be used in basic algebra courses and are suitable for building classroom/homework activities.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.