Irreducible Polynomials p 5 degree 4

  • Thread starter Thread starter grandnexus
  • Start date Start date
  • Tags Tags
    Degree Polynomials
grandnexus
Messages
8
Reaction score
0
I am attempting to construct a field containing 625 elements and should be in the form Zn[x] mod f(x).

Factoring 625 leads to 5^4. So I'm guessing my field will be GF(5^4). So in order for me to construct a field with all elements in it, I need f(x) to be some irreducible polynomial mod 5 of degree 4.

How can I go about finding irreducible polynomials? I know I can choose all the polynomials below degree 4 with coefficients mod 5 and attempt to find one without factors, but that would take forever. Is there a quick way to do this or a list of precomputed irreducible polynomials given GF(p^n) where p is prime and n is greater than 1??

Thanks.
 
Physics news on Phys.org
I can't imagine anyone's bothered to precompute anything. The solution is to think about F_5, the field with 5 elements, and decide if you know any polynomial that every element of F_5 satisfies.
 

Thread '##(A/\mathfrak{a})_{\mathfrak{p}/\mathfrak{a}}## and its isomorphism?'

I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
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 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 Looking for a creative or quick method for finding roots in GF(p^n)
Replies
3
Views
1K
I Irreducible polynomials and prime elements
Replies
5
Views
2K
MHB The polynomial is irreducible over Q(i)
Replies
16
Views
3K
I Quintic Polynomial Tschirnhaus Transform: Possible complex Bring Radicals
Replies
0
Views
2K
I Finite fields, irreducible polynomial and minimal polynomial theorem
Replies
6
Views
3K
MHB The irreducible polynomial is not separable
Replies
1
Views
2K
MHB Prove the polynomial f(x)=x^2-q is irreducible in F_p[x]?
Replies
1
Views
2K
I Localizing single variable quotient polynomial ring at a prime ideal
Replies
6
Views
691
MHB Prove that there are infinitely many irreducible polynomials in Z5.
Replies
3
Views
3K

Hot Threads

Recent Insights

Back
Top