Content (algebra): Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Richard Pinch
(New article, my own wording from Wikipedia)
 
mNo edit summary
 
(One intermediate revision by one other user not shown)
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 8: Line 9:
* {{cite book | author=B. Hartley | authorlink=Brian Hartley | coauthors=T.O. Hawkes | title=Rings, modules and linear algebra | publisher=Chapman and Hall | year=1970 | isbn=0-412-09810-5 }}
* {{cite book | author=B. Hartley | authorlink=Brian Hartley | coauthors=T.O. Hawkes | title=Rings, modules and linear algebra | publisher=Chapman and Hall | year=1970 | isbn=0-412-09810-5 }}
* {{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 }}[[Category:Suggestion Bot Tag]]
 
[[Category:Algebra]]
[[Category:Polynomials]]
 
{{algebra-stub}}

Latest revision as of 17:00, 1 August 2024

This article is a stub and thus not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article is under development and subject to a disclaimer.

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