*2018 April 12*

In this post, I plan to introduce a few new special functions that appear in number theory and some infinite series identities that they satisfy. In particular, I will show some links between these number-theoretical functions and the Riemann Zeta function, and introduce a more general type of series, the Dirichlet Series, which is closely tied to the Zeta function. Finally, at the end, I will calculate a couple of series that require cumulative knowledge of Dirichlet Series and the Zeta function.

Recall the series definition of the **Riemann Zeta function**:
This is a specific case of a more general *type* of series: the **Dirichlet Series**. The Dirichlet Series for a function $f$ is defined as
We can see immediately the trivial result
Fear not, it gets much more interesting than this. Next, consider the Dirichlet Series
It can be calculated as follows:
Thus, we have

I will now calculate a couple of interesting Dirichlet series involving the $\gcd$ function, which I will later generalize. They can be calculated using a bit of combinatorics. One of the simplest examples is Notice that $\gcd(2,n)$ is equal to $1$ if $n$ is odd and $2$ if $n$ is even. This allows us to rewrite the sum as This works because each term with an odd index occurs once (in the first series) and each term with an even index occurs twice (once in the first series and once in the second). Thus, we have Now consider the slightly more complicated example of It can be evaluated in the same way by noticing that $\gcd(6,n)$ is equal to $1$ if $n$ is divisible by neither $2$ or $3$, $2$ if $n$ is divisible by $2$ but not $3$, $3$ if $n$ is divisible by $3$ but not $2$, and $6$ if $n$ is divisible by $6$. From this, we may write the series as All terms whose indices are coprime to $6$ are added once by the first series. The terms whose indices are divisible by $2$ but not $3$ are added once by the first series and once by the second series, counting each a total of twice. The terms whose indices are divisible by $3$ but not $2$ are added once by the first series and twice by the third series, counting each a total of three times. Finally, the terms whose indices are divisible by $6$ are added once by the first series, once by the second, twice by the third, and twice by the fourth, counting each a total of $6$ times as desired. Thus, we have

I would now like to define a couple of number-theoretical functions that I will use later in the post. First is the **divisor function** $\sigma_\alpha (n)$, defined as the sum of the $\alpha$ th powers of the divisors of $n$ (including $1$ and $n$). defined using mathematical language, this is
This function is **multiplicative**, meaning that for any coprime positive integers $m$ and $n$, the function satisfies
The special case $\sigma_0 (n)$ is sometimes written simply as $d(n)$, and is just the number of divisors of $n$.

Next is Euler's **totient function** $\phi(n)$, defined as the number of positive integers less than $n$ that are coprime to $n$ (including $1$). It satisfies a few interesting identities that we will use, including the identity
for any positive integer $n$. The totient function is also multiplicative.

The function $\Omega(n)$ counts the number of prime factors of $n$ *with* multipliticy, and the function $\omega(n)$ counts the number of prime factors of $n$ *without* multiplicity. The first function satisfies
for *any* positive integers $m$ and $n$, and the second satisfies
for coprime positive integers $m$ and $n$. The **Liouville function** $\lambda(n)$ is defined as
It is *also* multiplicative.

Many of these properties are pretty easy to prove (except for the proof that $\phi(n)$ is multiplicative, which gave me a bit of trouble), so I won't prove them, and I'll dive right in to the infinite series.

Briefly returning to the $\gcd$ series considered earlier, the strategy I used can be generalized, which yields the easily-proven result

This follows directly from the previously described propert of the Totient function: Now it's time for some more interesting Dirichlet series.

First recall the following elementary property of infinite series This can be used to prove a couple very interesting and useful properties regarding number theoretical series. I will begin with a simple strategy for evaluating series of these type. This strategy is limited, so I will only do a few series, but I will later introduce a much more effective strategy that can be used for all of them.

Suppose $f(n)$ is some function, and $g(n)$ is the function defined as Then consider the following: We can use this to calculate the Dirichlet series of the Euler Totient function mentioned earlier, using this property that I also stated earlier: Letting $f(n)=\phi(n)$ and $g(n)=n$, we have or This can also be used to calculate the Dirichlet series of the Mobius function, since is equal to $1$ if $n=1$ and $0$ otherwise. This allows us to say that I'll do one more example. Since $\sigma_a$ is defined as we have that of course, the LHS is so we have the result This strategy can be used to a greater extent - for example, it can be used to calculate generally the value of $D(\sigma_a(n),s)$ for any $a$. However, for more difficult Dirichlet series like $D(d(n^2),s)$ or $D(d^2(n),s)$, it is advisable to use the following technique.

Recall the property of infinite series mentioned earlier. I will now use it to develop a much more useful strategy, especially those with multiplicative summands. Suppose that the function $f(n)$ is multiplicative and that we are considering the infinite series Since every positive integer has a unique prime factorization, this can be written as follows, where $p_i$ is the ith prime number: Or, since $f$ is multiplicative, Using the property of series mentioned earlier, this is equal to or, rearranging a bit, Since $f(1)=1$ for every multiplicative function $f$, this is equal to Thus, for any multiplicative function $f$, as long as the series converges, we have As a corrolary of this, we have the famous product representation of the Riemann Zeta function: However, we can do some other cool stuff with it. For example, consider the infinite series Since $d(n)$ is multiplicative, and since $d(p^k)=k+1$ for any prime $p$ and nonnegative integer $k$, we have the following: I won't put this in a box, because we've already derived a more general Dirichlet series for $\sigma_a$, but it is a good example of how to use this technique. Though this technique can be applied to more exotic series (as I will show in a moment), the earlier technique provides a much more elegant derivation of $D(\sigma_a(n),s)$, whereas this one gets very ugly with algebra.

As an example of a more exotic Dirichlet series, consider $D(\sigma_a(n^2),s)$. Since $\sigma_a(p^k)=\frac{1-p^{a(k+1)}}{1-p^a}$ for $p$ prime, we have that

The last step of the above chain of equalities is justified by the product representation of the Zeta function that we obtained earlier. We now have

The following formula involving the divisor sum function can be derived in a similar way, and was first derived by Ramanujan:

Because the derivation is very similar and the algebra involved is horrendous, I will skip the derivation of this one. Instead, I will derive just two more Dirichlet series using this method: $D(\lambda(n),s)$ and $D(\mu^2(n),s)$. These two take much less time to derive because the algebra is so much less complicated. By the definition of the Liouville function, we have that $\lambda(p^k)=(-1)^k$. Thus, since the Lioville function is multiplicative, we have

which gives us the result

Now, for the last example, I will consider $D(\mu^2(n),s)$. By the definition of $\mu(n)$, it is trivial that $\mu(p^k)$ is equal to $1$ if $k=0,1$ and $0$ if $k\ge 2$. Thus, we have

and so we have

Interestingly, these last two Dirichlet series were reciprocals of each other.

These Dirichlet series can be used to derive the values of some even *more* exotic infinite series (as if these weren't exotic enough already). For example, I will demonstrate how to derive the value of the series
...where $\alpha$ is a constant. Recall that $\ln\cosh(x)$ has a series expansion in terms of the Zeta function:
It follows from this that our series is equal to
By swapping the order of summation, this is equal to
Look! The innermost series is the Dirichlet series of $\mu(n)$, which we know is the reciprocal of the Zeta function. So we have
The $\zeta(2k)$ cancels, and we are left with
Of course, this is a familiar series (Maclaurin series of the natural logarithms) and can be evaluated to obtain the weird formula

That wraps this post up! I shall leave the reader with a little Dirichlet series puzzle to work on. The question is this: can you find a number-theoretical function $f(n)$ (you may have to define it independently of the functions mentioned earlier) that has the Dirichlet series

back to home page