Polynomials are expressions like $15x^3 - 14x^2 + 8$. Questions tagged with this concern common operations on polynomials, like adding, multiplying, polynomial long division, factoring and solving for roots.

learn more… | top users | synonyms

15
votes
0answers
316 views

Distribution of roots of complex polynomials

I generated random quadratic and cubic polynomials with coefficients in $\mathbb{C}$ uniformly distributed in the unit disk $|z| \le 1$. The distribution of the roots of 10000 of these polynomials are ...
11
votes
0answers
205 views

Polynomials with rational zeros

Find all polynomials $F(x)={a_n}{x^n}+\cdots+{a_1}x+a_0$ satisfying $a_n \neq0$; $(a_0, a_1, a_2, \ldots ,a_n)$ is a permutation of $(0, 1, 2 ... n)$; all zeros of $F(x)$ are rational.
11
votes
0answers
239 views

Is $\bigl(X(X-a)(X-b)\bigr)^{2^n} +1$ an irreducible polynomial over $\mathbb{Q}[X]$?

Let $a, b \in \mathbb{Q}$, with $a\neq b$ and $ab\neq 0$, and $n$ a positive integer. Is the polynomial $\bigl(X(X-a)(X-b)\bigr)^{2^n} +1$ irreducible over $\mathbb{Q}[X]$? I know that ...
11
votes
0answers
571 views

Is $ f_n=\frac{(x+1)^n-(x^n+1)}{x}$ irreducible over $\mathbf{Z}$ for arbitrary $n$?

In this document on page $3$ I found an interesting polynomial: $$f_n=\frac{(x+1)^n-(x^n+1)}{x}$$ Question is whether this polynomial is irreducible over $\mathbf{Q}$ for arbitrary $n \geq 1$ ? In ...
11
votes
0answers
439 views

The radical solution of a solvable 17th degree equation

(The question is at the bottom of the post.) Here's a "natural" solvable 17-th deg eqn with small coefficients: $$\begin{align*} x^{17}-6 x^{16}&-24 x^{15}-42 x^{14}-31 x^{13}-23 x^{12}-7 ...
10
votes
0answers
137 views

When does a polynomial fixing a subring imply its coefficients are in that subring?

Let $S$ be a subring of $R$. If $p$ is a polynomial with coefficients in $S$, then $p$ fixes $S$ (as a function, that is, $p(s)\in S$ for all $s\in S$). A converse statement is: If $p$ is a ...
8
votes
0answers
127 views

Bounding the “complexity” of irreducible factors of an integer polynomial

Given an integer polynomial $P(x) = a_0 + a_1 x + \cdots + a_n x^n$, there ought to be a reasonable bound on the "complexity" of its possible irreducible integer polynomial factors that allows us to ...
7
votes
0answers
185 views

What is the dimension of this algebraic variety?

Let $\mathbb K$ be a number field of degree $n$ over $\mathbb Q$, and let $\alpha_1,\alpha_2, \ldots ,\alpha_n$ be a $\mathbb Q$-basis of $\mathbb K$. Then there are coefficients $(c^{ij}_k)$ (where ...
7
votes
0answers
241 views

On the continuation of a polynomial

This exrcise is from the first section of Marden: Exercise 12. Let the interior of a piecewise regular curve $C$ contain the origin $\cal O$ and be star-shaped with respect to $\cal O$. If the ...
6
votes
0answers
60 views

If all convex combinations of $p(x)$ and $q(x)$ have real roots, then $p,q$ have a common interlacing poly

I heard this result in a talk the other day: Suppose $p$ and $q$ are polynomials. Suppose $p$ is a polynomial of degree $n$ and $q$ a polynomial of degree $n-1$. Call $q$ and interlacer of $p$ if the ...
6
votes
0answers
123 views

Fejer-Riesz Lemma

I'm trying to apply the Fejer-Riesz Lemma constructively. The lemma says that for a Laurent polynomial $a(z) = \sum_{-n}^na_jz^j$ with $a_j = \bar a_{-j}$ and $a(e^{i\theta})\geq0$ on the complex unit ...
6
votes
0answers
126 views

If $F(a_1,\ldots,a_k)=0$ whenever $a_1,\ldots,a_k$ are integers such that $f(x)=x^k-a_1x^{k-1}-\cdots-a_k$ is irreducible, then $F\equiv0$

I'm trying to understand a proof of the following theorem (from section II of Hall's paper An Isomorphism Between Linear Recurring Sequences and Algebraic Rings): If $F(a_1, \ldots, a_k)$ is a ...
6
votes
0answers
114 views

Check my proof of the polynomial uniqueness

Problem 169 from the book I.M. Gelfand, "Algebra". "Assume that $x_1, \ldots , x_{10}$ are different numbers, and $y_1 , \ldots , y_{10}$ are arbitrary numbers. Prove that there is one and only one ...
6
votes
0answers
142 views

Generalized conjugation of polynomials with coefficients in an associative algebra

Suppose $\mathcal{A}$ is an associative algebra over $\mathbb{R}$. Furthermore, let $f(x_1, \dots , x_n) \in \mathcal{A}[x_1, \dots , x_n]$. Preliminary Question: Is it possible to find $g(x_1, ...
6
votes
0answers
119 views

On the order of $\mathbb{Z}[X]/(f,g)$ and the resultant $R(f,g)$.

I suspect that $\#\mathbb{Z}[X]/(f,g)=|R(f,g)|$ holds for any two non-constant polynomials $f,g\in\mathbb{Z}[X]$, where $R(f,g)$ is the resultant of $f$ and $g$. I am however unable to prove it. I'd ...
5
votes
0answers
283 views

A problem with sign of coefficients of a polynomial expression

Let $f$ be a real coefficient homogeneous polynomial in $n$ undeterminates, such that $f(x_1,\cdots,x_n)>0$ whenever $x_1,...,x_n$ are non-negative real numbers, not all $0$. Then how to show ...
5
votes
0answers
121 views

A question in my mind

Suppose $\displaystyle P\in \mathbb{R}[x]$ such that : $\displaystyle P(x)=2^n$ has at least one rational root for each $n\in \mathbb{N}$. Does it follow $P$ is linear? If it does or doesn't give ...
5
votes
0answers
60 views

Minimising an expression - involving polynomial

I found this one on a forum but it has been unanswered from long there. I am curious to know if there is a solution to this problem. Here it is: Let n be a positive integer. Determine the smallest ...
5
votes
0answers
161 views

Elementary proof of irreducibility criterion

From ``Problems from the Book'' by Andreescu and Dospinescu, the following irreducibility criterion is presented: Let $f$ be a monic polynomial with integer coefficients and let $p$ be a prime. If ...
5
votes
0answers
57 views

How does the polynomial transformation $P(x) \mapsto P(x) + c$ alter the roots of that polynomial? Specifics inside.

Consider a real quadratic polynomial $Q_k(x) = (x-\nu)(x-\omega_k) - g_k^2$. I can interpret $Q_k(x)$ as a translation of the polynomial $$ (x-\nu)(x-\omega_k) = ...
5
votes
0answers
104 views

Generating Functions, Recursive Polynomials

At the CMFT international conference in Turkey (2009), the following open problem was given: Show that $$p_n(x):=\sum_{k=0}^n \frac{(n-k)^k}{k!}x^{n-k}$$ has only real simple zeros for every $n$. ...
5
votes
0answers
155 views

Determine the general solution for $2\cos^2x-5\cos x+2=0$

Determine the general solution for $ 2\cos^{2}x-5\cos x+2=0$ My attempt: $2u^2 - 5u + 2 = 0$ $(2u - 1)(u - 2) = 0$ $u = \frac{1}{2}$ or $u = 2$ $\cos(x) = \frac{1}{2}$ or $\cos(x) = 2$ The ...
5
votes
0answers
221 views

Runge's phenomen: interpolation error using Chebyshev nodes oscillates

We're trying to approximate the Runge function $f(x) = \dfrac{1}{1+25x^2}$ using Chebyshev nodes. When calculating the interpolation error, using different degrees ranging from 0 to 50, we get the ...
5
votes
0answers
120 views

Proof that $t^8+2t^6+4t^4+t^2+1$ is reducible in $\mathbb{F}_p$

Prove that the polynomial $t^8+2t^6+4t^4+t^2+1$ is reducible in $\Bbb F_p$, for all $p\in \Bbb P$. Here are some examples: $t^8+2t^6+4t^4+t^2+1=(1 + t + t^4)^2\pmod{2}$ $t^8+2t^6+4t^4+t^2+1=(1 + t) (2 ...
5
votes
0answers
158 views

Irreducibility of polynomials via Frobenius map

I am having trouble trying to show this: Let $f \in \mathbb{F}_p[x]$ be a non-constant polynomial and let $F$ denote the Frobenius map $F: R \rightarrow R$ where $R = \mathbb F_p[x]/(f)$. Prove ...
5
votes
0answers
506 views

Gauss-Lucas Theorem (roots of derivatives)

Gauss-Lucas Theorem states: "Let f be a polynomial and $f'$ the derivative of $f$. Then the theorem states that the $n-1$ roots of $f'$ all lie within the convex hull of the $n$ roots ...
5
votes
0answers
110 views

relationship between solution of quintic in terms of $_{4}F_{3}$ hypergeometric function and theta functions

There is one approach (Bring radical/method of differential resolvents) to the general solution to the quintic that gives the solution for a particular root $v\in\{v_{1},v_{2},v_{3},v_{4},v_{5}\}$ in ...
5
votes
0answers
75 views

Restriction of trivariate polynomial to $1$ variable

Let $p(x,y,z): \mathbb{F}^3 \to \mathbb{F}$ be a trivariate polynomial of degree $d \ll |\mathbb{F}|$. We choose uniformly at random an affine $1$-dimentional space $\ell = \{(a_1,a_2,a_3)t + ...
4
votes
0answers
32 views

Set of Metapolynomials is closed under multiplication

We say that a function $f:\mathbb{R}^k \rightarrow \mathbb{R}$ is a metapolynomial if, for some positive integer $m$ and $n$, it can be represented in the form $$f(x_1,\cdots , x_k ...
4
votes
0answers
70 views

Irreducibility of some polynomial

Let $p(x) = (1+ \cdots +x^k)^2 + (1+ \cdots +x^k) + 1$, for some $k \geq 2$ fixed. I would like to know if $p(x)$ is irreducible in $\mathbb{Q}[x]$.
4
votes
0answers
67 views

Isomorphism between finite fields adjoining a root

Let $p(x)=x^3+x^2+1$ and $q(x)=x^3+x+1$ be polynomials over the field $\mathbb{Z}_2$. Let $\alpha$ be a root of $p(x)$ and $\beta$ be a root of $q(x)$. Now let $K=\mathbb{Z}_2(\alpha)$ and ...
4
votes
0answers
86 views

All roots of a polynomial lie on a circle.

I'm stuck in the following problem and I need your help to solve it. Given a number $\alpha$, $0 < \alpha < 1$. $A_j(x)$ is a sequence of polynomials of $x^{-1}$ such that: $A_0(x) = 1; \\ ...
4
votes
0answers
51 views

The ring of homogeneous polynomials

I think I found an error in my textbook, but I am not completely sure. The book is Hulek, Elementary algebraic geometry, pag. 73. There is a theorem showing that $U_i$ and the affine space ...
4
votes
0answers
87 views

norm of differential operator on $P^n[0,1]$

Consider the space $P^n[0,1]$ of polynomials of degree $\leq n$ on $[0,1]$, equipped with the sup norm. Now, this is a finite dimensional space, so all linear operators have to be continuous, hence ...
4
votes
0answers
66 views

Solve $f(x)\mid g^2(x)+1$ in $\mathbb Z[x]$

We know that if $p\in \mathbb P$ and $p\equiv 1\bmod 4$ then we can find $t\in\mathbb Z$ such that $p\mid t^2+1.$ For what polynomial $f(x)\in \mathbb Z[x]$, we can find $g(x)\in \mathbb Z[x]$ ...
4
votes
0answers
64 views

Can we say anything about the structure of the semigroup of non-coprime pairs after this?

Let $S = \{(a,b) : \ a, b \in \Bbb{Z} \wedge \gcd(a,b) \neq 1 \}$. Then it forms a semigroup under componentwise multiplication and if we add an exception, that even though $\gcd(1,1) = 1$, we ...
4
votes
0answers
48 views

Existence of Solutions of Two Cubic Equations in a Particular Region

If I have two cubic equations in two variables, $ax^3 + bx^2 y + cxy^2+\dots=0$ and another one with different coefficients, and I know that $(x,y)=(0,0)$ or $(1,1)$ are solutions, are there any nice, ...
4
votes
0answers
124 views

“Convex” polynomials

Let me define "convex" polynomials, as the smallest class $\mathcal{C}$ of functions $p:\mathbb{R}\rightarrow \mathbb{R}$ defined (inductively) as: UPDATED (case 0 was missing): 0) $p(x)=x$, i.e., ...
4
votes
0answers
79 views

Polynomial bound

Let $P(x)=a_4 x^4+a_3 x^3+a_2 x^2+a_1 x+a_0$ such that $$\forall i\in \{0, 1, 2, 3, 4\};\phantom{;}a_i\in\mathbb{Z} \wedge |a_i|\leq T\phantom{.}(T\in\mathbb{Z}^+ )$$ Suppose that $P(x)> 0$ for all ...
4
votes
0answers
58 views

Necessary and sufficient condition for $f(q^n)$ to be in $\mathbb{Z}[q,q^{-1}]$ when $f\in\mathbb{Q}(q)[x]$?

In this question, user begins shows that, for each $k\in \mathbb{N}$, there is a unique polynomial $P_k(x)$ of degree $k$ whose coefficients are in $\mathbb{Q}(q)$, the field of rational functions, ...
4
votes
0answers
68 views

About $t$-analogue of the Euler polynomials.

A certain way to define the $t$-analogue of the Euler polynomials $C_n(x)$ is by $$ C_n(x,t)=\sum_{\pi\in S_n}x^{\text{des}(\pi)+1}t^{\text{maj}(\pi)} $$ where $des(\pi)$ is the descents in $\pi$, ...
4
votes
0answers
176 views

A functional recursion problem..do you have any idea?

I have a problem which is related to algebra and polynomials. I would be very grateful if any of you could give a hand to solve it. Here is the problem: Consider the function $f_0(x) =x(1-x)$ and for ...
3
votes
0answers
82 views

zeros of a simple polynomial

For $x, y \in GF[2^n]$, consider the two-parameter polynomial $P(x,y) = x \cdot y + f(x) + g(y)$, where $f$ and $g$ are arbitrary polynomials on $GF[2^n]$. Can we say anything about the number of ...
3
votes
0answers
30 views

Determining if a given equation is solvable given a set of ultra-radicals

So suppose someone is armed with the tools of standard arithmetic, exponents (and of course that comes along with roots) AS WELL AS a set of inverses for some polynomials which are not solvable using ...
3
votes
0answers
28 views

Facts about quotient rings - example

I have three quotient rings: $R_1 = \frac{\mathbb{Q}[x]}{(x^2 -1)}$ $R_2 = \frac{\mathbb{Q}[x]}{(x^2 +1)}$ $R_3 = \frac{\mathbb{Q}[x]}{((x -1)^2)}$ I am trying to decide whether these are integral ...
3
votes
0answers
35 views

How can I find a tranformation matrix/Mathematical relation between two 5th degree polynomial curves in space?

I have the equation of two 5th degree polynomials which they don`t intersect with each other .Each curve is made of 100 points and these two curves looks similar but there are small differences .I am ...
3
votes
0answers
49 views

Prove that the set has zero density

Let $a>1$ be a positive integer and $f\in \mathbb{Z}[x]$ with positive leading coefficient. Let $S$ be the set of integers $n$ such that $$n \mid a^{f(n)}-1.$$ Prove that $S$ has density $0$; that ...
3
votes
0answers
26 views

Determinant of a generalization of Moore matrices

The Moore matrix over $\mathbb{F}_q$ is the $n\times n$ matrix whose i'th row is: $a_i,a_i^q,a_i^{q^2},\dots,a_i^{q^{n-1}}$. The determinant of this matrix is the product of all linear combinations ...
3
votes
0answers
56 views

Möbius transformation that permutes roots of a cubic polynomial

The roots of the polynomial $x^3-3x-1$ can be permuted by the function $z\mapsto \dfrac{-1}{1+z}$ which is easily checked by a direct calculation. Is there a simple formula for a Möbius ...
3
votes
0answers
69 views

Proof for the form of characteristic polynomial

I'd like to proof: The caracteristic polynomial of $A \in M(n\times n, K)$ has the form: $P_A(\lambda) = (-1)^n \lambda^n + (-1)^{n-1} \operatorname{tr}(A)\lambda^{n-1} +\dots +\det(A)$ My proof ...