Content (algebra): Difference between revisions
Jump to navigation
Jump to search
imported>Richard Pinch (New article, my own wording from Wikipedia) |
imported>Richard Pinch (remove WPmarkup; subpages) |
||
| Line 1: | Line 1: | ||
{{subpages}} | |||
In [[algebra]], the '''content''' of a [[polynomial]] is the [[highest common factor]] of its coefficients. | In [[algebra]], the '''content''' of a [[polynomial]] is the [[highest common factor]] of its coefficients. | ||
| Line 9: | Line 10: | ||
* {{cite book | author=Serge Lang | authorlink=Serge Lang | title=Algebra | edition=3rd ed. | publisher=[[Addison-Wesley]] | year=1993 | isbn=0-201-55540-9 | page=181 }} | * {{cite book | author=Serge Lang | authorlink=Serge Lang | title=Algebra | edition=3rd ed. | publisher=[[Addison-Wesley]] | year=1993 | isbn=0-201-55540-9 | page=181 }} | ||
* {{cite book | author=David Sharpe | title=Rings and factorization | publisher=[[Cambridge University Press]] | year=1987 | isbn=0-521-33718-6 | pages=68-69 }} | * {{cite book | author=David Sharpe | title=Rings and factorization | publisher=[[Cambridge University Press]] | year=1987 | isbn=0-521-33718-6 | pages=68-69 }} | ||
Revision as of 14:00, 29 October 2008
In algebra, the content of a polynomial is the highest common factor of its coefficients.
A polynomial is primitive if it has content unity.
Gauss's lemma for polynomials may be expressed as stating that for polynomials over a unique factorization domain, the content of the product of two polynomials is the product of their contents.
References
- B. Hartley; T.O. Hawkes (1970). Rings, modules and linear algebra. Chapman and Hall. ISBN 0-412-09810-5.
- Serge Lang (1993). Algebra, 3rd ed.. Addison-Wesley. ISBN 0-201-55540-9.
- David Sharpe (1987). Rings and factorization. Cambridge University Press, 68-69. ISBN 0-521-33718-6.