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

24
votes
0answers
847 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 ...
21
votes
0answers
642 views

On the problem of polynomial bijection from $\mathbb Q\times\mathbb Q$ to $\mathbb Q$

The question titled "Polynomial bijection from $\mathbb Q\times\mathbb Q$ to $\mathbb Q$" which was posed on MathOverflow attracted quite a lot of attention (and may be the question with most wrong ...
15
votes
0answers
230 views

Irreducibility of $~\frac{x^{6k+2}-x+1}{x^2-x+1}~$ over $\mathbb Q[x]$

The Artin—Schreier polynomial $~x^n-x+1~$ is always irreducible over $\mathbb Q[x]$, unless $n=6k+2$, in which case it seems to have only two factors, one of which is always $x^2-x+1$. The ...
13
votes
0answers
615 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 ...
11
votes
0answers
192 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 ...
11
votes
0answers
316 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 ...
10
votes
0answers
148 views

Is the given binomial sum almost everywhere negative as $K\to\infty$?

The binomial sum is as follows: $$\mathcal {L}^K(\theta)= \sum_{i=\lceil{K/2}\rceil}^K \binom{K}{i}\theta^i\left((1-\theta)^{K-i}-\frac{1}{2}(1-\theta)^{-K}(1-2\theta)^{K-i}\right)$$ which can also ...
10
votes
0answers
167 views

On the maximum number of polynomials in a certain subspace

I've already asked this question on mathoverflow, but no one answered. So I put this problem also here. Sorry for that. Let $\mathbb F_q$ be a finite field and let $e, k$ be positive integers with ...
10
votes
0answers
151 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 ...
9
votes
0answers
155 views

Bounds on derivative of real positive coefficient polynomial satisfying certain properties

While thinking about this question of Clin, I wanted to consider the polynomial: $P(z) = 1+x_1z+x_2z^2+\cdots+x_nz^n$, satisfying: (I) $1\geq x_{1}\geq x_2\geq\cdots\geq x_{n}\geq0$ and ...
8
votes
0answers
214 views

How to simplify this combinatorial expression?

Find \begin{eqnarray} \sum_{j\in\mathbb{N}}(n-2j)^k\binom{n}{2j-m} \end{eqnarray} Note that this question is a generalization of this one. I tried to imitate the steps in the answer given in that ...
7
votes
0answers
57 views

Does the inverse of a polynomial matrix have polynomial growth?

Let $M : \mathbb{R}^n \to \mathbb{R}^{n \times n}$ be a matrix-valued function whose entries $m_{ij}(x_1, \dots, x_n)$ are all multivariate polynomials with real coefficients. Suppose that ...
7
votes
0answers
263 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
62 views

Is there a polynomial $p$ such that it is bijective and $ p: \mathbb{Q}^n \rightarrow \mathbb{Q}$ for $ n>1$ ??

Let us define a polynomial $p$ defined as follow $$p: \mathbb{Q}^n \rightarrow \mathbb{Q}.$$ I acrossed this question in mind. Is there a polynomial $p$ such that it is bijective and $p: ...
6
votes
0answers
181 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 ...
6
votes
0answers
257 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
133 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
389 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 ...
6
votes
0answers
121 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
150 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
655 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 ...
6
votes
0answers
132 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 ...
6
votes
0answers
132 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
100 views

The smallest non-zero integer $c$ such that $\sum\limits_{n=1}^m\pm(x+n)^6 = c$?

We have the neat equalities, I. Group 1 For $k=2,3,4,5,\dots$ $$\sum_{n=1}^{2^k}\epsilon_n(x+n)^k = 2^{\frac{k(k-1)}{2}}k! = 4,\;48,\;1536,\;\color{brown}{122880},\dots$$ for appropriate ...
5
votes
0answers
55 views

Does this simple problem using Vieta's formulas have deeper connections to elliptic curves?

A friend posed the following question to me: Suppose $p(x)=x^3+ax+b$ has one real root, $x_1$, and two non-real roots, $x_2$ and $x_3$. Compute $x_1$ in terms of $x_2$. By Vieta's formulas, ...
5
votes
0answers
39 views

A question about cyclotomic polynomials.

Let $F$ be the smallest subfield of $\mathbb{C}$ which contains $i$ and which, for every positive integer $n$, contains the unique non-negative $n$th root of every non-negative real number that it ...
5
votes
0answers
311 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
125 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
104 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 ...
5
votes
0answers
76 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
141 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
138 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
164 views

Given an integer, how can I detect the nearest integer perfect power efficiently?

If you give me an integer N, how can I detect the nearest integer perfect power, larger or smaller than N? In other words, the perfect power the distance between N and which is less than the ...
5
votes
0answers
175 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
77 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

Irreducibility of $p(x)$ implies that of $p(x+c)$ only when taken over a field?

$R$ is a ring and $R[x]$ is the polynomial ring over $R$ . $c$ is any fixed element of $R$ . Then the map $f(x)\mapsto f(x+c)$ is an isomorphism from $R[x]$ to itself. Now ...
4
votes
0answers
97 views

Roots of a polynomial

I am working the next problem: Consider the polynomials $$ p_n(z)=\sum_{j=0}^{n}\frac{z^j}{j!} $$ For $n \geq 2$, show that if $a \in \mathbb{C}$ is such that $|a|=1$ or $|a|=n$, then ...
4
votes
0answers
57 views

Find all positive values for j,k,l such that j, k, l are positive integers and (j-k)|l, (k-l)|j, (l-j)|k.

Find all possible values of $j,k,l$ such that $j, k, l$ are positive integers and $(j-k)|l, (k-l)|j, (l-j)|k$. As I understand that using divisibility properties, it is possible to come to some ...
4
votes
0answers
58 views

Exploiting a crypto backdoor based on a polynomial

At a capture-the-flag competition during the weekend, there was a task that involved the following polynomial over the field $F = \mathbb{F}_P$ of integers modulo $P = 571787215471557516425591$ (yes, ...
4
votes
0answers
53 views

Can we find the GCD of two polynomials in $\mathbb Q[x]$ by representing the coefficients as vectors?

Can we find the GCD of two polynomials in $\mathbb Q[x]$ by representing the coefficients as vectors? For example: $f=x^5+3x^4+x^3+4x^2+1$, and $g=x^5+3x^4+4x^3+3x+1$ Can we represent these ...
4
votes
0answers
138 views

Reducing multivariate rational fractions to lowest terms

I wish to simplify multivariate rational fractions to a canonical form. Thanks to some very helpful mathematically inclined people who verified that my understanding of Wikipedia was correct, I'm now ...
4
votes
0answers
60 views

On the location of the roots of a polynomial

Consider the following two polynomials \begin{align} p(s)&:=s^n+\alpha_{n-1}s^{n-1}+\cdots+\alpha_1s+\alpha_0,\\ q(s)&:=s^{n-1}+\alpha_{n-1}s^{n-2}+\cdots+\alpha_2 s+\alpha_1, \end{align} ...
4
votes
0answers
40 views

How to find out if a polynomial equation has real solutions?

I have a polynomial equation of $N$th order. The coefficients of the equation are parametrized by two variables, let's call them $a$ and $b$, both of which are real and positive. For general $N$, I ...
4
votes
0answers
48 views

When do Leibniz-like rules lead to unique linear operators

Background Usually one defines differentiation in terms of limits, and then shows that differentiation satisfies the Leibniz (product) rule, $$\frac{d}{dx}(f \cdot g) = f\frac{dg}{dx} + g ...
4
votes
0answers
77 views

Irrational roots of unity?

Is it possible to take irrational roots of unity? For example, say I wanted to solve $f(x)=(x+1)^{\sqrt{2}}=1$. I found that one solution is the obvious $x=0$, and another one can be written nicely as ...
4
votes
0answers
66 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
78 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
112 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
63 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
202 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 ...