Is there a general technique for solving depressed cubic modulus polynomial? For instance, how would you solve the equation $a^3 + a + 21 = 0 \pmod{43}$?. My attempts eventually ended up with solving $x^3 = k \pmod{43}$. In other words, what is the technique for solving the second equation without guessing and checking?
2026-04-02 06:02:22.1775109742
Solving a depressed cubic polynomial in modulus.
139 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in ABSTRACT-ALGEBRA
- Feel lost in the scheme of the reducibility of polynomials over $\Bbb Z$ or $\Bbb Q$
- Integral Domain and Degree of Polynomials in $R[X]$
- Fixed points of automorphisms of $\mathbb{Q}(\zeta)$
- Group with order $pq$ has subgroups of order $p$ and $q$
- A commutative ring is prime if and only if it is a domain.
- Conjugacy class formula
- Find gcd and invertible elements of a ring.
- Extending a linear action to monomials of higher degree
- polynomial remainder theorem proof, is it legit?
- $(2,1+\sqrt{-5}) \not \cong \mathbb{Z}[\sqrt{-5}]$ as $\mathbb{Z}[\sqrt{-5}]$-module
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 MODULAR-ARITHMETIC
- How do I find the least x that satisfies this congruence properties?
- Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)
- Remainder of $22!$ upon division with $23$?
- Does increasing the modulo decrease collisions?
- Congruence equation ...
- Reducing products in modular arithmetic
- Product of sums of all subsets mod $k$?
- Lack of clarity over modular arithmetic notation
- How to prove infinitely many integer triples $x,y,z$ such that $x^2 + y^2 + z^2$ is divisible by $(x + y +z)$
- Can $\mathbb{Z}_2$ be constructed as the closure of $4\mathbb{Z}+1$?
Related Questions in CUBICS
- Roots of a complex equation
- Cubic surfaces and 27 lines
- Polynomial Equation Problem with Complex Roots
- Cubic Discriminant
- Is it always possible to rearrange an equation desirably?
- Form an equation whose roots are $(a-b)^2,(b-c)^2,(c-a)^2.$
- if $x^3 + px^2+qx+r = 0$ has three real roots, show that $p^2 \ge 3q$
- The complex equation $x^3 = 9 + 46i$ has a solution of the form $a + bi$ where $a,b\in \mathbb Z$. Find the value of $a^3 + b^3$
- Roots of $z^3 + 3iz^2 + 3z + i = 0$?
- If the roots of the cubic equation $ax^3+bx^2+cx+d=0$ are equal, can one then establish a relationship between $a, b, c, d$?
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?
You can use the Cardano method. Set up $a=u+v$, then
$(u^3+3uv(u+v)+v^3)+(u+v)+21\equiv0.$
Then setting $uv\equiv-3^{-1}\equiv14$
to cancel out the $u+v$ terms gives
$u^3+v^3+21=0$
$u^3+(14u^{-1})^3+21=0$
$(u^3)^2+21u^3+35\equiv0.$
Note that $14^3=2744\equiv35$. Then we have a quadratic equation for $u^3$, which is solved by the quadratic formula:
$u^3\equiv(-21\pm\sqrt{21^2-4×35})(2^{-1})$
in which the discriminant turns out $\equiv0$! We therefore have a double root for $u$, which then implies a double root for $a$. Thus $u^3\equiv(-21)2^{-1}\equiv11$.
We then must find a cube root of $11\bmod43$. If such a root exists for $u$, then we must have $11^{42/3}\equiv11^{14}\equiv1$, so $u^3\equiv11\equiv11^{15}$ and we have the candidate root
$u\equiv11^5\equiv16.$
This residue cubed does give $4096\equiv11\bmod 43$. Thus $u\equiv16,v\equiv14×16^{-1}\equiv17$, and we have a root $a\equiv33$.
Either this is the double root for $a$ or the other root must be the double root. With all roots summing to zero counting the double root twice, we must therefore have one of the root possibilities
$5,5,33, or$
$20,33,33.$
We check that $a\equiv5$ fails whereas $a\equiv20$ and $a\equiv33$ both hit, so the latter is indicated and we end with $20$ and $33$ as the distinct solutions.