Math Is Fun Forum

  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#1 2011-01-22 02:38:22

Registered: 2007-02-23
Posts: 6,868

Ricky, I need your help

Well, anyone who knows about Galois theory can help me here. smile

I’m trying to construct finite fields with
elements, where p is a prime and n > 1 is an integer. I’ve come up with



i.e. the quotient ring of the ring of polynomials over the field of integers modulo p by the principal ideal generated by

, an irreducible polynomial of degree n. The ideal generated by the irreducible polynomial is maximal; since it is also a proper ideal, the quotient ring must be a field. A typical element in it has the form
; there are p possible values for
for each
and so there are
elements altogether. Hence it’s a finite field with

Now my question is: given any p and any n (> 1), can we always find an irreducible polynomial of degree n in

? Ricky? Anyone? neutral

Last edited by JaneFairfax (2011-01-22 02:44:03)


#2 2011-01-23 01:38:33

David Bundy

Re: Ricky, I need your help

Yes, we know that the elements of the field of

elements are precisely the zeros of the polynomial
. Furthermore the elements of this field which are not in the field of
elements must be the zeros of irreducible polynomials of degree precisely n in
, since the degree of the Galois extension which they generate over
must be exactly n, otherwise they would be elements of the smaller field.

#3 2011-01-23 02:04:54

David Bundy

Re: Ricky, I need your help

Sorry that should be the polynomial

. There is also a little work required to show that all the zeros of the polynomial are distinct and form a field.

Board footer

Powered by FluxBB