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

monotonicity of $\sum_0^n x^i$ for odd $n$

I am trying to prove the strict monotonicity of $\sum_{i=0}^n x^i$ for odd $n$. This is not homework; just something I have noticed to appear true, and thus my brain bugs me until I have a proof. I have tried a direct approach but am coming up…
3
votes
3 answers

Expressing a Polynomial as a sum of cube roots of integers

How do you prove $x^3-3x^2-6x-4$ has a zero of the form $\sqrt[3]a+\sqrt[3]b+\sqrt[3]c$, for distinct positive integers a,b,c
3
votes
1 answer

Constructing a family of polynomials in $\mathbb R_n[X]$

Let $\mathbb R_n[X]$ be the vector space of polynomials of degree at most $n$. Let $u$ the endomorphism sending $P$ to $P(X+1)-P(X)$. I want to show that there exists a unique family of polynomials $Q_0, \cdots,Q_n$ such that $Q_0=1$ and…
palio
  • 11,064
3
votes
1 answer

Polynomial boundaries

Suppose polynomial $P_n$ of degree $n$ is such that $|P_n(x)|\le 1$ for $|x|\le 1$. What can you say about the $|P_n'(x)|$ for $|x|\le 1$? This question is just a generalization of this result: $f(x)=ax^2+bx+c$ where $a, b, c \in R $ and $|f(x)|\leq…
Vadim
  • 5,637
3
votes
1 answer

$f(x)=ax^2+bx+c$ where $a, b, c \in R $ and $|f(x)|\leq 1$ on the interval $|x|\leq1$. Prove that $|f'(x)\leq4|$ on the same interval.

$f(x)=ax^2+bx+c$ where $a, b, c \in R $ and $|f(x)|\leq 1$ on the interval $|x|\leq1$. Prove that $|f'(x)\leq4|$ on the same interval. I've tried a few approaches - I put $x = 0, 1, -1$ and figured out that $a\leq 2$ and $b,c \leq1$. I tried…
user1299784
  • 2,009
3
votes
1 answer

Proof of Exponential function $a^n$

How can I prove that $$\sum_{n=N}^M a^n = \frac{a^M - a^{N+1}}{1-a}$$ for $a$ not equal to $1$ and $$\sum_{n=N}^M a^n = M-N+1$$ for $a = 1$
3
votes
1 answer

Prove that $(f(x)-x)^2 \not|f( f(...f(x)))) - x$

Let $f(x) \in \mathbb{R}[x], \deg f \geq 2$. Then $(f(x)-x)^2 \not|f( f(...f(x)))) - x$. I found this problem in my old notes, but there was no solution, and I could not remember one.
user68061
  • 3,827
3
votes
0 answers

Quartic polynomial coefficients inequality

Let $P(x)=x^4+ax^3+bx+c$, $a,b,c$ are real, and all the roots of the polynomial are different. Prove that $ab<0$. I have tried connecting the $a,b,c$ written in Viet's, and pulling something out of that, all I got is that if all the roots of the…
3
votes
1 answer

Calculate GCD$(x^4+x+1,x^3+x^2)$ and a Bezout Identity in $\mathbb{F_2}$

A really short task: Calculate GCD$(x^4+x+1,x^3+x^2)$ and a Bezout Identity in $\mathbb{F_2}.$ I've tried it but my GCD is $1$ and I cannot see where my mistake is. $x^4+x+1= x \cdot (x^3+x^2) + x^3 +x + 1$ $x^3+x^2 = 1 \cdot (x^3 + x + 1) + x^2 +…
Nhat
  • 1,354
3
votes
1 answer

Lagrange Interpolating Polynomial using Modulo

Consider this equation : $$q(x) = (a_0 + a_1 x + a_2 x^2 + \cdots + a_{r-1} x^{r-1}) \pmod {251} $$ then I'll find the value of $$ q(1), q(2), q(3), \dots ,q(n) $$ with $r \le n$ and $ 0 <= a < 251 $ The question is: Is it possible to…
3
votes
1 answer

Solving the equation $\frac{x^7}{7}=1+10^{1/7}x(x^2-10^{1/7})^2$

$$\frac{x^7}{7}=1+10^{1/7}x(x^2-10^{1/7})^2$$ Find $x$ where $x$ is real.
Gory
  • 103
3
votes
3 answers

How prove this $g(x)|f(x)$ on $Q[x]$

Let $C,Q$ is complex numbers Field and Rational number Field,respectively,if $f(x),g(x)\in Q[x]$, if $g(x)|f(x)$ on $C[x]$,show that $$g(x)|f(x)$$ on $Q[x]$ My try: since $g(x)|f(x)$,then we have $$f(x)=g(x)h(x)$$ where $h(x)\in C[x]$. Then I…
math110
  • 93,304
3
votes
2 answers

Quartic Equation have four real roots $x=\frac{1}{\alpha^3},\frac{1}{\alpha},\alpha,\alpha^3(\alpha>0)$

I would appreciate if somebody could help me with the following problem Q: Quadratic Equation $x^4+ax^3+bx^2+ax+1=0$ have four real roots $x=\frac{1}{\alpha^3},\frac{1}{\alpha},\alpha,\alpha^3(\alpha>0)$ and $2a+b=14$. Find…
Young
  • 5,492
3
votes
5 answers

Is there a polynomial, in terms of $x^4$ and $x$, whose graph is not below the graph of the function $y=x^3$

I tried several coefficients before $x^4$ and $x$, but I didn't get it unless adding a constant term.
3
votes
1 answer

Show that a polynomial has at least one positive solution/root.

Let: $P(x) = a_nx^n + a_{n-1}x^{n-1} + ..... + a_1x + a_0$ where $a_0a_n < 0$ I have to prove that the Polynomial $P(x)$ has at least one positive root how can I prove it? Any ideas?