Polynomial

A polynomial in one variable $x$ is a function Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle f(x)} of the form:

$f(x)=a_{n}x^{n}+a_{n-1}x^{n-1}+...+a_{2}x^{2}+a_{1}x+a_{0}$

In elementary mathematics, the coefficients $a_{i}$ are typically chosen to be real or complex numbers. However, it makes sense to define a polynomial with coefficients in any ring.

The largest power of Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle x} that appears in the polynomial is called the degree of the polynomial.

• Example: Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle f(x) = 4x^3-3x+1} is a degree 3 polynomial with integer coefficients.

A polynomial in two variables Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle x,y} is, similarly, a finite sum

$\sum a_{ij}x^{i}y^{j}$, where the coefficients Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle a_{ij}} are elements of some ring. Polynomials in 3 or more variables are defined similarly.

When we substitute a value b into the polynomial f(x) then we get an actual number as output. This number is the value $a_{n}b^{n}+a_{n-1}b^{n-1}+...+a_{2}b^{2}+a_{1}b+a_{0}$. This process is called "evaluating the polynomial at b".

Some algorithms are said to perform in polynomial time. There are algorithms which can factor polynomials in an amount of time that is a polynomial n^k.