Abstract
In the previous chapter we have seen that the integers possess a division algorithm and that from this division algorithm there may be derived a Euclidean Algorithm for finding the greatest common divisor of two given integers. ‘Polynomials’ share many properties in common with the integers, having a division algorithm and a corresponding Euclidean Algorithm. As our treatment of polynomials proceeds, initially somewhat informally, it will become apparent that we need to consider much more precisely the extent to which integers and polynomials share common features. In this way we shall be led to enunciate axioms for an algebraic system called a ‘ring’ and for a ring of a particular type called an ‘integral domain’ which incorporates some of the features common to integers and polynomials.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag London
About this chapter
Cite this chapter
Wallace, D.A.R. (1998). Introduction to Rings. In: Groups, Rings and Fields. Springer Undergraduate Mathematics Series. Springer, London. https://doi.org/10.1007/978-1-4471-0425-4_3
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0425-4_3
Publisher Name: Springer, London
Print ISBN: 978-3-540-76177-8
Online ISBN: 978-1-4471-0425-4
eBook Packages: Springer Book Archive