We propose a divisibility criterion for elements of a generic Unique Factorization Domain. As a consequence, we obtain a general divisibility criterion for polynomials over Unique Factorization Domains. The arguments can be used in basic algebra courses and are suitable for building classroom/homework activities for college and high school…

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…