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
3
votes
3 answers

Polynomial System has only isolated solutions

How does one show that the polynomial system $F(x)=0,$ where $F:\mathbb{C}^n \rightarrow \mathbb{C}^n,$ has only isolated roots? As an example, let…
Suresh
  • 373
3
votes
1 answer

Ordered Pairs of Polynomials

Professor proposed this problem to the class today. Suppose we had $P_1(x), P_2(x) \in \mathbb{Z[x]}$, $n, a \in \mathbb{Z}$. How many ordered pairs exist such that $(P_1(x))^2+(P_2(x))^2=(x^n-a)^2$? Of course, there exist trivial pairs, such as…
3
votes
2 answers

$x\in \mathbb{R} : P(x) \in \mathbb{Z} \Leftrightarrow Q(x) \in \mathbb{Z}$. Prove that $P(x)-Q(x)=c \in \mathbb{Z}$ or...

$P(x),Q(x)$ are two polynomials such that $x\in \mathbb{R} : P(x) \in \mathbb{Z} \Leftrightarrow Q(x) \in \mathbb{Z}$. Prove that $P(x)-Q(x)=c$ or $P(x)+Q(x)=d, $ where $c,d \in \mathbb{Z}$.
Road Human
  • 1,012
3
votes
3 answers

Polynomial equation

Is it possible to find polynomials with rational coefficients $P(x),Q(x)$ such that $Px^3+Px^2+Qx+2Q=1$? I have trying in vain to find one by inspection, but that might just be me.
Bob
  • 33
3
votes
0 answers

Polynomial curiosity

Let $R$ be a unitary commutative ring (or take a field if this is easier), denote by $\mathcal{S}_{R,d}$ the set of $P\in R[X]$, $P=X^d+z_{d-1}X^{d-1}+\cdots +z_0$, such that for all $i\in \{0,\ldots, d-1\}$, $P(z_i)=0$. Have the sets…
3
votes
1 answer

Can galois theory actually help you solve a quintic or can it only tell you whether it is solvable?

Does galois theory actually have some involvement in solving a solvable quintic, or does it just tell you whether it IS solvable or not?
Kenny
  • 727
3
votes
1 answer

Product of Polynomials in Several Variables?

Let $p$ and $q$ be the polynomials $\mathbb R$ given by: $$p(x)=\sum_{j=0}^m a_j x^j\quad \textrm{and}\quad q(x)=\sum_{j=0}^n b_j x^j.$$ We know that $$p(x)\cdot q(x)=\sum_{j=0}^{m+n} \left(\sum_{k+\ell=j} a_k b_\ell\right) x^j. $$ What would be the…
PtF
  • 9,655
3
votes
0 answers

Polynomial approximation on (0,1)

Consider a polynomial in $x$ $$ x\mapsto\sum_{n=0}^{N}a_{n}x^{n}. $$ Suppose the root of this polynomial is in $\left(0,1\right)$. Suppose further that we approximate the root of this polynomial by $\tilde{y}$, attained by dropping high order…
3
votes
2 answers

Proving a property of any integer polynomial

I suppose this property has it's name , so i apologize in advance for the ambiguous title. Suppose we are given a integer polynomial $P$ and three different arbitrary integers $a,b,c$ prove that the following is never true $$P(a)=b, P(b)=c,…
3
votes
1 answer

what factor do trinomial have in common?

What factor do the following trinomials have in common? $$4x^2+13x+3\, \text{ and }\, 8x^2+22x-6$$ My try: $$4x^2 + 13x +3 = (4x+1)(x+3)$$ $$8x^2 + 22x - 6 = 2(4x-1)(x+3)$$ The trinomials have no common factor.
GD07
  • 61
3
votes
4 answers

Does there exist an explicit formula for the coefficient of $x^k$ in the square of a polynomials?

So let's say we have a polynomial $P(x)$ of degree $n$, and we have: $$P(x)=\sum_{k=0}^{n}a_k x^k$$ I know that if you square $P(x)$, you get: $$P(x)^2=\sum_{k=0}^n \sum_{l=0}^na_ka_lx^{k+l}$$ However I am wondering if there exists an explicit…
ASKASK
  • 9,000
  • 4
  • 28
  • 49
3
votes
3 answers

Proof that linear polynomial has exactly one root

How can one prove that all linear polynomials have exactly one root? This is geometrically intuitive (just rotate a line around the x axis) however I'm not sure how to formally prove this.
3
votes
2 answers

How do I solve this rational division question?

I'm solving this rational expression question and I'm stuck. What should I do next? My work is below. Thank you!
3
votes
5 answers

Polynomials $X^n$ and $(1-X)^n$ are coprime

Let $n\in \mathbb N-\{0\}$ . How can we show that the polynomials $X^n$ and $(1-X)^n$ are coprime? Do we have to do an induction on $n$? it is clear that $X$ and $(1-X)$ are coprime by Euclid's algorithm. We can write…
palio
  • 11,064
3
votes
3 answers

How can I prove that $g(\zeta)\in\mathbb R\implies g(\zeta)=h(\zeta+\bar\zeta)$

How can I prove that if $g(X)\in \mathbb Q[X]$ and $\zeta\in\mathbb C\backslash \mathbb R$, therefore $$g(\zeta)\in\mathbb R\implies g(\zeta)=h(\zeta+\bar\zeta)$$ for a certain polynomial $h(X)\in\mathbb Q[X]$ ? Let $$g(X)=a_0+a_1X+...+a_nX^n,$$ I…
idm
  • 11,824