This post is about a cute equality that I discovered today. One of the joys of mathematics is to do be able to have one idea with multiple different viewpoints that enable us to see it. This equality is a very good demonstration of the philosophy.

First I will state the equality, and then I will tell you why I was dealing with it in the first place. The equality is the following.

**Proposition **

Suppose , are such that . Let denote the multiplicative order of in the group . Then the following holds

**Proof:** Both sides count the same thing, namely the number of cycles of the ‘multiplication by ‘ map . Note that because , this map is a permutation. By an easy application of the Burnside’s lemma (also known as Cauchy-Frobenius theorem and “The lemma that is not Burnside’s”) on the action of the group generated by inside the permutation group of , we can get the left side of the equality. Let be this group acting on . The size of the group is undoubtably . How many elements are fixed by the element for some ? That would be the elements of the set Scratch your head a little and you will see that there are exactly such elements in .

Therefore, by plugging in the formula of the Cauchy-Frobenius lemma, we get that the number of orbits is

Now for the right hand side.

Note that for any , . Hence if we write , then permutes the elements of each of those disjoint sets. If we call , then it is clear that , being the Euler phi function. As a -set, the action of on is isomorphic to the action of on . Hence the number of cycles of the action of on as a permutation is equal to the number of cosets of which is equal to .

Hence, the right side should be the sum below.

And that’s it. I have no background in algorithmic number theory, but it does look to me that the left side should be much faster to compute than the right side of the equality. If you know the current state of the art time complexities of calculating and , please let me know via email or comments or the contact box.

Somehow this formula is not mentioned on OEIS when . Only the right side is stated there. So I’m making an edit.

Why was I thinking about this, you may ask? I am reading about Cyclic codes, and the number of cyclic codes over a finite field , where is a power of some prime is the number of factors of .

So how many cyclic codes exist for a given ? I’ll sketch the details.

It’s sufficient to ask this question only when . The answer then hinges on how many irreducibles does split into, so the number of factors is to that power (it can be shown that all irreducibles in the factorization have multiplicity 1).

We know that in the in some field extension of , the polynomial completely splits as follows, where is a primitive th root of unity.

Now for any root of , what are the conjugates of ? Because we know the structure of the Galois group, we know that the set of conjugates are . Since a complete set of conjugates would give us one irreducible, the irreducibles are in bijection with the number of cycles of the multiplication map. Hence the problem reduces to simply finding the number of cycles of .

See you next time!