Primitive elements of field extension ()/() are counted using (1) principle of inclusion-exclusion, (2) Möbius inversion, and (3) Euler function. Then, an identityis obtained, where > 1, a prime, (·) Euler function, and , …, the all distinct prime divisors of