# 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.

21k 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 ...
8k views

### Reed Solomon Polynomial Generator

I am developing a sample program to generate a 2D Barcode. And i am using reed solomon error correction code. By Going through this article i am developing the program. But i couldn't understand how ...
3k 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. ...
120k 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 ...
7k 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 how ...
8k 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$ do exist over $F$? Thanks!
5k 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 ...
5k views

3k 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 ...
4k views

1k views

95 views

### Reducibility of polynomials modulo p [duplicate]

How do we show that $X^4-10X^2+1$ is reducible modulo every prime $p$? I've managed to show it for all primes less than 10, for primes greater than 10 we have $X^4+(p-10)X^2+1$. Where do I go from ...
1k views

### Three-variable system of simultaneous equations

$x + y + z = 4$ $x^2 + y^2 + z^2 = 4$ $x^3 + y^3 + z^3 = 4$ Any ideas on how to solve for $(x,y,z)$ satisfying the three simultaneous equations, provided there can be both real and complex ...
423 views

### Meaning of $\mathbb{R}[x]$

I ran into this expression in a paper I was reading, and I'm confused about part of the meaning. Here $u$ and $v$ are two polynomials. $$u, v \in \mathbb{R}[x]$$ I'm not really familiar with usage ...
4k 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 ...
6k views

### Derivation of binomial coefficient in binomial theorem.

How was the binomial coefficient of the binomial theorem derived? $$\frac{n!}{k!(n-k)!}$$
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. ...
Let $F$ be a field of arbitrary characteristic, $a\in F$, and $p$ a prime number. Show that $$f(X)=X^p-a$$ is irreducible in $F[X]$ if it has no root in $F$. This answer to a related question ...
A Vandermonde-matrix is a matrix of this form: \begin{pmatrix} x_0^0 & \cdots & x_0^n \\ \vdots & \ddots & \vdots \\ x_n^0 & \cdots & x_n^n \end{pmatrix} \in \mathbb{R}^{(...