1.having the character of a polynomial"a polynomial expression"
1.a mathematical function that is the sum of a number of terms
Advertizing ▼
PolynomialPol`y*no"mi*al (?), n. [Poly + nomial, as in monomial, binomial: cf. F. polynôme.] (Alg.) An expression composed of two or more terms, connected by the signs plus or minus; as, a2  2ab + b2.
PolynomialPol`y*no"mi*al, a.
1. Containing many names or terms; multinominal; as, the polynomial theorem.
2. Consisting of two or more words; having names consisting of two or more words; as, a polynomial name; polynomial nomenclature.
Advertizing ▼
definition of Wikipedia
Models, Polynomial • biquadratic polynomial • degree of a polynomial • homogeneous polynomial • monic polynomial • quadratic polynomial • quartic polynomial
Additive polynomial • Alexander polynomial • All one polynomial • Allone polynomial • Auxiliary polynomial • B polynomial • Bpolynomial • Bernstein polynomial • Bernstein–Sato polynomial • Bracket polynomial • Caloric polynomial • Characteristic polynomial • Characteristic polynomial of a graph • Charlier polynomial • Cyclotomic polynomial • Dickson polynomial • Differential polynomial • Ehrhart polynomial • Enumerator polynomial • Equally spaced polynomial • Exponential polynomial • Fekete polynomial • Gauss lemma (polynomial) • Gauss's lemma (polynomial) • Generic polynomial • Gromov theorem on groups of polynomial growth • Gromov's theorem on groups of polynomial growth • HOMFLY polynomial • Hahn polynomial • Hall–Littlewood polynomial • Harmonic polynomial • Hilbert polynomial • Hirzebruch Lpolynomial • Homogeneous polynomial • Hurwitz polynomial • Integervalued polynomial • Interpolating polynomial • Invariant polynomial • Irreducible polynomial • Jones polynomial • Kauffman polynomial • Knot polynomial • Koornwinder polynomial • Kostka polynomial • Krawtchouk polynomial • LLT polynomial • Lag polynomial • Lagrange polynomial • Laurent polynomial • List of polynomial topics • Lommel polynomial • Lusztig–Vogan polynomial • Macdonald–Kostka polynomial • Meixner polynomial • Meixner polynomial of the first kind • Minimal polynomial • Multilinear polynomial • Neumann polynomial • Newton polynomial • Numerical polynomial • Permutation polynomial • PoissonCharlier polynomial • Polynomial Diophantine equation • Polynomial and rational function modeling • Polynomial arithmetic • Polynomial basis • Polynomial chaos • Polynomial code • Polynomial expression • Polynomial functor • Polynomial identity ring • Polynomial interpolation • Polynomial long division • Polynomial matrix • Polynomial recurrence • Polynomial regression • Polynomial remainder theorem • Polynomial ring • Polynomial sequence • Polynomial time • Polynomial time approximation scheme • Polynomial time equivalent • Polynomial time reduction • Polynomialtime algorithm for approximating the volume of convex bodies • Polynomialtime approximation scheme • Polynomialtime equivalent • Polynomialtime reduction • Prime polynomial • Primitive polynomial • Properties of polynomial roots • Pseudopolynomial time • Pseudopolynomialtime • QCharlier polynomial • QRacah polynomial • Quadratic polynomial • Quasipolynomial time • Racah polynomial • Radical polynomial • Reciprocal polynomial • Rook polynomial • Sato polynomial • SatoBernstein polynomial • Schur polynomial • Separable polynomial • Skew Schur polynomial • Sparse binary polynomial hashing • Spread polynomial • Symmetric polynomial • Szego polynomial • Szegő polynomial • Touchard polynomial • Trigonometric polynomial • Unimodular polynomial matrix • Weierstrass polynomial • Weierstraß polynomial • Wilkinson's polynomial • Wilson polynomial • Witt polynomial • Zhegalkin polynomial • Zonal polynomial
expression algébrique (fr)[Classe]
plusieurs (fr)[Caract.]
function, map, mapping, mathematical function, singlevalued function[Hyper.]
multinomial, polynomial[Dérivé]
math, mathematics, maths[Domaine]
multinomial, polynomial[Dérivé]
polynomial (adj.)↕
mathematical sciences[Classe]
(multiplicity; plurality)[Thème]
(much)[Caract.]
(abstract)[termes liés]
équation algébrique (fr)[DomainDescrip.]
mathematics[Domaine]
Function[Domaine]
FieldOfStudy[Domaine]
mathematical relation[Hyper.]
map, represent  multinomial, polynomial  mathematician  mathematical  mathematic, mathematical[Dérivé]
math, mathematics, maths  science, scientific discipline[Domaine]
expression algébrique (fr)[Classe]
plusieurs (fr)[Caract.]
function, map, mapping, mathematical function, singlevalued function[Hyper.]
multinomial, polynomial[Dérivé]
math, mathematics, maths[Domaine]
polynomial (n.)↕
In mathematics, a polynomial is an expression of finite length constructed from variables (also called indeterminates) and constants, using only the operations of addition, subtraction, multiplication, and nonnegative integer exponents. For example, x^{2} − x/4 + 7 is a polynomial, but x^{2} − 4/x + 7x^{3/2} is not, because its second term involves division by the variable x (4/x), and also because its third term contains an exponent that is not an integer (3/2). The term "polynomial" can also be used as an adjective, for quantities that can be expressed as a polynomial of some parameter, as in polynomial time, which is used in computational complexity theory.
Polynomial comes from the Greek poly, "many" and medieval Latin binomium, "binomial".^{[1]}^{[2]}^{[3]} The word was introduced in Latin by Franciscus Vieta.^{[4]}
Polynomials appear in a wide variety of areas of mathematics and science. For example, they are used to form polynomial equations, which encode a wide range of problems, from elementary word problems to complicated problems in the sciences; they are used to define polynomial functions, which appear in settings ranging from basic chemistry and physics to economics and social science; they are used in calculus and numerical analysis to approximate other functions. In advanced mathematics, polynomials are used to construct polynomial rings, a central concept in abstract algebra and algebraic geometry.
A polynomial is either zero, or can be written as the sum of one or more nonzero terms. The number of terms is finite. These terms consist of a constant (called the coefficient of the term) that may be multiplied by a finite number of variables (usually represented by letters), also called indeterminates.^{[5]} Each variable may have an exponent that is a nonnegative integer, i.e., a natural number. The exponent on a variable in a term is called the degree of that variable in that term, the degree of the term is the sum of the degrees of the variables in that term, and the degree of a polynomial is the largest degree of any one term. Since x = x^{1}, the degree of a variable without a written exponent is one. A term with no variables is called a constant term, or just a constant. The degree of a (nonzero) constant term is 0. The coefficient of a term may be any number from a specified set. If that set is the set of real numbers, we speak of "polynomials over the reals". Other common kinds of polynomials are polynomials with integer coefficients, polynomials with complex coefficients, and polynomials with coefficients that are integers modulo of some prime number p. In most of the examples in this section, the coefficients are integers.
For example:
is a term. The coefficient is –5, the variables are x and y, the degree of x is in the term two, while the degree of y is one.
The degree of the entire term is the sum of the degrees of each variable in it, so in this example the degree is 2 + 1 = 3.
Forming a sum of several terms produces a polynomial. For example, the following is a polynomial:
It consists of three terms: the first is degree two, the second is degree one, and the third is degree zero.
The commutative law of addition can be used to freely permute terms into any preferred order. In polynomials with one variable, the terms are usually ordered according to degree, either in "descending powers of x", with the term of largest degree first, or in "ascending powers of x". The polynomial in the example above is written in descending powers of x. The first term has coefficient 3, variable x, and exponent 2. In the second term, the coefficient is –5. The third term is a constant. Since the degree of a nonzero polynomial is the largest degree of any one term, this polynomial has degree two.
Two terms with the same variables raised to the same powers are called "like terms", and they can be combined (after having been made adjacent) using the distributive law into a single term, whose coefficient is the sum of the coefficients of the terms that were combined. It may happen that this makes the coefficient 0, in which case their combination just cancels out the terms. Polynomials can be added using the associative law of addition (which simply groups all their terms together into a single sum), possibly followed by reordering, and combining of like terms. For example, if
then
which can be simplified to
To work out the product of two polynomials into a sum of terms, the distributive law is repeatedly applied, which results in each term of one polynomial being multiplied by every term of the other. For example, if
then
which can be simplified to
The sum or product of two polynomials is always a polynomial.
In general any expression can be considered a polynomial if it is built from variables and constants using only addition, subtraction, multiplication, and raising expressions to constant positive whole number powers. Such an expression can always be rewritten as a sum of terms. For example, (x + 1)^{3} is a polynomial; its standard form is x^{3} + 3x^{2} + 3x + 1.
Division of one polynomial by another does not, in general, produce a polynomial, but rather produces a quotient and a remainder.^{[6]} A formal quotient of polynomials, that is, an algebraic fraction where the numerator and denominator are polynomials, is called a "rational expression" or "rational fraction" and is not, in general, a polynomial. Division of a polynomial by a number, however, does yield another polynomial. For example,
is considered a valid term in a polynomial (and a polynomial by itself) because it is equivalent to and is just a constant. When this expression is used as a term, its coefficient is therefore . For similar reasons, if complex coefficients are allowed, one may have a single term like ; even though it looks like it should be expanded to two terms, the complex number 2 + 3i is one complex number, and is the coefficient of that term.
is not a polynomial because it includes division by a nonconstant polynomial.
is not a polynomial, because it contains a variable used as exponent.
Since subtraction can be replaced by addition of the opposite quantity, and since positive whole number exponents can be replaced by repeated multiplication, all polynomials can be constructed from constants and variables using only addition and multiplication.
A polynomial function is a function that can be defined by evaluating a polynomial. A function ƒ of one argument is called a polynomial function if it satisfies
for all arguments x, where n is a nonnegative integer and a_{0}, a_{1},a_{2}, ..., a_{n} are constant coefficients.
For example, the function ƒ, taking real numbers to real numbers, defined by
is a polynomial function of one argument. Polynomial functions of multiple arguments can also be defined, using polynomials in multiple variables, as in
An example is also the function which, although it doesn't look like a polynomial, is a polynomial function since for every x it is true that (see Chebyshev polynomials).
Polynomial functions are a class of functions having many important properties. They are all continuous, smooth, entire, computable, etc.
A polynomial equation, also called algebraic equation, is an equation in which a polynomial is set equal to another polynomial.
is a polynomial equation. In case of a univariate polynomial equation, the variable is considered an unknown, and one seeks to find the possible values for which both members of the equation evaluate to the same value (in general more than one solution may exist). A polynomial equation stands in contrast to a polynomial identity like (x + y)(x – y) = x^{2} – y^{2}, where both members represent the same polynomial in different forms, and as a consequence any evaluation of both members gives a valid equality. This means that a polynomial identity is a polynomial equation for which all possible values of the unknowns are solutions.
Polynomials serve to approximate other functions, such as sine, cosine, and exponential.
All polynomials have an expanded form, in which the distributive and associative laws have been used to remove all brackets and commutative law has been used to make the like terms adjacent and combine them. All polynomials with coefficients in a unique factorization domain (for example, the integers or a field) also have a factored form in which the polynomial is written as a product of irreducible polynomials and a constant. In the case of the field of complex numbers, the irreducible polynomials are linear. For example, the factored form of
is
over the integers and
over the complex numbers.
Every polynomial in one variable is equivalent to a polynomial with the form
This form is sometimes taken as the definition of a polynomial in one variable.
Evaluation of a polynomial consists of assigning a number to each variable and carrying out the indicated multiplications and additions. Actual evaluation is usually more efficient using the Horner scheme:
In elementary algebra, methods are given for solving all first degree and second degree polynomial equations in one variable. In the case of polynomial equations, the variable is often called an unknown. The number of solutions may not exceed the degree, and equals the degree when multiplicity of solutions and complex number solutions are counted. This fact is called the fundamental theorem of algebra.
A system of polynomial equations is a set of equations in which each variable must take on the same value everywhere it appears in any of the equations. Systems of equations are usually grouped with a single open brace on the left. In elementary algebra, in particular in linear algebra, methods are given for solving a system of linear equations in several unknowns. If there are more unknowns than equations, the system is called underdetermined. If there are more equations than unknowns, the system is called overdetermined. Overdetermined systems are common in practical applications. For example, one U.S. mapping survey used computers to solve 2.5 million equations in 400,000 unknowns.^{[7]}
Viète's formulas relate the coefficients of a polynomial to symmetric polynomial functions of its roots.
Determining the roots of polynomials, or "solving algebraic equations", is among the oldest problems in mathematics. However, the elegant and practical notation we use today only developed beginning in the 15th century. Before that, equations were written out in words. For example, an algebra problem from the Chinese Arithmetic in Nine Sections, circa 200 BCE, begins "Three sheafs of good crop, two sheafs of mediocre crop, and one sheaf of bad crop are sold for 29 dou." We would write 3x + 2y + z = 29.
The earliest known use of the equal sign is in Robert Recorde's The Whetstone of Witte, 1557. The signs + for addition, − for subtraction, and the use of a letter for an unknown appear in Michael Stifel's Arithemetica integra, 1544. René Descartes, in La géometrie, 1637, introduced the concept of the graph of a polynomial equation. He popularized the use of letters from the beginning of the alphabet to denote constants and letters from the end of the alphabet to denote variables, as can be seen above, in the general formula for a polynomial in one variable, where the a 's denote constants and x denotes a variable. Descartes introduced the use of superscripts to denote exponents as well.^{[8]}
Every polynomial P in x corresponds to a function, ƒ(x) = P (where the occurrences of x in P are interpreted as the argument of ƒ), called the polynomial function of P; the equation in x setting f(x) = 0 is the polynomial equation corresponding to P. The solutions of this equation are called the roots of the polynomial; they are the zeroes of the function ƒ (corresponding to the points where the graph of ƒ meets the xaxis). A number a is a root of P if and only if the polynomial x − a (of degree one in x) divides P. It may happen that x − a divides P more than once: if (x − a)^{2} divides P then a is called a multiple root of P, and otherwise a is called a simple root of P. If P is a nonzero polynomial, there is a highest power m such that (x − a)^{m} divides P, which is called the multiplicity of the root a in P. When P is the zero polynomial, the corresponding polynomial equation is trivial, and this case is usually excluded when considering roots: with the above definitions every number would be a root of the zero polynomial, with undefined (or infinite) multiplicity. With this exception made, the number of roots of P, even counted with their respective multiplicities, cannot exceed the degree of P.
Some polynomials, such as x^{2} + 1, do not have any roots among the real numbers. If, however, the set of allowed candidates is expanded to the complex numbers, every nonconstant polynomial has at least one root; this is the fundamental theorem of algebra. By successively dividing out factors x − a, one sees that any polynomial with complex coefficients can be written as a constant (its leading coefficient) times a product of such polynomial factors of degree 1; as a consequence the number of (complex) roots counted with their multiplicities is exactly equal to the degree of the polynomial.
There is a difference between approximating roots and finding exact expressions for roots. Formulas for expressing the roots of polynomials of degree 2 in terms of square roots have been known since ancient times (see quadratic equation), and for polynomials of degree 3 or 4 similar formulas (using cube roots in addition to square roots) were found in the 16th century (see cubic function and quartic function for the formulas and Niccolo Fontana Tartaglia, Lodovico Ferrari, Gerolamo Cardano, and Vieta for historical details). But formulas for degree 5 eluded researchers. In 1824, Niels Henrik Abel proved the striking result that there can be no general (finite) formula, involving only arithmetic operations and radicals, that expresses the roots of a polynomial of degree 5 or greater in terms of its coefficients (see AbelRuffini theorem). In 1830, Évariste Galois, studying the permutations of the roots of a polynomial, extended AbelRuffini theorem by showing that, given a polynomial equation, one may decide if it is solvable by radicals, and, if it is, solve it. This result marked the start of Galois theory and Group theory, two important branches of modern mathematics. Galois himself noted that the computations implied by his method were impracticable. Nevertheless formulas for solvable equations of degrees 5 and 6 have been published (see quintic function and sextic equation).
Numerical approximations of roots of polynomial equations in one unknown is easily done on a computer by the JenkinsTraub method, Laguerre's method, Durand–Kerner method or by some other rootfinding algorithm.
For polynomials in more than one variable the notion of root does not exist, and there are usually infinitely many combinations of values for the variables for which the polynomial function takes the value zero. However for certain sets of such polynomials it may happen that for only finitely many combinations all polynomial functions take the value zero.
For a set of polynomial equations in several unknowns, there are algorithms to decide if they have a finite number of complex solutions. If the number of solutions is finite, there are algorithms to compute the solutions. The methods underlying these algorithms are described in the article systems of polynomial equations. The special case where all the polynomials are of degree one is called a system of linear equations, for which another range of different solution methods exist, including the classical Gaussian elimination.
It has been shown by Richard Birkeland and Karl Meyr that the roots of any polynomial may be expressed in terms of multivariate hypergeometric functions. Ferdinand von Lindemann and Hiroshi Umemura showed that the roots may also be expressed in terms of Siegel modular functions, generalizations of the theta functions that appear in the theory of elliptic functions. These characterisations of the roots of arbitrary polynomials are generalisations of the methods previously discovered to solve the quintic equation.
The statistical properties of the roots of a random polynomial have been the subject of several studies. Let
be a random polynomial. If the coeﬃcients a_{i} are independently and identically distributed with a mean of zero, the real roots are mostly located near ±1. The complex roots can be shown to be located on or close to the unit circle.
If the coeﬃcients are Gaussian distributed with a mean of zero and variance of σ then the mean density of real roots is given by the Kac formula^{[9]}^{[10]}
where
When the coefficients are Gaussian distributed with a non zero mean and variance of σ, a similar but more complex formula is known.
For large n, a number of asymptotic formulae are known. For a fixed x
and
where p( x ) is the mean density of real roots. The expected number of real roots is
where C is a constant approximately equal to 0.6257358072 and O() is the order operator.
This result has been shown by Kac, Erdos and others to be insensitive to the actual distribution of coeﬃcients. Numerical testing of this formula has confirmed these earlier results.
A polynomial function in one real variable can be represented by a graph.
The graph of a nonconstant (univariate) polynomial always tends to infinity when the variable increases indefinitely (in absolute value).
Polynomial graphs are analyzed in calculus using intercepts, slopes, concavity, and end behavior.
The illustrations below show graphs of polynomials.
One important aspect of calculus is the project of analyzing complicated functions by means of approximating them with polynomial functions. The culmination of these efforts is Taylor's theorem, which roughly states that every differentiable function locally looks like a polynomial function, and the StoneWeierstrass theorem, which states that every continuous function defined on a compact interval of the real axis can be approximated on the whole interval as closely as desired by a polynomial function. Polynomial functions are also frequently used to interpolate functions.
Calculating derivatives and integrals of polynomial functions is particularly simple. For the polynomial function
the derivative with respect to x is
and the indefinite integral is
In abstract algebra, one distinguishes between polynomials and polynomial functions. A polynomial f in one variable X over a ring R is defined as a formal expression of the form
where n is a natural number, the coefficients are elements of R, and X is a formal symbol, whose powers X^{i} are just placeholders for the corresponding coefficients a_{i}, so that the given formal expression is just a way to encode the sequence , where there is an n such that a_{i} = 0 for all i > n. Two polynomials sharing the same value of n are considered equal if and only if the sequences of their coefficients are equal; furthermore any polynomial is equal to any polynomial with greater value of n obtained from it by adding terms in front whose coefficient is zero. These polynomials can be added by simply adding corresponding coefficients (the rule for extending by terms with zero coefficients can be used to make sure such coefficients exist). Thus each polynomial is actually equal to the sum of the terms used in its formal expression, if such a term a_{i}X^{i} is interpreted as a polynomial that has zero coefficients at all powers of X other than X^{i}. Then to define multiplication, it suffices by the distributive law to describe the product of any two such terms, which is given by the rule
Thus the set of all polynomials with coefficients in the ring R forms itself a ring, the ring of polynomials over R, which is denoted by R[X]. The map from R to R[X] sending r to rX^{0} is an injective homomorphism of rings, by which R is viewed as a subring of R[X]. If R is commutative, then R[X] is an algebra over R.
One can think of the ring R[X] as arising from R by adding one new element X to R, and extending in a minimal way to a ring in which X satisfies no other relations than the obligatory ones, plus commutation with all elements of R (that is Xr = rX). To do this, one must add all powers of X and their linear combinations as well.
Formation of the polynomial ring, together with forming factor rings by factoring out ideals, are important tools for constructing new rings out of known ones. For instance, the ring (in fact field) of complex numbers, which can be constructed from the polynomial ring R[X] over the real numbers by factoring out the ideal of multiples of the polynomial X^{2} + 1. Another example is the construction of finite fields, which proceeds similarly, starting out with the field of integers modulo some prime number as the coefficient ring R (see modular arithmetic).
If R is commutative, then one can associate to every polynomial P in R[X], a polynomial function f with domain and range equal to R (more generally one can take domain and range to be the same unital associative algebra over R). One obtains the value f(r) by substitution of the value r for the symbol X in P. One reason to distinguish between polynomials and polynomial functions is that over some rings different polynomials may give rise to the same polynomial function (see Fermat's little theorem for an example where R is the integers modulo p). This is not the case when R is the real or complex numbers, whence the two concepts are not always distinguished in analysis. An even more important reason to distinguish between polynomials and polynomial functions is that many operations on polynomials (like Euclidean division) require looking at what a polynomial is composed of as an expression rather than evaluating it at some constant value for X. And it should be noted that if R is not commutative, there is no (well behaved) notion of polynomial function at all.
In commutative algebra, one major focus of study is divisibility among polynomials. If R is an integral domain and f and g are polynomials in R[X], it is said that f divides g or f is a divisor of g if there exists a polynomial q in R[X] such that f q = g. One can show that every zero gives rise to a linear divisor, or more formally, if f is a polynomial in R[X] and r is an element of R such that f(r) = 0, then the polynomial (X − r) divides f. The converse is also true. The quotient can be computed using the Horner scheme.
If F is a field and f and g are polynomials in F[X] with g ≠ 0, then there exist unique polynomials q and r in F[X] with
and such that the degree of r is smaller than the degree of g. The polynomials q and r are uniquely determined by f and g. This is called Euclidean division, division with remainder or polynomial long division and shows that the ring F[X] is a Euclidean domain.
Analogously, prime polynomials (more correctly, irreducible polynomials) can be defined as polynomials which cannot be factorized into the product of two non constant polynomials. Any polynomial may be decomposed into the product of a constant by a product of irreducible polynomials. This decomposition is unique up to the order of the factors and the multiplication of any constant factors by a constant (and division of the constant factor by the same constant. When the coefficients belong to a finite field or are rational numbers, there are algorithms to test irreducibility and to compute the factorization into irreducible polynomials. These algorithms are not practicable for hand written computation, but are available in any Computer algebra system (see Berlekamp's algorithm for the case in which the coefficients belong to a finite field or the Berlekamp–Zassenhaus algorithm when working over the rational numbers ^{[11]}). Eisenstein's criterion can also be used in some cases to determine irreducibility.
See also: Greatest common divisor of two polynomials.
Polynomials are classified according to many different properties.
One classification of polynomials is based on the number of distinct variables. A polynomial in one variable is called a univariate polynomial, a polynomial in more than one variable is called a multivariate polynomial. These notions refer more to the kind of polynomials one is generally working with than to individual polynomials; for instance when working with univariate polynomials one does not exclude constant polynomials (which may result, for instance, from the subtraction of nonconstant polynomials), although strictly speaking constant polynomials do not contain any variables at all. It is possible to further classify multivariate polynomials as bivariate, trivariate, and so on, according to the maximum number of variables allowed. Again, so that the set of objects under consideration be closed under subtraction, a study of trivariate polynomials usually allows bivariate polynomials, and so on. It is common, also, to say simply "polynomials in x, y, and z", listing the variables allowed. In this case, xy is allowed.
A second major way of classifying polynomials is by their degree. Recall that the degree of a term is the sum of the exponents on variables, and that the degree of a polynomial is the largest degree of any one term.
Degree  Name  Example 

−∞  zero  
(nonzero) constant  
linear  
quadratic  
cubic  
quartic (or biquadratic)  
quintic  
sextic (or hexic)  
septic (or heptic)  
octic  
nonic  
decic  
hectic 
Usually, a polynomial of degree n, for n greater than 3, is called a polynomial of degree n, although the phrases quartic polynomial and quintic polynomial are sometimes used. The use of names for degrees greater than 5 is even less common. The names for the degrees may be applied to the polynomial or to its terms. For example, in the term is a first degree term in a second degree polynomial.
In the context of polynomial interpolation there is some ambiguity when combining the two classifications above. For example, a bilinear interpolant, being the product of two univariate linear polynomials, is bivariate but is not linear; similar ambiguity affects the bicubic interpolant.
The polynomial 0, which may be considered to have no terms at all, is called the zero polynomial. Unlike other constant polynomials, its degree is not zero. Rather the degree of the zero polynomial is either left explicitly undefined, or defined as negative (either –1 or –∞).^{[12]} These conventions are important when defining Euclidean division of polynomials. The zero polynomial is also unique in that it is the only polynomial having an infinite number of roots.
Number of nonzero terms  Name  Example 

zero polynomial  
monomial  
binomial  
trinomial 
If a polynomial has only one variable, then the terms are usually written either from highest degree to lowest degree ("descending powers") or from lowest degree to highest degree ("ascending powers"). A univariate polynomial in x of degree n then takes the general form
where
Here the term c_{n}x^{n} is called the leading term and its coefficient c_{n} the leading coefficient; if the leading coefficient is 1, the univariate polynomial is called monic.
Note that apart from the leading coefficient c_{n} (which must be nonzero or else the polynomial would not be of degree n) this general form allows coefficients to be zero; when this happens the corresponding term is zero and may be removed from the sum without changing the polynomial. It is nevertheless common to refer to c_{i} as the coefficient of x^{i}, even when c_{i} happens to be 0, so that x^{i} does not really occur in any term; for instance one can speak of the constant term of the polynomial, meaning c_{0} even if it is zero.
In the case of polynomials in more than one variable, a polynomial is called homogeneous of degree n if all its terms have degree n. For example, is homogeneous.
Another classification of polynomials is by the kind of constant values allowed as coefficients. One can work with polynomials with integer, rational, real, or complex coefficients, and in abstract algebra polynomials with many other types of coefficients can be defined, such as integers modulo p. As in the classification by number of variables, when working with coefficients for a given set, such as the complex numbers, coefficients from any subset are allowed. Thus is a polynomial with integer coefficients, but it is also a polynomial with complex coefficients, because the integers are a subset of the complex numbers.
Polynomials may also be classified by the number of terms with nonzero coefficients, so that a oneterm polynomial is called a monomial, a twoterm polynomial is called a binomial, and so on. (Some authors use "monomial" to mean "monic monomial".^{[13]})
Polynomials are frequently used to encode information about some other object. The characteristic polynomial of a matrix or linear operator contains information about the operator's eigenvalues. The minimal polynomial of an algebraic element records the simplest algebraic relation satisfied by that element. The chromatic polynomial of a graph counts the number of proper colourings of that graph.
Polynomials can involve more than one variable, in which they are called multivariate. Rings of polynomials in a finite number of variables are of fundamental importance in algebraic geometry which studies the simultaneous zero sets of several such multivariate polynomials. These rings can alternatively be constructed by repeating the construction of univariate polynomials with as coefficient ring another ring of polynomials: thus the ring R[X,Y] of polynomials in X and Y can be viewed as the ring (R[X])[Y] of polynomials in Y with as coefficients polynomials in X, or as the ring (R[Y])[X] of polynomials in X with as coefficients polynomials in Y. These identifications are compatible with arithmetic operations (they are isomorphisms of rings), but some notions such as degree or whether a polynomial is considered monic can change between these points of view. One can construct rings of polynomials in infinitely many variables, but since polynomials are (finite) expressions, any individual polynomial can only contain finitely many variables.
A binary polynomial where the second variable takes the form of an exponential function applied to the first variable, for example P(X,e^{X }), may be called an exponential polynomial.
Laurent polynomials are like polynomials, but allow negative powers of the variable(s) to occur.
Quotients of polynomials are called rational expressions (or rational fractions), and functions that evaluate rational expressions are called rational functions. Rational fractions are formal quotients of polynomials (they are formed from polynomials just as rational numbers are formed from integers, writing a fraction of two of them; fractions related by the canceling of common factors are identified with each other). The rational function defined by a rational fraction is the quotient of the polynomial functions defined by the numerator and the denominator of the rational fraction. The rational fractions contain the Laurent polynomials, but do not limit denominators to powers of a variable. While polynomial functions are defined for all values of the variables, a rational function is defined only for the values of the variables for which the denominator is not null. A rational function produces rational output for any rational input for which it is defined; this is not true of other functions such as trigonometric functions, logarithms and exponential functions.
Formal power series are like polynomials, but allow infinitely many nonzero terms to occur, so that they do not have finite degree. Unlike polynomials they cannot in general be explicitly and fully written down (just like real numbers cannot), but the rules for manipulating their terms are the same as for polynomials.
This article includes a list of references, but its sources remain unclear because it has insufficient inline citations. Please help to improve this article by introducing more precise citations. (April 2010) 
Wikimedia Commons has media related to: Polynomials 
Look up polynomial in Wiktionary, the free dictionary. 

sensagent's content
Dictionary and translator for handheld
New : sensagent is now available on your handheld
Advertising ▼
Webmaster Solution
Alexandria
A windows (popinto) of information (fullcontent of Sensagent) triggered by doubleclicking any word on your webpage. Give contextual explanation and translation from your sites !
SensagentBox
With a SensagentBox, visitors to your site can access reliable information on over 5 million pages provided by Sensagent.com. Choose the design that fits your site.
Business solution
Improve your site content
Add new content to your site from Sensagent by XML.
Crawl products or adds
Get XML access to reach the best products.
Index images and define metadata
Get XML access to fix the meaning of your metadata.
Please, email us to describe your idea.
Lettris
Lettris is a curious tetrisclone game where all the bricks have the same square shape but different content. Each square carries a letter. To make squares disappear and save space for other squares you have to assemble English words (left, right, up, down) from the falling squares.
boggle
Boggle gives you 3 minutes to find as many words (3 letters or more) as you can in a grid of 16 letters. You can also try the grid of 16 letters. Letters must be adjacent and longer words score better. See if you can get into the grid Hall of Fame !
English dictionary
Main references
Most English definitions are provided by WordNet .
English thesaurus is mainly derived from The Integral Dictionary (TID).
English Encyclopedia is licensed by Wikipedia (GNU).
Copyrights
The wordgames anagrams, crossword, Lettris and Boggle are provided by Memodata.
The web service Alexandria is granted from Memodata for the Ebay search.
The SensagentBox are offered by sensAgent.
Translation
Change the target language to find translations.
Tips: browse the semantic fields (see From ideas to words) in two languages to learn more.
last searches on the dictionary :
computed in 0.078s
Advertising ▼