265
Views
1
CrossRef citations to date
0
Altmetric
Classroom Notes

General remainder theorem and factor theorem for polynomials over non-commutative coefficient rings

ORCID Icon, ORCID Icon & ORCID Icon
Pages 775-785 | Received 24 Apr 2019, Published online: 20 Oct 2019
 

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.

2010 MATHEMATICS SUBJECT CLASSIFICATIONS:

Disclosure statement

No potential conflict of interest was reported by the authors.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 372.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.