Constructing a Finite Field of Order 16 and Finding Primative Element

fireisland27
Messages
10
Reaction score
0

Homework Statement



Construct a finite field of order 16. And find a primative element.

Homework Equations





The Attempt at a Solution



What I did was find an irreducible polynomial in Z/<2> of degree 4. I used f(x)=x^4+x+1.
Then I took a to be a root of f(x) and set a^4=a+1. Then to make the field I just took powers of a. a is clearly a primitive element.
This seems too easy. Does this indeed produce the field? And does this exact method work for constructing any finite field? And if so doesn't it always give us a primitive element right away?
 
Physics news on Phys.org
Yes, I believe this solution is correct.

However, finding the primitive element is in general much harder. If P(X) is an irreducible polynomial, and if you're working in the field \mathbb{F}_p[X]/(P(X)), then it is not always the case that X is the primitive element. In fact, finding the primitive element of a finite field is quite a difficult programming problem nowadays, certainly for big fields...
 
What would be an example where x is not a primitive element?
 
For example \mathbb{F}_3[X]/(X^2+1) is a field of 9 elements. But the generator is X+1, rather then X...
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top