Abstract
In this chapter we further develop our acquaintance with polynomials, especially those with integer coefficients and discover that in many ways, their arithmetic is akin to that of integers: there are coprime polynomials, divisor polynomials, and Diophantine equations in polynomials, and there is even a version of Euclid’s algorithm and a Chinese Remainder Theorem for polynomials.
Full Text
Sign-in/Register to access full text options
Published version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have