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
5
votes
1 answer

Find a polynomial $p(x,y)$ with image all positive real numbers

Find a polynomial $p(x,y)$ such that for each $(x,y) \in \mathbb{R}^2$ we have $p(x,y) > 0$, and for each $a>0$ $\exists (x,y)$ : $p(x,y) = a$. I see that $p(x,y)$ must have constant, but how can choose $p$ that achieves each positive…
MathDav
  • 556
5
votes
2 answers

Factoring a quartic mod p

Let $h(x)=x^4+12x^3+14x^2-12x+1$, and let $p>5$ be a prime. I want to show $h(x)$ factors into 2 quadratics $\mod p$, if $p \equiv 9,11 \mod 20$, while $h(x)$ factors mod $p$ into 4 linear factors, if $p \equiv 1,19 \mod 20$. I can show $h(x)$ is…
Richard
  • 51
5
votes
1 answer

Factorizing polynomial $x^5+x+1$

I'm given a problem to factorize $$ P(x)=x^5+x+1 $$ I've done the following: $$ P(x)=(x^5+x^4+x^3)-(x^4+x^3+x^2)+(x^2+x+1)= (x^2+x+1)(x^3-x^2+1)$$ Is it possible to prove that this cannot be factorized any further?
5
votes
4 answers

Polynomials, derivatives and repeated roots

I want to describe the polynomials with integer coefficients and the property that $f'(x) \mid f(x)$ (the derivative divides the polynomial). So I know that $f(x)$ divides $g(x)$ if all of $f(x)$'s roots are roots of $g(x)$. I also know that $f'(x)$…
Abelsh
  • 1,043
4
votes
2 answers

Maximum absolute value of polynomial coefficients

Suppose we have a polynomial in integer coefficients $$p = p_0 + p_1 x + p_2 x^2 + \ldots + p_n x^n, p_k \in \mathbb{Z}$$ Now define $M(p)$ as the maximum absolute value of the coefficients of $p$, i.e. $$M(p) = \max \{|p_k| \: |\: 0 \leq k \leq…
Sp3000
  • 1,562
4
votes
2 answers

Dividing a polynomial with $(x^2+1)^2$

I have been given that a polynomial $f(x)$ with real coefficients is divisible by $(x^2+1)$, and that when $f'(x)$ is divided by $(x^2+1)$, we get a remainder of $(x+1)$. I need to prove that $2f(x)+(x-1)(x^2+1)$ is divisible by $(x^2+1)^2$. What I…
4
votes
1 answer

Show that a given polynomial can't have a multiple root occurring more $n-1$ times

Question: Let $x_{1},x_{2},\dots,x_{n}$ be a complex numbers such $x_{i}\neq x_{j},\forall i\neq j$. Show that the following polynomial $$p(x)=(x-x_{1})^2(x-x_{2})^2\cdots…
math110
  • 93,304
4
votes
1 answer

Difficult Polynomial Question

Let $P(x)$ be a polynomial whose degree is 1996. If $P(n) = \frac{1}{n}$ for $n = 1, 2, 3, . . . , 1997$, compute the value of $P(1998).$ I don't even know where to begin... Any and all help would be appreciated, thanks!
4
votes
1 answer

Find the largest value of x given the equation...

Find the largest value of $x$ for which $x^2 + y^2 + z^2 = x + y + z$. What I did was subtract the RHS, to get $$x^2 - x + y^2 - y + z^2 - z = 0$$ $$x^2 - x + \frac{1}{4} + y^2 - y + \frac{1}{4} + z^2 - z + \frac{1}{4} =…
4
votes
3 answers

Equation $3x^4 + 2x^3 + 9x^2 + 4x + 6 = 0$

Solve the equation $$3x^4 + 2x^3 + 9x^2 + 4x + 6 = 0$$ Having a complex root of modulus $1$. To get the solution, I tried to take a complex root $\sqrt{\frac{1}{2}} + i \sqrt{\frac{1}{2}}$ but couldn't get the solution right. Please help me.
4
votes
5 answers

Polynomials Shouldn't Have factors using Rational Root Theorem but it does!

I came across this polynomial $X^4 + X^3 + 2X^2 + X + 1$ I tried to factor it using Rational root theorem, but it seems there are no roots possible. 1 or -1 don't work. But I know for a fact that its composed of $(X^2 + X + 1) * (X^2 + 1)$…
4
votes
2 answers

Polynomial roots in an interval for coefficients spanning a subspace of $\mathbb{R}^n$

Given a polynomial of degree $n$, and the possible coefficients of polynomials are restricted to an interval for each of the degree. Is there a way to estimate number of roots of this polynomial in a given interval $[x_1,x_2]$.
user16409
  • 367
4
votes
6 answers

Show that all real roots of the polynomial $P (x) = x^5 − 10x + 35$ are negative.

I got this problem out of Andreescu's Putnam and Beyond. I solved it differently from the given solution and could not understand the solution. Can you explain what is happening in the last step of the solution? Because P (x) has odd degree, it has…
user1299784
  • 2,009
4
votes
1 answer

If $f(n) \in \mathbb{Z}$ for an infinite number of $n \in \mathbb{Z}$, then $f \in \mathbb{Q}[x]$.

Do you think that the following statement is true? Do you have any idea about the proof? Let $\; f(x) \in \mathbb{C}[x]$ be a polynomial. If $f(n) \in \mathbb{Z}$ for an infinite number of $n \in \mathbb{Z}$, then $f \in \mathbb{Q}[x]$.
Ella Smith
  • 571
  • 2
  • 11
4
votes
2 answers

Find the remainder when $x^{100}$ is divided by $x^2-3x+2$

We have to find the remainder when $x^{100}$ is divided by $x^2-3x+2$.I tried to use the remainder theorem but am not just able to solve it.please help.
Snehil Sinha
  • 1,179