Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Monic polynomial
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Uses == {{hatnote|In this section, "polynomial" is used as a shorthand for [[univariate polynomial]], and, unless explicitly stated the coefficients of the polynomials belong to a fixed [[field (mathematics)|field]].}} Monic polynomials are widely used in [[algebra]] and [[number theory]], since they produce many simplifications and they avoid divisions and denominators. Here are some examples. Every polynomial is [[associated elements|associated]] to a unique monic polynomial. In particular, the [[unique factorization]] property of polynomials can be stated as: ''Every polynomial can be uniquely factorized as the product of its [[leading coefficient]] and a product of monic [[irreducible polynomial]]s.'' [[Vieta's formulas]] are simpler in the case of monic polynomials: ''The {{mvar|i}}th [[elementary symmetric function]] of the [[polynomial root|roots]] of a monic polynomial of degree {{math|n}} equals <math>(-1)^ic_{n-i},</math> where <math>c_{n-i}</math> is the coefficient of the {{math|(nβi)}}th power of the [[indeterminate (variable)|indeterminate]].'' [[Euclidean division of polynomials|Euclidean division]] of a polynomial by a monic polynomial does not introduce divisions of coefficients. Therefore, it is defined for polynomials with coefficients in a [[commutative ring]]. [[Algebraic integer]]s are defined as the roots of monic polynomials with integer coefficients.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)