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

133
votes
1answer
4k views

Rational roots of polynomials

Can one construct a sequence $(a_k)_{k\geqslant 0}$ of rational numbers such that, for every positive integer $n$ the polynomial $a_nX^n+a_{n-1}X^{n-1}+\cdots +a_0$ has exactly $n$ distinct rational ...
125
votes
3answers
3k views

A Topology such that the continuous functions are exactly the polynomials

I was wondering which fields $K$ can be equipped with a topology such that a function $f:K \to K$ is continuous if and only if it is a polynomial function $f(x)=a_nx^n+\cdots+a_0$. Obviously, the ...
123
votes
17answers
12k views

Why can ALL quadratic equations be solved by the quadratic formula?

In algebra, all quadratic problems can be solved by using the quadratic formula. I read a couple of books, and they told me only HOW and WHEN to use this formula, but they don't tell me WHY I can use ...
88
votes
1answer
3k views

All polynomials with no natural roots and integer coefficients such that $\phi(n)|\phi(P(n))$

Let $P(x)$ be a polynomial with integer coefficients such that the equation $P(x)=0$ has no positive integer solutions. Find all polynomials $P(x)$ such that for all positive integers $n$ we have ...
53
votes
3answers
729 views

A real number $x$ such that $x^n$ and $(x+1)^n$ are rational is itself rational

Let $x$ be a real number and let $n$ be a positive integer. It is known that both $x^n$ and $(x+1)^n$ are rational. Prove that $x$ is rational. What I have tried: Denote $x^n=r$ and $(x+1)^n=s$ ...
49
votes
5answers
2k views

Why are the solutions of polynomial equations so unconstrained over the quaternions?

An $n$th-degree polynomial has at most $n$ distinct zeroes in the complex numbers. But it may have an uncountable set of zeroes in the quaternions. For example, $x^2+1$ has two zeroes in $\mathbb ...
46
votes
7answers
6k views

Prove every odd integer is the difference of two squares

I know that I should use the definition of an odd integer ($2k+1$), but that's about it. Thanks in advance!
45
votes
5answers
1k views

Polynomials such that roots=coefficients

Here is my question : Are there monic polynomials with degree $\geq 5$ such that they have the same real all non zero roots and coefficients ? Mathematically, prove or disprove the existence ...
42
votes
16answers
50k views

What is a real world application of polynomial factoring?

The wife and I are sitting here on a Saturday night doing some algebra homework. We are factoring polynomials and we both had the same thought at the same time: when are we going to use this? I feel ...
39
votes
5answers
3k views

Continuity of the roots of a polynomial in terms of its coefficients

It's commonly stated that the roots of a polynomial are a continuous function of the coefficients. How is this statement formalized? I would assume it's by restricting to polynomials of a fixed ...
39
votes
4answers
1k views

AM-GM-HM Triplets

I want to understand what values can be simultaneously attained as the arithmetic (AM), geometric (GM), and harmonic (HM) means of finite sequences of positive real numbers. Precisely, for what points ...
38
votes
9answers
56k views

Is there a general formula for solving 4th degree equations?

There is a general formula for solving quadratic equations, namely the Quadratic Formula. For third degree equations of the form $ax^3+bx^2+cx+d=0$, there is a set of thee equations: one for each ...
38
votes
1answer
859 views

Is $1+x+\frac{x^2}2+\dots+\frac{x^n}{n!}$ irreducible?

The polynomial $f(x)=1+x+\frac{x^2}2+\dots+\frac{x^n}{n!}$ often appears in algebra textbooks as an illustration for using derivative to test for multiple roots. Recently, I stumbled upon Example ...
34
votes
3answers
6k views

The Stupid Computer Problem : can every polynomial be written with only one $x$?

When I was a child, I wanted to be a mathematician so I asked my parents to buy me a computer to make super complex calculations. Of course, they were not crazy enough to buy an expensive super ...
34
votes
1answer
1k views

Decomposing polynomials with integer coefficients

Can every quadratic with integer coefficients be written as a sum of two polynomials with integer roots? (Any constant $k \in \mathbb{Z}$, including $0$, is also allowed as a term for simplicity's ...
31
votes
4answers
919 views

$p_n(x)=p_{n-1}(x)+p_{n-1}^{\prime}(x)$, then all the roots of $p_k(x)$ are real

$p_0(x)=a_mx^m+a_{m-1}x^{m-1}+\dotsb+a_1x+a_0(a_m,\dotsc,a_1,a_0\in\Bbb R)$ is a polynomial, and $$p_n(x)=p_{n-1}(x)+p_{n-1}^{\prime}(x),\qquad n=1,2,\dotsc$$ then, there exist $N\in\Bbb N$, such ...
31
votes
7answers
1k views

Appearance of Formal Derivative in Algebra

When studying polynomials, I know it is useful to introduce the concept of a formal derivative. For example, over a field, a polynomial has no repeated roots iff it and its formal derivative are ...
29
votes
3answers
2k views

Does multiplying polynomials ever decrease the number of terms?

Let $p$ and $q$ be polynomials (maybe in several variables, over a field), and suppose they have $m$ and $n$ non-zero terms respectively. We can assume $m\leq n$. Can it ever happen that the product ...
29
votes
7answers
3k views

Using Gröbner bases for solving polynomial equations

In my attempts to understand just how computer algebra systems "do things", I tried to dig around a bit on Gröbner bases, which are described almost everywhere as "a generalization of the Euclidean ...
29
votes
2answers
721 views

Are most rational quintics unsolvable?

It is well-known that, as polynomials of degree exceeding 4, there exist quintics whose roots cannot be solved for by radicals (Abel-Ruffini theorem). So we can divide the set of rational quintics ...
28
votes
4answers
884 views

Conjecture: Every analytic function on the closed disk is conformally a polynomial.

Here is my conjecture, any proof, counter-example, or intuitions? If $f$ is analytic on $\text{cl}(\mathbb{D})$ (that is, analytic on some open set containing $\text{cl}(\mathbb{D})$), then there is ...
28
votes
2answers
782 views

Why does this distribution of polynomial roots resemble a collection of affine IFS fractals?

Consider the following spectacular image, created by Sam Derbyshire and described in John Baez's article "The Beauty of Roots": In this image are plotted all the complex roots of all polynomials of ...
26
votes
2answers
2k views

Factorize $(x+1)(x+2)(x+3)(x+6)- 3x^2$

I'm preparing for an exam and was solving a few sample questions when I got this question - Factorize : $$(x+1)(x+2)(x+3)(x+6)- 3x^2$$ I don't really know where to start, but I expanded everything to ...
26
votes
3answers
405 views

Patterns of the zeros of the Faulhaber polynomials (modified)

Faulhaber polynomial of order $p \in \Bbb{N}$ is defined as the unique polynomial of degree $p+1$ satisfying $$ S_{p}(n) = \sum_{k=1}^{n} k^p $$ for $n = 1, 2, 3, \cdots$. For example, ...
26
votes
1answer
494 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 ...
25
votes
4answers
4k views

Is it possible for a quadratic equation to have one rational root and one irrational root?

Is it possible for a quadratic equation to have one rational root and one irrational root? Yes, a pretty straightforward question. Is it possible?
25
votes
9answers
2k views

why is $\sum\limits_{k=1}^{n} k^m$ a polynomial with degree $m+1$ in $n$

why is $\sum\limits_{k=1}^{n} k^m$ a polynomial with degree $m+1$ in $n$? I know this is well-known. But how to prove it rigorously? Even mathematical induction does not seem so straight-forward. ...
25
votes
2answers
1k views

Polynomials irreducible over $\mathbb{Q}$ but reducible over $\mathbb{F}_p$ for every prime $p$

Let $f(x) \in \mathbb{Z}[x]$. If we reduce the coefficents of $f(x)$ modulo $p$, where $p$ is prime, we get a polynomial $f^*(x) \in \mathbb{F}_p[x]$. Then if $f^*(x)$ is irreducible and has the same ...
25
votes
3answers
828 views

Galois groups of polynomials and explicit equations for the roots

Lets say I have calculated the galois group of some polynomial and I also have the subgroup structure. What's an effective procedure to turn the group into equations for the actual roots of the ...
25
votes
2answers
705 views

Countability of the zero set of a real polynomial

This is the question from my calculus homework: Is it possible for a polynomial $f\colon\, \mathbb{R}^{n}\to \mathbb{R}$ to have a countable zero-set $f^{-1}(\{0\})$? (By countable I mean countably ...
23
votes
6answers
2k views

Find all polynomials $P$ such that $P(x^2+1)=P(x)^2+1$

Find all polynomials $P$ such that $P(x^2+1)=P(x)^2+1$
23
votes
2answers
2k views

Is factoring polynomials as hard as factoring integers?

There seems to be a consensus that factorization of integers is hard (in some precise computational sense.) Is it known whether polynomial factorization is computationally easy or hard? One thing I ...
23
votes
1answer
546 views

An awful identity

We take place on $\mathbb C(x_1,...,x_r,x'_1,...,x'_p,u_0,...,u_r,u'_0,...,u'_p)$ with $r,p\in \mathbb N$ Show that : $$\displaystyle{\sum_{i=1}^r \left( \frac{\prod_{j=0}^r (u_j-x_i) ...
22
votes
2answers
534 views

How to show that a root of the equation $x (x+1)(x+2) … (x+2009) = c $ can have multiplicity at most 2?

How to show that a root of the equation $$x (x+1)(x+2) ....... (x+2009) = c $$ can have multiplicity at most 2 , and to find the value of $ c $ for which this is possible. I proceeded by using the ...
21
votes
5answers
702 views

Solving a peculiar system of equations

I have the following system of equations where the $m$'s are known but $a, b, c, x, y, z$ are unknown. How does one go about solving this system? All the usual linear algebra tricks I know don't apply ...
20
votes
7answers
457 views

Which polynomials fix the unit circle?

Find all polynomials $P(x)$ with real coefficients such that for every $x,y\in \mathbb{R}$ satisfying $x^2+y^2=1$ we have $$P(x)^2+P(y)^2=1$$
20
votes
2answers
477 views

Distance from $x^n$ to lesser polynomials

I am interested in the $L_1$ distance of $x^n$ to the $\mathbb R$-span of $\{1,x,\ldots,x^{n-1}\}$ over some interval. We can WLOG consider the interval $[0,1]$ (say) because scaling and shifting only ...
20
votes
2answers
782 views

How to prove that $f(x)=(x-1)^2(x-2)^2(x-3)^2\cdots(x-2013)^2+2014$ is reducible?

Let $$f(x)=(x-1)^2(x-2)^2(x-3)^2\cdots(x-2013)^2+2014\tag{1}$$ Prove or disprove: $f(x)$ is reducible on the field of rational numbers $Q$. my try: since I know this ...
20
votes
1answer
316 views

$\{a^{k_1}\}=\{a^{k_2}\}=\{a^{k_3}\}$

Let $a\in\mathbb{R}\setminus\mathbb{Z}$. Prove or disprove that there do not exist three distinct $k_1, k_2, k_3\in\mathbb{N}$ such that $\{a^{k_1}\}=\{a^{k_2}\}=\{a^{k_3}\}\neq 0$, where ...
19
votes
2answers
455 views

For polynomial $f$, does $f$(rational) = rational$^2$ always imply that $f(x) = g(x)^2$?

If $f(x)$ is a polynomial with rational coefficients such that for every rational number $r$, $f(r)$ is the square of a rational number, can we conclude that $f(x) = g(x)^2$ for some other ...
18
votes
5answers
4k views

How do I prove that $x^p-x+a$ is irreducible in a field with $p$ elements when $a\neq 0$?

How do I prove that $x^p-x+a$ is irreducible in a field with $p$ elements when $a\neq 0$? Right now I'm able to prove that it has no roots and that it is separable, but I have not a clue as to ...
18
votes
3answers
2k views

Why is it so hard to find the roots of polynomial equations?

The question that follows was inspired by this question: When trying to solve for the roots of a polynomial equation, the quadratic formula is much more simple than the cubic formula and the cubic ...
18
votes
3answers
582 views

Prove that a positive polynomial function can be written as the squares of two polynomial functions

Let $f(x)$ be a polynomial function with real coefficients such that $f(x)\geq 0 \;\forall x\in\Bbb R$. Prove that there exist polynomials $A(x),B(x)$ with real coeficients such that ...
18
votes
1answer
352 views

$[(x-a_1)(x-a_2) \cdots (x-a_n)]^2 +1$ is irreducible over $\mathbb Q$

Suppose that $a_1,a_2, \cdots, a_n$ are $n$ different integers. Then $[(x-a_1)(x-a_2) \cdots (x-a_n)]^2 +1$ is irreducible over $\mathbb Q$. I've no idea why it is true. Thanks very much.
18
votes
1answer
191 views

How many pairs of nilpotent, commuting matrices are there in $M_n(\mathbb{F}_q)$?

As a follow-up to this question, I've been doing some work counting pairs of commuting, nilpotent, $n\times n$ matrices over $\mathbb{F}_q$. So far, I believe that for $n=2$, there are $q^3+q^2-q$ ...
18
votes
2answers
510 views

Expressing a root of a polynomial as a rational function of another root

Is there an easy way to tell how many roots $f(x)$ has in $\Bbb{Q}[x]/(f)$ given the coefficients of the polynomial $f$ in $\Bbb{Q}[x]$? Is there an easy way to find the roots as rational ...
17
votes
2answers
573 views

Prove that If $f$ is polynomial function of even degree $n$ with always $f\geq0$ then $f+f'+f''+\cdots+f^{(n)}\geq 0$. [duplicate]

I can't solve this problem: Suppose $f$ is polynomial function of even degree $n$ with always $f\geq0$. Prove that $f+f'+f''+\cdots+f^{(n)}\geq 0$.
17
votes
3answers
2k views

On applying the quadratic formula to a first-degree equation

You're probably thinking, "Why?" Please let me explain... It is (very) well-known that $$ \forall (a,b,c,x) \in \mathbb{C}^* \times \mathbb{C}^3: ax^2 + bx + c = 0 \Leftrightarrow x = \frac{-b \pm ...
17
votes
2answers
5k views

Number of monic irreducible polynomials of degree $p$ over finite fields

Suppose $F$ is a field s.t $\left|F\right|=q$. Take $p$ to be some prime. How many monic irreducible polynomials of degree $p$ can exist over $F$? Thanks!
17
votes
2answers
948 views

Let $a_{i} \in\mathbb{R}$ ($i=1,2,\dots,n$), and $f(x)=\sum_{i=0}^{n}a_{i}x^i$ such that if $|x|\leqslant 1$, then $|f(x)|\leqslant 1$. Prove that:

Let $a_{i} \in\mathbb{R}$ ($i=1,2,\dots,n$), and $f(x)=\sum_{i=0}^{n}a_{i}x^i$ such that if $|x|\leqslant 1$, then $|f(x)|\leqslant 1$. Prove that: $|a_{n}|+|a_{n-1} | \leqslant 2^{n-1}$. ...