Constructing a Finite Field of Order 16 and Finding Primative Element

Click For Summary

Homework Help Overview

The discussion revolves around constructing a finite field of order 16 and identifying a primitive element within that field. The original poster attempts to use an irreducible polynomial in Z/2Z of degree 4 to establish the field.

Discussion Character

  • Exploratory, Assumption checking

Approaches and Questions Raised

  • The original poster describes their approach of using the polynomial f(x)=x^4+x+1 and questions whether this method reliably produces the field and a primitive element. Other participants discuss the general difficulty of finding primitive elements in finite fields and provide examples to illustrate the complexity.

Discussion Status

The discussion includes some agreement on the correctness of the original poster's method, but also highlights the challenges associated with finding primitive elements in general. Multiple interpretations of the problem are being explored, particularly regarding the conditions under which a polynomial's root serves as a primitive element.

Contextual Notes

Participants note that while the original poster's method may work for constructing a finite field, it does not guarantee that the chosen element will always be primitive, raising questions about the general applicability of their approach.

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...
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
Replies
1
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 12 ·
Replies
12
Views
5K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K