A DIVISION ALGORITHM
2005 ◽
Vol 04
(04)
◽
pp. 441-449
◽
A divisibility test of Arend Heyting, for polynomials over a field in an intuitionistic setting, may be thought of as a kind of division algorithm. We show that such a division algorithm holds for divisibility by polynomials of content 1 over any commutative ring in which nilpotent elements are zero. In addition, for an arbitrary commutative ring R, we characterize those polynomials g such that the R-module endomorphism of R[X] given by multiplication by g has a left inverse.
2019 ◽
Vol 56
(2)
◽
pp. 252-259
Keyword(s):
1984 ◽
Vol 7
(2)
◽
pp. 403-406
Keyword(s):
1971 ◽
Vol 14
(3)
◽
pp. 349-352
◽
Keyword(s):
1979 ◽
Vol 28
(4)
◽
pp. 423-426
◽
Keyword(s):
2021 ◽
Vol 36
(4)
◽
pp. 521-536
Keyword(s):
Keyword(s):