Number of primative roots in finite fields of order p^n

Click For Summary
The number of primitive roots in finite fields of order p^n is indeed given by the Euler totient function φ(p^n - 1). In a finite field F = GF(p^n), the multiplicative group of units F* is cyclic with an order of p^n - 1. The number of generators of this cyclic group, which are the primitive elements, is φ(p^n - 1). Therefore, the statement about the number of primitive roots holds true for finite fields of order p^n. This confirms that the relationship between primitive roots and the Euler totient function applies consistently across these fields.
Bourbaki1123
Messages
326
Reaction score
0
Is it true as it is for finite fields of order p^1, that the number of primitive roots of fields of order p^n is the euler totient of (P^n-1)? If not is there a different rule for the number?
 
Physics news on Phys.org
Well, say you have a finite field F = GF(pn). Then F*, the multiplicative group of units of F, is cyclic and has order pn - 1. But the number of generators of a cyclic group G is φ(|G|), so F* has φ(pn - 1) generators, i.e. F has φ(pn - 1) primitive elements.

Is that what you were asking?
 
I am studying the mathematical formalism behind non-commutative geometry approach to quantum gravity. I was reading about Hopf algebras and their Drinfeld twist with a specific example of the Moyal-Weyl twist defined as F=exp(-iλ/2θ^(μν)∂_μ⊗∂_ν) where λ is a constant parametar and θ antisymmetric constant tensor. {∂_μ} is the basis of the tangent vector space over the underlying spacetime Now, from my understanding the enveloping algebra which appears in the definition of the Hopf algebra...

Similar threads

  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K