- #1
the_fox
- 28
- 0
Can anyone tell me how to find the exact number of primitive polynomials of degree n over a finite field F_q? I believe the answer is φ(q^n-1)/n, but I cannot find a proof of this.
Thanx in advance.
Thanx in advance.
What's the reasoning behind that?the_fox said:So we can say that elements of order q^n-1 in GL(n,q) can be divided in φ(q^n-1) conjugacy classes
I think this is proved in the paper I posted in the Singer cycle thread.the_fox said:By the way, I think it's true that no element in GL(n,q) has order that exceeds q^n-1. An thoughts on this?
True, but how does this relate to conjugacy?I think it becomes obvious if you notice that a Singer cycle cannot have an irreducible polynomial that is not primitive as a minimal polynomial.
Let A be an element of GL(n, q).the_fox said:By the way, I think it's true that no element in GL(n,q) has order that exceeds q^n-1. An thoughts on this?
I think so... The main point I see is that if A is a singer cycle, then GF(q)[A] is a finite field with qn elements. If something commutes with A, how does it act on this realization of GF(qn)?the_fox said:I've also noticed that s.c. commute only with their powers, i.e., are self centralising. Can we prove that?
Primitive polynomials in finite fields are polynomials with coefficients in a finite field that generate all the elements of the field when used as exponents in the polynomial. In other words, they are irreducible polynomials that are used to create finite fields.
The number of primitive polynomials in a finite field of order q can be found using the formula: (q^n - 1)/(n), where n is the degree of the polynomial. This formula assumes that the primitive polynomial has only one root in the field.
Finding the number of primitive polynomials in finite fields is important because these polynomials play a crucial role in many areas of mathematics and computer science, such as coding theory, cryptography, and finite geometry. Understanding the properties and number of these polynomials can lead to advancements in these fields.
There are several methods for finding primitive polynomials in finite fields, such as brute force searching, using the properties of irreducible polynomials, and using the properties of primitive elements in finite fields. Different methods may be more efficient depending on the size of the field and the degree of the polynomial.
Yes, the number of primitive polynomials in finite fields can be calculated for all finite fields. However, the formula for calculating this number may vary depending on the size and characteristics of the field. In some cases, the exact number may be difficult to find, but an upper bound can usually be determined.