Solving Polynomials (mod p) Problems

  • Thread starter Thread starter ascheras
  • Start date Start date
  • Tags Tags
    Polynomials
ascheras
Messages
14
Reaction score
0
I'm having problems finding all integer solutions to some of the higher degree polynomials.

for p(x)= x^3− 3x^2+ 27 ≡ 0 (mod 1125), i get that 1125 = (3^2)(5^3).
p(x) ≡ 0 (mod 3^2), p(x) ≡ 0 (mod 5^3).
x ≡ 0, 3, 6 (mod 3^2) for 3^2
for 5^3, x ≡ 51 (mod 5^3)
then i get x=801, 51, 426 (mod 1125).

but i cannot seem to get as eloquent of an answer for p(x)= 4x^4 + 9x^3 - 5x^2 - 21x + 61.

can anyone help? i know you start out the same way. perhaps there is an easier way?
 
Physics news on Phys.org
What snag are you running into? Everything should work out the same way. Were you able to find zeros mod 5^3 and mod 3^2? (I'm assuming the same modulus for both questions)
 
maybe i don't have the right zeros... i'll try again and see what i get.
 
for the zeros, i got:

b=3, 1, 2

i got no solutions for b= 1,2
for b= 3 i got x=8 (mod 5)
 

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

I Localizing single variable quotient polynomial ring at a prime ideal
Replies
6
Views
704
I Quintic Polynomial Tschirnhaus Transform: Possible complex Bring Radicals
Replies
0
Views
2K
I How to show ##p(x)=g(x)x\pm 1\in\Bbb{Q}[x]## is irreducible in ##\Bbb{Q}_{\Bbb{Z}}[x]##?
Replies
48
Views
3K
I Solve the problem involving Rings
Replies
5
Views
2K
I Finite fields, irreducible polynomial and minimal polynomial theorem
Replies
6
Views
3K
MHB Orthogonal Complement of Polynomial Subspace?
Replies
2
Views
2K
B About a definition: What is the number of terms of a polynomial P(x)?
Replies
48
Views
3K
I Looking for a creative or quick method for finding roots in GF(p^n)
Replies
3
Views
1K
I Is This a Valid Basis for the Set of Polynomials with \( p(0) = p(1) \)?
Replies
39
Views
3K
MHB Solving Congruences with Polynomials: A Prime Challenge
Replies
5
Views
3K

Hot Threads

Recent Insights

Back
Top