Questions tagged [polynomials]

For both basic and advanced questions on polynomials in any number of variables, including, but not limited to solving for roots, factoring, and checking for irreducibility.

Usually, polynomials are introduced as expressions of the form $\sum_{i=0}^dc_ix^i$ such as $15x^3 - 14x^2 + 8$. Here, the numbers are called coefficients, the $x$'s are the variables or indeterminates of the polynomial, and $d$ is known as the degree of the polynomial. In general the coefficients may be taken from any ring $R$ and any finite number of variables is allowed. The set of all polynomials in $n$ variables $X_1,\ldots,X_n$ over a ring $R$ is denoted by $R[X_1,\ldots,X_n]$. Strictly speaking this is a formal sum, because the variables do not represent any value. Nevertheless, the variables of a polynomial obey the usual arithmetic laws in a ring (like commutativity and distributivity). This makes $R[X_1,\ldots,X_n]$ a ring itself. One should note that $R[X_1][X_2]=R[X_1,X_2]$. This idea can be extended to $R[X_1,\ldots,X_n]$ in a very natural way.

An expression of the form $rX_1^{i_1}X_2^{i_2}\cdots X_n^{i_n}$ ($r\in R$) is called a term (of the polynomial). Polynomials are defined to have only finitely many terms. An expression with infinitely many different terms is generally not considered to be a polynomial, but a (formal) power series in one or more variables.

When $P\in R[X]$, $P(x)$ is the evaluation of $P$ at $x$ (pronounced $P$ of $x$, or simply $Px$). Here $x$ does not necessarily have to be an element of $R$. For $P(x)$ to be properly defined for an $x$ in some ring $S$ we need:

  • a homomorphism $\phi:R\to S$
  • the image of all coefficients of $P$ under $\phi$ should commute with $x$.

Evaluation is now simply performed by replacing all coefficients $r_i$ of $P$ by $\phi(r_i)$ and all appearances of $X$ by $x$. This quite naturally gives an expression that is well defined as an element of $S$. The concept of evaluation is naturally extended to $R[X_1,\ldots,X_n]$.

26755 questions
4
votes
1 answer

Prove that the number of distinct integer roots of $P^2(x)-1$ is at most $d+2$.

Let $P(x)$ be a polynomial with integer coefficients of degree $d>0$. Prove that the number of distinct integer roots of $P^2(x)-1$ is at most $d+2$. My approach: Note that $P^2(x)-1=(P(x)-1)(P(x)+1), \forall x.$ Now since $\deg P(x)=d\implies…
4
votes
1 answer

Galois group of special polynomials

I checked the Galois groups of the polynomials $f(m,n) := mx^{(n-m)}+(m+1)x^{(n-m-1)}+...+(n-1)x+n$ for $0 < m < n$, and I only found one polynomial whose galois group is NOT the symmetric group, namely $x^{6} + 2x^{5} + 3x^{4} + 4x^{3} + 5x^{2} +…
Peter
  • 41
4
votes
1 answer

Polynomial with Certain Conditions

Is it possible to create a polynomial $p(x)$, in terms of $a,b,c \geq0, \in\mathbb{R}$ and $\epsilon >0, \in \mathbb{R}$, has a fixed degree (aka, a degree $n$ that does not depend on $a,b,c, \epsilon$), $p(0)=a$, and on $[b,c]$, $|p(x)| \leq…
DUO Labs
  • 788
4
votes
1 answer

Suppose $P(x)$ is a polynomial with $P(2)=2017$ and $P(5)=2002$. If it is given that $P(x)=0$ has exactly one integer root, find that root.

Question: Suppose $P(x)$ is a polynomial with $P(2)=2017$ and $P(5)=2002$. If it is given that $P(x)=0$ has exactly one integer root, find that root. My approach: I tried solving the problem by considering that $P(x)\in\mathbb{Z}[x]$ and that…
4
votes
2 answers

How come the Bernstein operator creates a polynomial of the same degree as its input function?

This is a copy of the following question on the Computer Science Stack Exchange: https://cs.stackexchange.com/questions/11655/how-come-the-bernstein-operator-creates-a-polynomial-of-the-same-degree-as-its-i The original answer left me a bit puzzled,…
robrene
  • 43
4
votes
1 answer

Polynomial $f(x)$ divides $f(x^2)$, how to generate all $f(x)$ of degree 3 and 4 efficiently?

Suppose we have a monic polynomial $f(x)$. Given that $f(x)$ divides $f(x^2)$, is there an efficient way to generate a complete list of all such polynomials of degree 3 and 4? My friend showed me this problem without the degree part, and I was able…
4
votes
1 answer

Derivative of a homogeneous polynomial map

Let $K$ be a field and $V$ be a linear space over $K$. A map $p\colon V \to K$ is homogeneous polynomial of degree $n$ if there exist the symmetric $n$-linear form $f\colon V^{\times n}\to K$ such that $p(x)=f(x,x,\ldots,x)$ for any $x\in V$. The…
4
votes
0 answers

Polynomial cube equation

2 cubes have all sides and bases painted. One cube's side length is 4 cm longer than the other cube's side length. If the larger cube needed 56 square cm more paint than the smaller cube, what is the side length of the smaller cube? if the side…
math123
  • 51
4
votes
2 answers

Does Polynomial Remainder Theorem work with divisors that are quadratic?

The Polynomial Remainder Theorem states that the remainder of the division of a polynomial $f(x)$ by a linear polynomial $x - r$ is equal to $f(r)$. In particular, $x-r$ divides $f(x) \iff f(r)=0$ But what if the divisor is not linear and of a…
user654528
4
votes
4 answers

What is the intuition behind lack of a general solution for 5th and above degree polynomials?

I am aware this is a pretty big topic, but the attempts at layman's explanations I have seen either barely provide commentary on the formal proofs, or fail to provide an explanation (e.g "it gets too complex" does not really say anything) Is there a…
Layman
  • 137
4
votes
3 answers

How do I show $ x^3-tx^2+(t-3)x+1 $ is irreducible? (Shanks' simplest cubic)

Let $K = {\mathbb Q}[t]$. Show $x^3 - tx^2 + (t-3)x + 1$ is irreducible in $K[x]$. I tried substitution with $x-t$ and other things, hoping to use Eisenstein's criterion to finish the job. But I have not made much progress. Can I get a hint? Thank…
Steven Li
  • 425
  • 4
  • 14
4
votes
1 answer

Can the roots to the polynomial $x^6 - x^5 - x^4 - x^3 - x^2 - x - 1$ be found in terms of radicals?

I have been trying to derive a closed-form expression for a linear recurrence relation (this was originally motivated by an attempt to reduce the time complexity on a competitive programming question, whose naive solution is a Dynamic Programming…
4
votes
3 answers

Remainder of polynomial product, CRT solution via Bezout

Given: $$f(x) \pmod{x^2 + 4} = 2x + 1$$ $$f(x) \pmod{x^2 + 6} = 6x - 1$$ Define r(x) as: $$f(x) \pmod{(x^2 + 4)(x^2+6)} = r(x)$$ What is $r(4)$? The 3 equations can be restated as quotient · divisor + remainder: $$f(x) = a(x)(x^2 + 4) + 2x + 1…
rcgldr
  • 546
4
votes
1 answer

Finding $P(1)$, why do options say that I'm wrong?

A polynomial $P(x)$ has the leading coefficent of $1$ and is second degree polynomial. $2+i$ makes $P(x)$ zero. Polynomial $P(x)$ has real coefficients Find $P(1)$ So we know that conjugate of complex root will be the other root. Hence, $$P(x) =…
4
votes
3 answers

Relation between roots and coefficients - manipulation of identities

The polynomial $x^3+3x^2-2x+1$ has roots $\alpha, \beta, \gamma$ . Find $$\alpha^2(\beta + \gamma) + \beta^2(\alpha + \gamma) + \gamma^2(\alpha + \beta)$$ I tried finding the relation using $-b/a$, $c/a$ and $-d/a$. I couldn’t seem to find…