Assume that a polynomial $p(x)$ is given. I am wondering if we may find all prime finite fields in which $p(x)$ has no root. For example if $p(x)=-x^6+3 x^5-6 x^4+7 x^3-6 x^2+3 x-1$, then $F_{11}$ is a such field. Thank you!
2026-04-09 09:09:50.1775725790
How to find all finite fields in which a given polynomial has no root.
234 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in FINITE-FIELDS
- Covering vector space over finite field by subspaces
- Reciprocal divisibility of equally valued polynomials over a field
- Solving overdetermined linear systems in GF(2)
- Proof of normal basis theorem for finite fields
- Field $\mathbb{Q}(\alpha)$ with $\alpha=\sqrt[3]7+2i$
- Subfield of a finite field with prime characteristic
- Rank of a Polynomial function over Finite Fields
- Finite fields of order 8 and isomorphism
- Finding bases to GF($2^m$) over GF($2$)
- How to arrange $p-1$ non-zero elements into $A$ groups of $B$ where $p$ is a prime number
Related Questions in IRREDUCIBLE-POLYNOMIALS
- $x^{2}(x−1)^{2}(x^2+1)+y^2$ is irreducible over $\mathbb{C}[x,y].$
- Is the following polynomial irreductible over $\mathbb{Z}[X]$?
- Does irreducibility in $\mathbb{F}_p[x]$ imply irreducibility in $\mathbb{Q}[x]$?
- discriminant and irreducibility of $x^p - (p+1)x - 1$
- galois group of irreducible monic cubic polynomial
- When will $F[x]/\langle p(x)\rangle$ strictly contain $F$?
- On reducibility over $\mathbb{Z}$ of a special class of polynomials .
- Eisenstein's criterion over polynomials irreducible
- Optimal normal basis in Tower field construction
- If $f$ has $\deg(f)$ distince roots whose order are the same, then is $f$ irreducible?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Your example polynomial $$p(x) = -x^6 + 3 x^5 - 6 x^4 + 7 x^3 - 6 x^2 + 3 x - 1=-(x^2-x+1)^3,$$ so for this particular polynomial it is easy to give a general answer. This is because the quadratic $x^2-x+1$ is the sixth cyclotomic polynomial. It has the obvious double root $x=-1$ modulo $p=3$. Otherwise it has zeros in the prime field $K=\Bbb{F}_p$ if and only $K$ has sixth roots of unity, which happens if and only if $p\equiv1\pmod 6$.
In general, for a random polynomial $f(x)$ with integer coefficients, this is a difficult question. If we know the Galois group $G$ of $f(x)$ as a group of permutations of roots of $f$, then Chebotarev's density theorem gives us a method for finding the fraction of primes for which there are modular zeros. But, in general the set of such primes won't be given by congruence conditions. That happens only (at least that's how I understand the situation) when the group $G$ is abelian. Class field theory has a lot to say about that.