# Tagged Questions

This tag is used for both basic and advanced questions on polynomials in any number of variables. Including, but not limited to: solving for roots, factoring, checking for irreducibility. This tag is rarely used as the only tag for a question.

1k 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 ...
1k 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 ...
337 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 ...
789 views

212 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 ...
358 views

91 views

### Integer polynomials with roots in every $\mathbb{Z}_p$ but no rational roots.

I want to find polynomials in $\mathbb{Z}[x]$ with degree as small as possible such that these polynomials have no rational roots but have a root in the $p$-adic integers $\mathbb{Z}_p$ for every ...
834 views

### How to prove this polynomial inequality?

How can we prove the following? If $\frac{dP_{n}}{dz}|_{z=z_{0}}=0$ then $|P_{n}(z_{0})|<2$ for all $n>1$, where $P_{n}(z)\equiv P_{n-1}^{2}+z$ and $P_{1}\equiv z$ $z$ is in the complex plane. ...
395 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 ...
191 views

77 views

### $\mathbb C[X_1, \ldots, X_n]$ is a free module over $\mathbb C[X_1, \ldots, X_n]^G$

Let $G$ be finite subgroup of $GL_n( \mathbb C )$. Let $\mathbb C[X_1, \ldots, X_n]^G$ be the set of all G-invariant polynomials of $\mathbb C[X_1, \ldots, X_n]$. Is there any rule by which we can ...
74 views

426 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 ...
149 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 ...
732 views

149 views

218 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 ...
137 views

164 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$. ...
492 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 ...
128 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 ...
153 views

66 views

315 views

### proof that $\frac{x^p - 1}{x-1} = 1 + x + \dots + x^{p-1}$ is irreducible

I am reading the group theory text of Eugene Dickson. Theorem 33 shows this polynomial is irreducible $$\frac{x^p - 1}{x-1} = 1 + x + \dots + x^{p-1} \in \mathbb{Z}[x]$$ He shows this polynomial ...
125 views

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 $\... 0answers 77 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 ... 0answers 61 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,$x_1+...
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 ...
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 ...