I want to construct an irreducible polynomial of degree $2$ over $\mathbb{F}_p$ where $p$ is a prime that can be written as $4k+1$. My attempt is as follow: we can assume that this polynomial is of the form ${x^2} + ax + b$ for some $a,b \in {\mathbb{F}_p}$. So for all $\lambda \in {F_p}$, $p$ doesn't divide ${\lambda ^2} + a\lambda + b$. It follows that ${\lambda ^2}$ is not equal to $a\lambda + b \bmod p$. If we can find some $a,b \in {\mathbb{F}_p}$ such that $a\lambda + b$ is a nonresidue for all $\lambda \in {F_p}$, it is ok. But I cannot. I wait your response.
2026-04-12 05:30:31.1775971831
Constructing an irreducible polynomial of degree $2$ over $\mathbb{F}_p$
122 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in NUMBER-THEORY
- Maximum number of guaranteed coins to get in a "30 coins in 3 boxes" puzzle
- Interesting number theoretical game
- Show that $(x,y,z)$ is a primitive Pythagorean triple then either $x$ or $y$ is divisible by $3$.
- About polynomial value being perfect power.
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Reciprocal-totient function, in term of the totient function?
- What is the smallest integer $N>2$, such that $x^5+y^5 = N$ has a rational solution?
- Integer from base 10 to base 2
- How do I show that any natural number of this expression is a natural linear combination?
- Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)
Related Questions in POLYNOMIALS
- Alternate basis for a subspace of $\mathcal P_3(\mathbb R)$?
- Integral Domain and Degree of Polynomials in $R[X]$
- Can $P^3 - Q^2$ have degree 1?
- System of equations with different exponents
- Can we find integers $x$ and $y$ such that $f,g,h$ are strictely positive integers
- Dividing a polynomial
- polynomial remainder theorem proof, is it legit?
- Polyomial function over ring GF(3)
- If $P$ is a prime ideal of $R[x;\delta]$ such as $P\cap R=\{0\}$, is $P(Q[x;\delta])$ also prime?
- $x^{2}(x−1)^{2}(x^2+1)+y^2$ is irreducible over $\mathbb{C}[x,y].$
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
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?
$x^2-b$ is irreducible mod $p$ iff $b$ is a quadratic non-residue mod $p$.
Since half the classes mod $p$ are quadratic non-residues, there are plenty of choices for $b$.
Explicitly finding one $b$ for a given $p$ is another matter, although it is usually quite small: see A053760. In particular, the smallest quadratic non-residue mod $p$ is at most $\sqrt{p}+1$ (proof).