I’m back after a bit of a hiatus for the holidays! Last time we saw how the principle of Möbius inversion arises from considering the function from the point of view of Dirichlet convolution. Put simply, the Möbius function is the inverse of with respect to Dirichlet convolution. As an example, we noted that (that is, the sum of over all divisors of is equal to ), and hence by Möbius inversion .
This is far from earth-shattering, but it’s fun to see how a number-theoretic function like arises in a simple formula involving Dirichlet convolution, and how Möbius inversion allows us to quickly derive a related but non-obvious fact. Let’s do a few more!
First, let’s consider . We have
which is just counting the number of divisors of . This function is often denoted . For example, has six divisors (namely, 1, 2, 3, 4, 6, and 12), so . Likewise (1 and 7), (1, 2, and 4), and so on.
The above equation can be restated as , so by Möbius inversion, we immediately conclude that , that is,
For example, we can check this for :
As another example, gives us , the sum of the divisors of . This is usually denoted . For example, , , , and so on. Often we also define to be the sum of all the divisors of other than itself, i.e. the proper divisors. Perfect numbers like 6 and 28 are those for which .
Again, since , by Möbius inversion we immediately conclude ; for example, again when , we have