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.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
