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.

learn more… | top users | synonyms

16
votes
2answers
1k views

Adriaan van Roomen's 45th degree equation in 1593

Adriaan van Roomen proposed a 45th degree equation in 1593(see this book, picture reference as follows): $$ \begin{gathered} f(x) = x^{45} - 45x^{43} + 945x^{41} - 12300x^{39} + 111150x^{37} - \color{...
16
votes
1answer
558 views

2005 Putnam B1: Find a Polynomial

Find a nonzero polynomial $P(x,y)$ such that $P(\lfloor a\rfloor,\lfloor 2a\rfloor)=0$ for all real numbers $a.$ (Note: $\lfloor v\rfloor$ is the greatest integer less than or equal to $v.$) I ...
16
votes
2answers
217 views

Prove that there isn't a polynomial with $\text {f(x)}^{13} = {(x-1)}^{143}+(x+1)^{2002}$

Prove that there isn't a polynomial with $\text {f(x)}^{13} = {(x-1)}^{143}+(x+1)^{2002}$ We can easily find out that $\text {deg}(f) = 154$ Then?
16
votes
3answers
375 views

Find all polynomials that fix $\mathbb Q$ and the irrationals

Problem: Describe all polynomials $\mathbb{R}\rightarrow\mathbb{R}$ with coefficients in $\mathbb C$ which send rational numbers to rational numbers and irrational numbers to irrational numbers.
16
votes
1answer
532 views

Existence of Irreducible polynomials over $\mathbb{Z}$ of any given degree

Question is to prove : Irreducibility of $(x-1)(x-2)\cdots (x-n)- 1$ over $\mathbb{Z}$ for all $n\geq 1$ Irreducibility of $(x-1)(x-2)\cdots (x-n)+ 1$ over $\mathbb{Z}$ for all $n\geq 1$ and $n\...
16
votes
1answer
426 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.
16
votes
4answers
605 views

Are polynomials of the form : $ f_n= x^n+x^{n-1}+\cdots+x^{k+1}+ax^k+ax^{k-1}+\cdots+a$ irreducible over $\mathbb{Z} $?

Is it true that polynomials of the form : $ f_n= x^n+x^{n-1}+\cdots+x^{k+1}+ax^k+ax^{k-1}+\cdots+a$ where $\gcd(n+1,k+1)=1$ , $ a\in \mathbb{Z^{+}}$ , $a$ is odd number , $a>1$, and $a_1\...
16
votes
1answer
631 views

zeros of exponential polynomials

Let $\exp[n;z]$ denote the $n$th Taylor polynomial for the exponential function. In the 1920's Szegő initiated the study of the asymptotic properties of the zeros (rescaled by dividing by $n$) of ...
15
votes
6answers
2k views

Can the product of two polynomials result in a single term?

Assume that the polynomials that we multiply consist of more than one term. I don't think we can get a result containing only a single term, but I don't know how to prove it.
15
votes
6answers
609 views

Proving $x^{4}+x^{3}+x^{2}+x+1$ is always positive for real $x$

So I was bored in class and decided to graph polynomials in geogebra, I noticed that $x^{4}+x^{3}+x^{2}+x+1$ and $x^{6}+x^{5}+x^{4}+x^{3}+x^{2}+x+1$, are all above the x-axis. Now I am wondering if ...
15
votes
3answers
567 views

Why is the difference of distinct roots of irreducible $f(x)\in\mathbb{Q}[x]$ never rational?

The way I understand it, is that if $f(x)$ is an irreducible polynomial in $\mathbb{Q}[x]$ of degree at least 2, then a difference of distinct roots $a_i-a_j$ is never rational for any of the $a_1,\...
15
votes
4answers
3k views

Zero divisor in $R[x]$

Let $R$ be commutative ring with no (nonzero) nilpotents. If $f(x) = a_0+a_1x+\cdots+a_nx^n$ is a zero divisor in $R[x]$, how do I show there's an element $b \ne 0$ in $R$ such that $ba_0=ba_1=\cdots=...
15
votes
4answers
427 views

If $x$ and $y$ are rational numbers and $x^5+y^5=2x^2y^2,$ then $1-xy$ is a perfect square.

Prove that if $x, y$ are rational numbers and $$ x^5 +y^5 = 2x^2y^2$$ then $1-xy$ is a perfect square.
15
votes
4answers
1k views

How many solutions for this equation?

$$ \frac{x-4}{(x-1)} = \frac{1-4}{(x-1)} $$ Can someone tell me how many solutions are there for the above equation? MY APPROACH: I cross multiplied the equations and re-arranged to get a quadratic ...
15
votes
3answers
2k views

Quickest way to determine a polynomial with positive integer coefficients

Suppose that you are given a polynomial $p(x)$ as a black box (i.e. some oracle, to which you feed $x$ and it returns $p(x)$). It is known that the coefficients of $p(x)$ are all positive integers. ...
15
votes
5answers
3k views

Polynomial approximation of circle or ellipse

Trying again, with a somewhat simpler sounding question, since my previous one (Generalizations of equi-oscillation criterion) got zero response: Let $F:[0,1] \to R^2$ be a parametric polynomial ...
15
votes
1answer
331 views

Why is $x^3-5x$ injective on the rationals?

I've found the statement on the internet that the polynomial $x^3-5x$ is injective on the rational numbers, but without any comments on how to prove it. I think it means it must be easy, but I don't ...
15
votes
4answers
6k views

Finding the minimal polynomial of $\sqrt 2 + \sqrt[3] 2$ over $\mathbb Q$.

I have to find the minimal polynomial of $\sqrt 2 + \sqrt[3] 2$ over $\mathbb Q$. The suggested way of doing it is to prove that $\mathbb Q[\sqrt 2 + \sqrt[3] 2]=\mathbb Q[\sqrt 2,\sqrt[3] 2]$ first. ...
15
votes
2answers
4k views

Why does the discriminant of a cubic polynomial being less than 0 indicate complex roots?

The discriminant $\Delta = 18abcd - 4b^3d + b^2 c^2 - 4ac^3 - 27a^2d^2$ of the cubic polynomial $ax^3 + bx^2 + cx+ d$ indicates not only if there are repeated roots when $\Delta$ vanishes, but also ...
15
votes
1answer
5k views

Using Vieta's theorem for cubic equations to derive the cubic discriminant

Background: Vieta's Theorem for cubic equations says that if a cubic equation $x^3 + px^2 + qx + r = 0$ has three different roots $x_1, x_2, x_3$, then $$\begin{eqnarray*} -p &=& x_1 + x_2 +...
15
votes
1answer
647 views

Is factoring polynomials easier than factoring integers? [duplicate]

I was reading the book Algebra: Chapter 0 , by Paolo Aluffi, and came across the following assertion, in page 290, Exercise 5.9: It is in fact much harder to factor integers than integers ...
15
votes
3answers
576 views

How prove $P(x)=\sum_{k=0}^{n}(2k+1)x^k$ is irreducible over $\mathbb{Q}$

Show that the polynomial $$P(x)=\sum_{k=0}^{n}(2k+1)x^k,\forall n\in N^{+}$$ is irreducible over $Q$. My try: Since $P(x)$ has integer coefficients and the gcd of these coefficients is $1$, by Gauss'...
15
votes
1answer
376 views

Understanding proof by infinite descent, Fermat's Last Theorem.

See here. The question is as follows. How do we see that there do not exist nonconstant, relatively prime, polynomials $a(t)$, $b(t)$, and $c(t) \in \mathbb{C}[t]$ such that$$a(t)^3 + b(t)^3 = c(t)...
15
votes
2answers
228 views

Decomposition of an algebraic number into a sum or product of algebraic numbers with smaller degree

An algebraic number can be identified by its minimal polynomial together with isolating intervals with rational bounds for its real and imaginary parts. The degree of an algebraic number is the degree ...
15
votes
3answers
3k views

Shortcut/trick for integrating a factored polynomial?

If I'm integrating a factored polynomial, say $$\int{x(x+1)(x-2)(x+3)dx},$$ does some shortcut exist that keeps me from having to expand the polynomial? Currently, I'd just do all the multiplication ...
15
votes
2answers
511 views

Necessary and sufficient conditions for a polynomial $p$ to satisfy $\|x\|\to\infty\implies p(x)\to\infty$?

I'm looking for a necessary and sufficient conditions (I'm not even sure these exist) for a polynomial $p:\mathbb{R}^n\to\mathbb{R}$ to be "radially unbounded", that is $$\|x\|\to\infty\implies p(x)\...
15
votes
1answer
271 views

If $\gamma\in \Bbb A$ then there exists a $\pm$quadratic coefficiented polynomial for which $\gamma$ is a root.

$\mathbf{1.\space Proposition}$ Let $\gamma$ be a solution to the equation: $$ \sum_{i=0}^n \rm a_i\rm x^i=0, \rm a_i\in\Bbb Z, a_n=1. $$ Then, there exists a polynomial $p\in \Bbb Z[x]$ ...
15
votes
1answer
191 views

Existence of rational sequence such that a polynomial is split over $\Bbb{Q}$

Does there exist a sequence $(a_n)_{n\in \Bbb{N}}$ of rationals such that for all $n\in \Bbb{N}$, $a_n\neq 0$ and the polynomial $a_0+a_1X+\cdots+a_nX^n$ is split over $\Bbb{Q}$? I was asked this ...
14
votes
2answers
845 views

Can we introduce new operations that make quintics solvable?

I have heard from various sources that the typical arithmetic operations (addition, subtraction, multiplication, division, rational exponentiation) are not sufficient to express in general the roots ...
14
votes
2answers
1k views

Prove that a polynomial has at least one nonreal complex root

Prove that the polynomial below has at least one nonreal complex root $$x^5+\frac{x^4}2+ \frac{x^3}3+\frac{x^2}4+\frac x{24}+\frac 1{120}$$ I have tried to prove that there exist $k\in \Bbb R$, such ...
14
votes
3answers
930 views

Solve $3n^3 + 3n^2 + 4n = n^n$ in positive integers

So my cousin is in the math team (7th grade) and he was asking me for help on one of his problems but I don't know how to solve For what positive integer n does $3n^3 + 3n^2 + 4n = n^n$ anyone know ...
14
votes
2answers
875 views

Is Vieta the only way out?

Let $a,b,c$ are the three roots of the equation $x^3-x-1=0$. Then find the equation whose roots are $\frac{1+a}{1-a}$,$\frac{1+b}{1-b}$,$\frac{1+c}{1-c}$. The only solution I could think of is by ...
14
votes
9answers
519 views

Prove that $f=x^4-4x^2+16\in\mathbb{Q}$ is irreducible

Prove that $f=x^4-4x^2+16\in\mathbb{Q}[x]$ is irreducible. I am trying to prove it with Eisenstein's criterion but without success: for p=2, it divides -4 and the constant coefficient 16, don't ...
14
votes
4answers
604 views

Polynomial: $p(x) = p(x+3)$.

Determine polynomial $p(x)$ s.t. $p(x) = p(x+3)$. Just by looking at the above equation, it immediately appears that p has got to be some kind of constant function. I thought it might also be a ...
14
votes
3answers
1k views

Why is the zero polynomial not assigned a degree?

Yesterday, I read in my textbook, We assign degree to every polynomial and even a non-zero constant is assigned a degree $0$ but $0$ itself is not assigned a degree. Why is that? Why we don't ...
14
votes
4answers
788 views

Reducibility over $\mathbb{Z}_2$?

I have seen that $x^{2}+x+1$ and $x^{4}+x+1$ are irreducible over $\mathbb{Z}_2$ and I thought a polynomial of the form $x^{2^m}+x+1$ for $m\ge3$ would be irreducible too. However using WolframAlpha, ...
14
votes
1answer
290 views

Polynomial $P(x,y)$ with $\inf_{\mathbb{R}^2} P=0$, but without any point where $P=0$

Recently I've came across such problem: give a polynomial $P(x,y)$, with $\inf_{\mathbb{R}^2} P=0$, but there is no point on the plane where $P=0$. I couldn't solve it after a day, and seriously doubt ...
14
votes
5answers
934 views

How to solve a cyclic quintic in radicals?

Galois theory tells us that $\frac{z^{11}-1}{z-1} = z^{10} + z^9 + z^8 + z^7 + z^6 + z^5 + z^4 + z^3 + z^2 + z + 1$ can be solved in radicals because its group is solvable. Actually performing the ...
14
votes
3answers
4k views

Irreducible polynomial which is reducible modulo every prime

How to show that $x^4+1$ is irreducible in $\mathbb Z[x]$ but it is reducible modulo every prime $p$? For example I know that $x^4+1=(x+1)^4\bmod 2$. Also $\bmod 3$ we have that $0,1,2$ are not ...
14
votes
3answers
356 views

How to see that the polynomial $4x^2 - 3x^7$ is a permutation of the elements of $\mathbb{Z}/{11}\mathbb{Z}$

This is from Rotman's Group Theory book, although I don't have the specific reference right now, as the book is with a friend. He asks to show that $\alpha (x) = 4x^2 - 3x^7$ is a permutation of the ...
14
votes
2answers
389 views

Sum of roots rational but product irrational

Suppose that $x_1,x_2,x_3,x_4$ are the real roots of a polynomial with integer coefficients of degree $4$, and $x_1+x_2$ is rational while $x_1x_2$ is irrational. Is it necessary that $x_1+x_2=x_3+x_4$...
14
votes
2answers
1k views

Sum of derivatives of a polynomial

Let $p(x)$ be a polynomial of degree $n$ satisfying $p(x)\geq 0$ for all $x$. That is, for all $x$, $p(x) = a_n x^n + a_{n-1} x^{n-1} + \cdots + a_1 x + a_0 \geq 0$, $a_n\neq 0$. Show that $p(x)+p&#...
14
votes
2answers
1k views

Inverse function of $y=\frac{\ln(x+1)}{\ln x}$

I've been wondering for a while if it's possible to find the inverse function of $y=\frac{\ln(x+1)}{\ln x}$ over the reals. This is the same as finding the positive real root of $x^y-x-1$. I realize ...
14
votes
2answers
470 views

Another polynomial game

I came across the following problem and I'm stumped. Players X and Y play the following game. For $n\geq 2$, they consider a monic polynomial with degree $2n$, with undetermined coefficients (...
14
votes
1answer
206 views

Prove that ${x^7-1 \over x-1}=y^5-1$ has no integer solutions

I want to show that $${x^7-1 \over x-1}=y^5-1$$ cannot have any integer solutions. The only observation I have made so far is that the left hand side is the $7$th cyclotomic polynomial $$\Phi_7(x)= {...
14
votes
1answer
190 views

If $p$ is a positive multivariate polynomial, does $1/p$ have polynomial growth?

I wanted to ask a separate question to focus on an elementary issue from my question Does the inverse of a polynomial matrix have polynomial growth?. Let $p : \mathbb{R}^n \to \mathbb{R}$ be a ...
14
votes
1answer
195 views

Natural density of solvable quintics

A recent question asked about the topological density of solvable monic quintics with rational coefficients in the space of all monic quintics with rational coefficients. Robert Israel gave a nice ...
14
votes
4answers
316 views

Coefficients of a polynomial also are the roots of the polynomial?

How many real solutions $(r_1, r_2, \cdots, r_n)$ are there such that $(r_1, r_2, \cdots, r_n)$ are the roots of the polynomials $x^{n} + r_1 x^{n-1} + r_2 x^{n-2} + \cdots + r_n$ For $n = 2, 3, 4$ I ...
14
votes
1answer
750 views

Multiplicative norm on $\mathbb{R}[X]$.

How to prove that : there is no function $N\colon \mathbb{R}[X] \rightarrow \mathbb{R}$, such that : $N$ is a norm of $\mathbb{R}$-vector space and $N(PQ)=N(P)N(Q)$ for all $P,Q \in \mathbb{R}[X]$. ...
14
votes
2answers
189 views

Is a linear combination of minors irreducible?

Let $X=(X_{ij})_{1\le i,j\le n}$ be a matrix of indeterminates over $\mathbb C$. For choices $I,J\subseteq\{1,\ldots,n\}$ with $|I|=|J|=k$ denote by $X_{I\times J}$ the matrix $(X_{ij})_{i\in I,j\in J}...