1
$\begingroup$

I guess this is a known result but I could not find it on the Internet. Consider these equations formed from the reciprocals of the divisors of $n$ raised to a complex number $s=a+ib$ :

$\displaystyle 1$

$\displaystyle 1 + \frac{1}{2^s}=0$

$\displaystyle 1 + \frac{1}{3^s}=0$

$\displaystyle 1 + \frac{1}{2^s} + \frac{1}{4^s}=0$

$\displaystyle 1 + \frac{1}{5^s}=0$

$\displaystyle 1 + \frac{1}{2^s} + \frac{1}{3^s} + \frac{1}{6^s}=0$

$\displaystyle 1 + \frac{1}{7^s}=0$

$\displaystyle 1 + \frac{1}{2^s} + \frac{1}{4^s} + \frac{1}{8^s}=0$

$\displaystyle 1 + \frac{1}{3^s} + \frac{1}{9^s}=0$

$\displaystyle 1 + \frac{1}{2^s} + \frac{1}{5^s} + \frac{1}{10^s}=0$

$\displaystyle 1 + \frac{1}{11^s}=0$

$\displaystyle 1 + \frac{1}{2^s} + \frac{1}{3^s} + \frac{1}{4^s} + \frac{1}{6^s} + \frac{1}{12^s}=0$

$...$

Is it true that the zeros have real part equal to $0$ ?

Wolfram Alpha example, sums of reciprocals of divisors of 30

This Mathematica program finds some of the zeros up to the number $42$.

Clear[nn, s]; Do[  nn = i;  Total[1/Divisors[nn]^(s)];  Print[s /.Table[FindRoot[Total[1/Divisors[nn]^(s)] == 0,   {s, 5*n*I}], {n, 1, 30}]], {i, 2, 42}] 

There are cases when the FindRoot command in Mathematica gives solutions that have real part not equal to zero, but these appear to be accompanied with warning messages and I have checked numerically that those solutions are not zeros.

  • 1
    Sin$c$e you're in *Mathematica*: it might be useful for you to peer at contours: `Partition[Table[ContourPlot[{Re[DivisorSigma[-(x + I y), k]] == 0, Im[DivisorSigma[-(x + I y), k]] == 0}, {x, -10, 10}, {y, -10, 10}], {k, 2, 41}], 5] // Grid`2011-10-03

1 Answers 1

2

If $s=0$, the property fails hence one can assume without loss of generality that $s\ne0$ and that the integer $n\geqslant2$ is the product of some $p_j^{k_j}$. Define $Z=2i\pi\mathbb Z$ as the set of integer multiples of $2i\pi$.

First assume that $p_j^s\ne1$ for every $j$. Then, the sum you are interested in is $ S_n(s)=\prod_j\left(\sum_{t=0}^{k_j}p_j^{-st}\right)=\prod_j\frac{1-p_j^{-s(k_j+1)}}{1-p_j^{-s}}. $ The zeros $s$ of $S_n$ solve one of the equations $ p_j^{s(k_j+1)}=1. $ This happens if and only if $s(k_j+1)\log p_j$ is in $Z$.

On the other hand, $p_j^s=1$ for some $j$ means that $s\log p_j$ is in $Z$. For every such $j$, one should replace the contribution of $p_j$ in $S_n(s)$ by $k_j+1\ne0$.

One is left with the condition that there exists at least one $j$ such that $s\log p_j$ is not in $Z$ and $s(k_j+1)\log p_j$ is in $Z$. That is, there exists $j$ and an integer $\ell$ which is not zero modulo $k_j+1$, such that $ s=\frac{2i\pi\ell}{(k_j+1)\log p_j}. $ Note that since the $\log p_j$ are linearly independent over the rationals, this can happen for at most one prime number $p_j$ dividing $n$.

In particular the real part of $s$ must be zero.

  • 0
    M.SE keeps mutilating the link, so just type in `Table[FindRoot[1+1/2^(s)==0,{s,5*n*I}],{n,1,30}]` and you should see [this](http://i.imgur.com/SATk5.png) (.png screengrab).2011-10-04