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.